HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks


Shunyi Gan, Jipeng Zhou, Kaimin Wei, Journal of Information Processing Systems Vol. 13, No. 3, pp. 618-629, Jun. 2017  

10.3745/JIPS.03.0075
Keywords: Delivery Cost, DTNs, History Node, Multiple Probability, Spray-and-Wait
Fulltext:

Abstract

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Gan, S., Zhou, J., & Wei, K. (2017). HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks. Journal of Information Processing Systems, 13(3), 618-629. DOI: 10.3745/JIPS.03.0075.

[IEEE Style]
S. Gan, J. Zhou, K. Wei, "HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks," Journal of Information Processing Systems, vol. 13, no. 3, pp. 618-629, 2017. DOI: 10.3745/JIPS.03.0075.

[ACM Style]
Shunyi Gan, Jipeng Zhou, and Kaimin Wei. 2017. HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks. Journal of Information Processing Systems, 13, 3, (2017), 618-629. DOI: 10.3745/JIPS.03.0075.