期刊文献+

一种基于移动方向的容延迟网络受控传染路由算法 被引量:6

Moving Direction Based Controlled Epidemic Routing Algorithm for Delay Tolerant Networks
在线阅读 下载PDF
导出
摘要 容延网络具有网络拓扑频繁割裂、节点密度稀疏和移动性等特点,由于很难捕获全局拓扑知识,因而其路由设计面临着巨大挑战.当前多数基于节点局部信息的路由算法在下一跳中继节点选择时,都直接依赖于节点的位置信息,然而容延网络中节点的位置在时刻变化,这在一定程度上影响了路由选择的准确性.在多数容延网络中,节点往往是在移动一段距离之后才会改变方向,因而方向信息比位置信息更加稳定和可靠.基于此,提出一种基于移动方向的路由算法MDCE,同时借助有效的缓存管理进一步提高了路由性能.大量仿真实验表明在基于Random Waypoint节点移动模型的网络环境中,与Epidemic和Prophet相比,MDCE在消息投递率、网络负载率、平均跳数、丢包数上均取得了一定优势,MDCE平均跳数和丢包数更少,负载率不及Epidemic的40%,不及Prophet的75%. Delay Tolerant Networks ( DTNs ) feature frequent network topology partition, sparse node density and node mobility etc, which determines that it is difficult to capture the global network topology, and consequently it is a great challenge in designing a rou- ting protocol for DTNs. When selecting the next-hop relay nodes, most routing algorithms based on nodes' local information are de- pendent on the nodes' geographical information. However, since the position for each node in DTN changes at every moment, it will impair the accuracy of routing selection to some extent. From another perspective, nodes generally move some distance along a direc- tion before changing another direction in most current DTNs environment, which implies the direction information is more stable and reliable than the position information. Based on this observation, this paper proposes a Moving Direction based Controlled Epidemic routing algorithm, MDCE, and resorts to an efficient buffer management policy to further enhance the routing performance. Extensive simulations have been conducted and the results demonstrate that MDCE outperforms Epidemic and Prophet in terms of message deliv- ery ratio, network overhead ratio, average hop count and dropped message number in a Random Waypoint mobility model based DTN environment. Specifically, MDCE has less average hop count and dropped message count than Epidemic and Prophet and the over- head ratio of MDCE is less than 40% and 75% of Epidemic and Prophet respectively.
出处 《小型微型计算机系统》 CSCD 北大核心 2015年第1期60-66,共7页 Journal of Chinese Computer Systems
基金 青岛市应用基础研究项目(12-1-4-2-(14)-jch)资助 山东省自然科学基金项目(ZR2013FQ022)资助
关键词 容延网络 路由算法 局部信息 移动方向 缓存管理 delay tolerant networks routing algorithm local information moving direction buffer management
  • 相关文献

参考文献1

二级参考文献14

  • 1Fall K. A delay-tolerant network architecture for challenged internets[A].Germany:ACM,2003.27-34.
  • 2Mike P Wittie,Khaled A Harras,Kevin C Almeroth. On the implications of routing metric staleness in delay tolerant networks[J].Computer Communications,2009,(16):1699-1709.doi:10.1016/j.comcom.2009.02.014.
  • 3Spyropoulos T,Psounis K,Raghavendra C S. Spray and wait:an efficient routing scheme for intermittently connected mobile networks[A].Philadelphia,Pennsylvania.USA:ACM,2005.252-259.
  • 4Burgess J,Gallagher B,Jensen D. MaxProp:routing for vehicle-based disruption-tolerant networks[A].Spain:IEEE,2006.1-11.
  • 5Lindgren A,Doria A,Schelen O. Probabilistic routing in intermittently connected networks[J].ACM SIGMOBILE Mobile Computing and Communications Review,2003,(03):19-20.
  • 6Wang Y,Jain S,Martonosi M. Erasure coding based routing for opportunistic networks[A].USA:ACM,2005.229-236.
  • 7Sushant Jain,Michael Demmer,Rabin Patra. Using redundancy to cope with failures in a delay tolerant network[A].USA:ACM,2005.109-120.
  • 8PJorg Widmer,Jean-Yves Le Boudec. Network coding for efficient communication in extreme networks[A].USA:ACM,2005.284-291.
  • 9Lin Yun-feng,Li Bao-chun,Liang Ben. Efficient network coded data transmissions in disruption tolerant networks[A].USA,IEEE Press,2008.2180-2188.
  • 10Thrasyvoulos Spyropoulos,Konstantinos Psounis,Cauligi S. Efficient routing in intermittently connected mobile networks:the multiple-copy case[J].IEEE Transactions on Networking,2008,(01):77-90.

共引文献5

同被引文献33

引证文献6

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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