中文摘要：

机会网络中主流的路由算法多数未考虑节点的社区性质。针对该问题,提出一种基于社区和社会性的机会网络路由算法。根据节点间的社会关系强度动态自适应地将节点分割为多个社区,并利用社会性高的节点带动消息的发送,逐步把消息发送至目标社区节点或社会性高的节点。仿真结果表明,与Spray and Wait和PRoPHET算法相比,该算法具有较高的传输成功率和较低的传输延迟。

英文摘要：

The properties of the community of nodes are not taken into account in most current mainstream routing algorithms in opportunistic network.In this paper,an Opportunistic Network routing algorithm based on Community and Sociality（ONCS）is proposed to solve this problem.It divides nodes of network into many communities according to social relationship strength between nodes dynamically and adaptively.Nodes of high sociality are utilized to drive message forwarding.Messages are forwarded to nodes of the same community with destination node or nodes of high sociality.Simulation results show that the proposed algorithm has higher delivery ratio and lower delivery delay compared with Spray and Wait algorithm and PRoPHET algorithm.