HESnW: History encounters-based spray-and-wait routing protocol for delay tolerant networks

被引：3
作者：
Gan S. [1 ]
Zhou J. [1 ]
Wei K. [1 ]
机构：
[1] School of Information Technology, Jinan University, Guangdong
来源：
Journal of Information Processing Systems | 2017年 / 13卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Delivery cost; DTNs; History node; Multiple probability; Spray-and-wait;
D O I：
10.3745/JIPS.03.0075
中图分类号：
学科分类号：
摘要：
Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio. © 2017 KIPS.
引用
收藏
页码：618 / 629
页数：11
相关论文
共 21 条
  • [1] Spyropoulos T., Psounis K., Raghavendra C.S., Spray and wait: an efficient routing scheme for intermittently connected mobile networks,, Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networking, pp. 252-259, (2005)
  • [2] Perkins C.E., Royer E.M., Ad-hoc on-demand distance vector routing,, Proceedings of 2nd Mobile Computing Systems and Applications, pp. 90-100, (1999)
  • [3] Johnson D.B., Maltz D.A., Dynamic source routing in ad hoc wireless networks,, Mobile Computing, pp. 153-181, (1996)
  • [4] Burleigh S., Hooke A., Torgerson L., Fall K., Cerf V., Durst B., Scott K., Weiss H., Delay-tolerant networking: an approach to interplanetary internet,, IEEE Communications Magazine, 41, 6, pp. 128-136, (2003)
  • [5] Fall K., A delay-tolerant network architecture for challenged internets,, Proceedings of the 2003 Conference on Applications, pp. 27-34, (2003)
  • [6] Cao J., Zhang Y., Xie L., Cao G., Consistency of cooperative caching in mobile peer-to-peer systems over MANET,, International Journal of Parallel Emergent and Distributed Systems, 21, 3, pp. 573-579, (2006)
  • [7] Watts D.J., Strogatz S.H., Collective dynamics of 'small-world' networks,, Nature, 393, 6684, pp. 440-442, (1998)
  • [8] Vahdat A., Becker D., "Epidemic routing for partially-connected ad hoc networks,", (2000)
  • [9] Spyropoulos T., Psounis K., Raghavendra C.S., Single-copy routing in intermittently connected mobile networks,, Proceedings of 1st Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp. 235-244, (2004)
  • [10] Lindgren A., Doria A., Schelen O., Probabilistic routing in intermittently connected networks,, ACM SIGMOBILE Mobile Computing and Communications Review, 7, 3, pp. 19-20, (2003)
123