Abstract: Since the mainstream forwarding protocol in opportunistic networks does not consider the sociality of node movement, a layering routing algorithm based on copy restriction and human sociality was proposed. This algorithm could dynamically adapt to divide network nodes into different communities according to the nodes intensity of social relation, in which the message copy redundancy was reduced by restricting the number of message copies, and the nodes of high activity were utilized to drive the forwarding and transferring of messages. The simulation results show that it can ensure higher delivery ratio and relatively lower delivery delay, and also reduce the resource consumption of network.

Key words: OPportunistic NETwork (OPNET), social network, community, message copy restriction, routing protocol

摘要： 针对机会网络中的主流转发协议未考虑到节点移动社会性的问题，提出一种基于副本限制和人类社会特性的路由算法。该算法根据节点间的社会关系强度，动态自适应地将节点划分为不同的社区，通过限制消息副本数来减少网络中消息的冗余，并利用活跃性高的节点带动消息的转发和传递。仿真结果表明，该协议能够保证较高的消息传输成功率和相对较低的传输时延，降低网络的资源消耗。

关键词: 机会网络, 社会网络, 社区, 消息副本限制, 路由协议