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

A Routing Algorithm for Opportunistic Networks Based on Community

作　　者：任智[1] 邓科[1] 黄堰江 刘艳伟[1] 周黎[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《北京联合大学学报》2015年第3期32-37,共6页Journal of Beijing Union University

基　　金：国家自然科学基金项目(60972068);长江学者和创新团队发展计划资助(IRT1299);重庆市自然科学基金(cstc2012jj A40051);重庆市科委重点实验室专项经费(D2011-24);重庆市教委科研项目(KJ120510)

摘　　要：针对采用社区划分策略的机会网络路由算法在消息传输过程中存在时延过长、冗余转发的问题,提出一种基于社区的机会网络路由算法Routing algorithm for Opportunistic Networks based on Community(RONC),通过充分利用通信重叠区域内的节点转发消息,优化转发节点判定机制,重设消息传输条件,降低消息转发次数,从而提高消息传输成功率,降低传输时延。理论分析和仿真结果显示:RONC算法在平均端到端时延、转发效率和平均存储时间等方面均优于经典的Epidemic routing算法、Prophet routing算法及其改进算法Community-driven Hierarchical Message Transmission Scheme(CHMTS)。In opportunistic networks, routing algorithms based on community division have some long Delay, redundant forwarding in the process of message transmission. In this paper, we propose a routing algorithm for opportunistic networks based on community （RONC）. RONC makes full use of the nodes within communication overlapping areas to forward messages and optimize forwarding determination mechanism to carry message nodes. Then RONC redesigns the message transmission condition and reduces the number of message forwarding which improve the efficiency of forwarding messages and reduce the average end-end delivery delay. Theoretical analysis and simulation results show that RONC outperforms an existing Epidemic routing algorithm and the Prophet algorithm and CHMTS in terms of delivery ratio, average end-end delivery delay, relay ratio, average storage time, etc.

关 键 词：社区划分 路由算法 机制 转发 通信重叠区域 

分 类 号：TN915.05[电子电信—通信与信息系统]