HESnW: History Encounters-Based Spray-and-Wait Routing Protocol for Delay Tolerant Networks
0
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (21)
- T. Spyropoulos, "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)
- C. E. Perkins, "Ad-hoc on-demand distance vector routing", Proceedings of 2nd Mobile Computing Systems and Applications, pp.90~100 (1999)
- D. B. Johnson, "Mobile Computing", pp.153~181 (1996), Springer
- S. Burleigh, "Delay-tolerant networking : an approach to interplanetary internet", IEEE Communications Magazine, 41(6), pp.128~136 (2003)
- K. Fall, "A delay-tolerant network architecture for challenged internets", Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications, pp.27~34 (2003)
- J. Cao, "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)
- D. J. Watts, "Collective dynamics of ‘small-world’ networks", Nature, 393(6684), pp.440~442 (1998)
- Epidemic routing for partially-connected ad hoc networks, "A. Vahdat", Department of Computer Science, Duke University, ~ (2000)
- T. Spyropoulos, "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)
- A. Lindgren, "Probabilistic routing in intermittently connected networks", ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), pp.19~20 (2003)
- S. Milgram, "The small world problem", Psychology Today, 2, pp.61~67 (1967)
- A. S. Cacciapuoti, "Human-mobility enabled networks in urban environments : is there any(mobile wireless)small world out there?", Ad Hoc Networks, 10(8), pp.1520~1531 (2012)
- A. Banerjee, "A self-organization framework for wireless ad hoc networks as small worlds", IEEE Transactions on Vehicular Technology, 61(6), pp.2659~2673 (2012)
- A. Helmy, "Small worlds in wireless networks", IEEE Communications Letters, 7(10), pp.490~492 (2003)
- A. Chaintreau, "Impact of human mobility on opportunistic forwarding algorithms", IEEE Transactions on Mobile Computing, 6(6), pp.606~620 (2007)
- T. Karagiannis, "Power law and exponential decay of intercontact times between mobile devices", IEEE Transactions on Mobile Computing, 9(10), pp.1377~1390 (2007)
- Kaimin Wei, "Distribution of Inter-Contact Time: An Analysis-Based on Social Relationships", Journal of Communications and Networks, 15(5), pp.504~513 (2013), 한국통신학회
- A. D. Nguyen, "Understanding and modeling the small-world phenomenon in dynamic networks", Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, pp.377~384 (2012)
- K. Wei, "Social-aware relay node selection in delay tolerant networks", Proceedings of 22nd International Conference on Computer Communications and Networks, pp.1~7 (2013)
- K. Wei, "Exploiting small world properties for message forwarding in delay tolerant networks", IEEE Transactions on Computers, 64(10), pp.2809~2818 (2015)
- A. Keranen, "The ONE simulator for DTN protocol evaluation", Proceedings of 2nd International Conference on Simulation Tools and Techniques (2009)