Position-based RAPID routing algorithm for delay tolerant networks

被引:0
作者
Liu, Yong-Guang [1 ,2 ]
机构
[1] Guangdong Industry Technical College, Guangzhou
[2] China Electronics Technology Group Corporation NO.7 Research Institute, Guangzhou
来源
Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China | 2015年 / 44卷 / 06期
关键词
Delay tolerant networks; Position; RAPID; Routing; Utility;
D O I
10.3969/j.issn.1001-0548.2015.06.008
中图分类号
学科分类号
摘要
The resource allocation protocol for intentional delay (RAPID) routing algorithm applied for delay tolerant networks (DTN) adopts the utility function to avoid accidental effect on some metrics occurred in other DTN routing algorithms did. However, the problem of inter-meeting time distribution between nodes brings the algorithm's uncertainty and the limitation for applications. For this problem, a new method for computing utility function is designed based on position information. In the new method, every node acquires other node's position information by metadata exchange. The position information of a long-time-lost destination node is predicted by the gray system prediction algorithm. By minimizing messages arriving time to destination, the more detailed priority and rules of message duplication are designed. Simulations show that the new algorithm can overcome the problem in the RAPID algorithm effectively, decrease the number of message duplicate and average delay, increase message successive delivery ratio and improve the performance of the entire network further. © 2015, Editorial Board of Journal of University of Electronic Science and Technology of China. All right reserved.
引用
收藏
页码:840 / 844
页数:4
相关论文
共 15 条
  • [1] Khabbaz M., Assi C.M., Fawaz W.F., Disruption-tolerant networking: a comprehensive survey on recent developments and persisting challenges, IEEE Communications Surveys & Tutorials, 14, 2, pp. 607-640, (2012)
  • [2] Green J., Schultz J., Collaborative applications at the tactical edge through resilent group dissemination in DTN, The IEEE Military Communications Conference, (2012)
  • [3] Agarwal A., Starobinski D., Little T.D.C., Phase transition of message propagation speed in delay-tolerant vehicular networks, IEEE Transactions on Intelligent Transportation Systems, 13, 1, pp. 249-263, (2012)
  • [4] Ehasan S., Bradford K., Brugger M., Et al., Design and analysis of delay-tolerant sensor networks for monitoring and tracking free-roaming animals, IEEE Transactions on Wireless Communications, 11, 3, pp. 1220-1227, (2012)
  • [5] Xiao M., Wu J., Liu C., Et al., Tour: Time-sensitive opportunistic utility-based routing in delay tolerant networks, INFOCOM 2013, (2013)
  • [6] Sok P., Kim K., Distance-based PRoPHET routing protocol in disruption tolerant network, The 2013 International Conference on ICT Convergence (ICTC), (2013)
  • [7] Khabbaz M.J., Fawaz W.F., Assi C.M., A probabilistic and traffic-aware bundle release scheme for vehicular intermittently connected networks, IEEE Transactions on Communications, 60, 11, pp. 3396-3406, (2012)
  • [8] Tournoux P., Leguay J., Benbadis F., Et al., Density-aware routing in highly dynamic DTNs: The RollerNet case, IEEE Transactions on Mobile Computing, 10, 12, pp. 1755-1768, (2012)
  • [9] Balasubramanian A., Levine B.N., Venkataramani A., DTN routing as a resource allocation problem, SIGCOMM'07, (2007)
  • [10] Shen J., Moh S., Chung I., A priority routing protocol based on location and moving direction in delay tolerant networks, IEICE Transaction on Information and Systems, 10, pp. 2763-2775, (2010)