期刊文献+

DTN中基于两跳ACK确认机制的备用副本转发算法

Two-hop ACK Message Based Routing Algorithm with Alternative Copy in DTN
下载PDF
导出
摘要 针对容迟容断网络(Delay/Disruption Tolerant Networks,DTN)在遇到路由空洞问题时缺乏有效回避路由空洞区域的方法,导致信息端到端传输时延较大的问题,提出一种基于两跳ACK确认机制的备用副本转发算法。消息在空洞区域无法传播时由上一跳节点寻找其他符合条件的节点,另辟路径转发消息,从而避开路由空洞区域。仿真实验结果表明,该算法在递交率、平均时延和网络开销方面表现优于Spray and Wait等对比算法,在车载自组网中具有很强的应用性。 Aiming at the problem of lacking effective method to dodge routing holes,which makes higher delay in end to end transmission,a forwarding algorithm based on two-hop ACK mechanism with alternative copies(2HAR) was proposed.To evade routing hole area and find a new communication path effectively,when sending a message,a backup that copies of the message will be maintained by a hop node.After receiving a confirmation of ACK,copies of the message will be deleted,or find other forwarding node to send a copy of the message.Results of the simulation indicate the proposed algorithm performs better in terms to the delivery ratio,the average end-to-end delays and the network overheads,which is significative to use in the VANET.
出处 《计算机科学》 CSCD 北大核心 2016年第S2期275-277,289,共4页 Computer Science
关键词 容迟容断网络 路由空洞 两跳ACK确认机制 备用副本转发 车载自组网 DTN Routing hole Two-hop ACK mechanism Alternative copy forwarding algorithm VANET
  • 相关文献

参考文献5

二级参考文献61

  • 1Ward A, Jones A, and Hopper A. A new location technique for the active office. IEEE Personal Communications, 1997, 4(5): 42-47.
  • 2Savvides A, Han Chih-Chieh, and Strivastava M B. Dynamic fine-grained localization in ad hoc networks of sensors. In Proceedings of the Seventh ACM Annual International Conference on Mobile Computing and Networking, ROME, Italy, 2001: 166-179.
  • 3Bulusu N, Heidemann J, and Estrin D. Gps-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, 2000, 7(5): 28-34.
  • 4Priyantha N B, Chakraborty A, and Balakrishnan H. The cricket location-support system. In Proceedings of the ACM Sixth Annual International Conference on Mobile Computing and Networking, Boston, MA, 2000: 32-43.
  • 5Karp B and Kung H T. GPSR: Greedy Perimeter Stateless Routing for wireless networks. In Proceedings of the Sixth ACM Annual International Conference on Computing and Networking, Boston, MA, 2000: 243-254.
  • 6Bose P, Morin P, and Stojmenovic I, et al.. Routing with guaranteed delivery in Ad hoc wireless networks. In Proceedings of Discrete Algorithms and Methods for Mobility, Seattle, 1999: 48-55.
  • 7Datta S, Stojmenovic I, and Wu J. Internal node and shortcut based routing with guaranteed delivery in wireless networks. In Proc. of IEEE International Conference on Distributed Computing and Systems Workshops, Phoenix, AR, 2001: 461-466.
  • 8Kuhn F, Wattenhofer R, and ZoUinger A. Worst-case optimal and average-case efficient geometric Ad-Hoc routing. In Proceedings of the Fourth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Annapolis, Maryland, 2003: 267-278.
  • 9Kuhn F, Wattenhofer R, and Zhang Y, et al. Geometric Ad hoc routing: of theory and practice. In Proceedings of the 22^nd ACM Symposium on Principles of Distributed Computing, Boston, 2003: 63-72.
  • 10Toussaint G. The relative neighborhood graph of a finite planar set. Pattern Recognition, 1980, 12(4): 261-268.

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部