作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 移动互联与通信技术 • 上一篇    下一篇

一种基于历史相遇信息的容迟网络地理路由算法

王艳,李建波,宋有美,王夫沭   

  1. (青岛大学 计算机科学技术学院,山东 青岛 266071)
  • 收稿日期:2016-03-28 出版日期:2017-05-15 发布日期:2017-05-15
  • 作者简介:王艳(1989—),女,硕士研究生,主研方向为容迟网络路由算法;李建波(通信作者),教授、博士;宋有美、王夫沭,硕士研究生。
  • 基金资助:
    国家自然科学基金(61502261,61572457,61379132);山东省自然科学基金(ZR2013FQ022);山东省教育厅高校科技计划项目(J14LN85)。

A Geographic Routing Algorithm for Delay Tolerant Network Based on History Encounter Information

WANG Yan,LI Jianbo,SONG Youmei,WANG Fushu   

  1. (College of Computer Science and Technology,Qingdao University,Qingdao,Shandong 266071,China)
  • Received:2016-03-28 Online:2017-05-15 Published:2017-05-15

摘要: 为使消息在容迟网络中更有效地传输,将节点的地理位置、移动方向等地理信息与节点间的历史相遇频繁程度相结合,提出一种新的容迟网络地理路由算法。该算法将移动节点间的历史相遇信息作为分配消息副本的依据,从而减少复制策略路由算法中的副本数量。利用邻居节点移动方向所构成的夹角对中继节点的选择进一步优化,得到较高的投递率以及较低的端到端平均时延。仿真结果表明,当节点移动相对缓慢并且消息生存周期较短时,该算法的消息投递率优于Spray & Wait,Epidemic,Prophet等路由算法,在消息生存周期较短的情况下,当节点的缓存资源为限制路由算法性能的瓶颈因素时,与Epidemic算法相比,网络负载率降低40%,与Prophet算法相比负载降低了25%,有效减少了平均跳数和平均时延。

关键词: 容迟网络, 地理路由算法, 局部信息, 移动方向, 历史信息

Abstract: In order to make the message transmit in a delay tolerant network more efficiently,the node location,moving direction and other geographic information and the degree of nodes frequently encounter history are combined,this paper proposes a delay tolerant network geographic routing algorithm is proposed.The algorithm uses nodes encounter history information as news distribution copy,thereby it reduces the copy number.The angle of the moving direction of the neighbor nodes for the relay selection is further optimized,so as to achieve high delivery ratio and low average end-to-end delay.Simulation results show that when nodes move relatively slow,and news life cycle is short,the message delivery rate of the proposed algorithm is better than that of Spray & Wait,Epidemic and Prophet routing algorithms.When message life cycle is very short and the cache resource of nodes is the bottleneck factors limiting the performance of the routing algorithm,the network load rate of the proposed algorithm is less than 40% of Epidemic,less than 25% of Prophet,and average number of hops and average delay remain less.

Key words: delay tolerant network, geographical routing algorithm, local information, moving direction, history information

中图分类号: