机会社会网络中一种基于社区的高效路由算法

An Efficient Community-based Routing Algorithm in Opportunistic Social Networks

针对机会社会网络中RADR(机会社会网络消息传送算法)存在消息传输时延偏大和消息传输成功率偏低的问题,提出一种ECRA(基于社区的高效的机会社会网络路由算法)。ECRA只选取与消息目的节点在同一个社区的邻居节点来计算重要度,并且利用连通拓扑侦听相遇节点,检测相遇节点的邻居节点中是否存在更高重要度的节点,若存在,则利用相遇节点将消息传递给具有更高重要度的邻居节点。理论分析和仿真结果表明,ECRA与RADR及相关对比算法比较,在消息传输成功率、平均端到端时延等方面的性能均得到了提升。

To solve the problems of high transmission delay and low forwarding efficiency in the Routing Algorithm based on Daily Routines(RADR)in opportunistic social networks,an Efficient Community-based Routing Algorithm is proposed(ECRA).The algorithm only selects the neighbor nodes which are in the same community with message destination node to calculate the node's important degree.The algorithm uses topological connections to intercept the encounter node.If there exists node which has higher node's importance than the encounter nodes neighbor,the message is transmitted to the encounter node neighbor nodes by the encounter node.Theoretical analysis and simulation results show that ECRA outperforms existing RADR and the correlation algorithms in terms of delivery ratio,average end-end delivery delay,relay ratio and average storage time.