期刊文献+

面向DTN感染路由协议的缓存管理算法 被引量:6

Message-Period-Based Buffer Management Algorithm for Epidemic Routing Protocol of DTN
下载PDF
导出
摘要 延迟容忍网络(DTN)是一种面向移动与极端网络环境的特殊无线自组织网络。相对于传统网络,DTN中节点需要长时间存储/携带消息,进而实现消息的转发,从而使得节点缓存成为影响网络路由性能的重要因素。为优化Epidemic路由协议中缓存管理机制,避免由活跃消息丢弃所引起的路由效率降低的情况,提出了一种基于消息生存属性的缓存管理(MPBBM)算法。该算法通过综合分析消息转发次数与生存时间等因素对消息传递的影响,制定了优化的缓存替换策略,使得缓存替换过程中有限保留新产生的消息、丢弃即将失效的消息。仿真结果表明,相比于其他缓存管理算法,MPBBM算法能够有效地提升消息交付率,并显著地降低投递时延与网络开销。 Unlike traditional networks, the nodes in delay tolerant network (DTN) may storage and carry messages for a long time and then forward them somewhere, which makes the buffer sizes of the nodes become an important factor of routing efficiency. For the purposes of optimizing buffer and replacement strategy and avoiding active messages discarded, a message-period-based buffer management (MPBBM) algorithm is proposed. According to the comprehensive analysis of forwarding amount and time to live (TTL) of the messages, MPBBM forms a buffer replacement strategy to make new messages stored and inactive messages dropped. The simulation results show that MPBBM, comparing with other algorithms, can improve the delivery rate and reduce the network overhead.
出处 《电子科技大学学报》 EI CAS CSCD 北大核心 2015年第3期403-409,共7页 Journal of University of Electronic Science and Technology of China
基金 国家自然科学基金(61370212 61402127) 博士点基金优先发展领域项目(20122304130002) 中央高校基本科研业务费专项资金(HEUCFZ1213 HEUCF100601)
关键词 缓存管理 感染路由协议 DTN MPBBM buffer management DTN Epidemic MPBBM
  • 相关文献

参考文献6

二级参考文献65

  • 1唐勇,周明天,张欣.无线传感器网络路由协议研究进展[J].软件学报,2006,17(3):410-421. 被引量:201
  • 2张宪超,江贺,陈国良.节点和边都有容量的有向平面网络中的最小截和最大流[J].计算机学报,2006,29(4):544-551. 被引量:16
  • 3Burleigh S, Hooke A, Torgerson L, Fall K, Cerf V, Durst B, Scott K, Weiss H. Delay-tolerant networking: An ap- proach to interplanetary internet. IEEE Communications Magazine, 2003, 41(6): 128-136.
  • 4Jain S, Fall K, Patra R. Routing in a delay tolerant network//Proceeding of ACM SIGCOMM. Portland, USA, 2004:145 -158.
  • 5Vahdat A, Becker D. Epidemic routing for partially-connected ad hoc networks. Duke University, Durham, USA: Technical Report CS-2000-06, 2000.
  • 6Burgess J, Gallagher B, Jensen D, Levine B N. Maxprop: Routing for vehicle based disruption-tolerant networks// Proceedings of the IEEE INFOCOM. Barcelona, Spain, 2006:1 -11.
  • 7Nguyen H A, Giordano S, Puiatti A. Probabilistie routing protocol for intermittently connected mobile ad hoc network//Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. Espoo, Finland, 2007,1-6.
  • 8Nelson S C, Bakht M, Kravets R. Encounter-based routing in DTNs//Proceedings of IEEE INFOCOM. Rio de Janeiro, Brazil, 2009:846-854.
  • 9Spyropoulos T, Psounis K, Raghavendra C S. Spray and Wait: An efficient routing scheme for intermittently connected mobile nelworks//Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia, Pennsylvania, USA, 2005:252-259.
  • 10Topkis D M. A k shortest path algorithm for adaptive routing in communications networks. IEEE Transactions on Communications, 1998, 36(7): 855 -859.

共引文献51

同被引文献27

引证文献6

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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