Probability Delegation Forwarding in Delay Tolerant Networks

Delay tolerant networks are a type of wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time. In such a network, one of the critical issues is to reliably deliver data with a low latency. Naive forwarding approaches, such as flooding and its derivatives, make the routing cost (here defined as the number of copies duplicated for a message) very high. Many efforts have been made to reduce the cost while maintaining performance. Recently, an approach called delegation forwarding (DF) caught significant attention in the research community because of its simplicity and good performance. In a network with N nodes, it reduces the cost to O( √ N) which is better than O(N) in other methods. In this paper, we extend the DF algorithm by putting forward a new scheme called probability delegation forwarding (PDF) that can further reduce the cost to O(N 2+2p), p ∈ (0, 1). Simulation results show that PDF can achieve similar delivery ratio, which is the most important metric in DTNs, as the DF scheme at a lower cost if p is not too small. In addition, we propose the threshold probability delegation forwarding (TPDF) scheme to close the latency gap between the DF and PDF schemes.

[1]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[2]  Matthias Grossglauser,et al.  Age matters: efficient route discovery in mobile ad hoc networks using encounter ages , 2003, MobiHoc '03.

[3]  Sergei Vassilvitskii,et al.  The hiring problem and Lake Wobegon strategies , 2008, SODA '08.

[4]  Jie Wu,et al.  An optimal probabilistic forwarding protocolin delay tolerant networks , 2009, MobiHoc '09.

[5]  Xiangchuan Chen,et al.  Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks , 2001 .

[6]  Paul A. S. Ward,et al.  Practical Routing in Delay-Tolerant Networks , 2005, IEEE Transactions on Mobile Computing.

[7]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[8]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[9]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[10]  Chunming Qiao,et al.  Sociological orbit aware location approximation and routing (SOLAR) in MANET , 2007, Ad Hoc Networks.

[11]  Jie Wu,et al.  Routing in a cyclic mobispace , 2008, MobiHoc '08.

[12]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[13]  E. Jones Routing Strategies for Delay-Tolerant Networks , 2006 .

[14]  Vijay Erramilli,et al.  Diversity of forwarding paths in pocket switched networks , 2007, IMC '07.

[15]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[16]  Timur Friedman,et al.  DTN routing in a mobility pattern space , 2005, WDTN '05.

[17]  Christophe Diot,et al.  Impact of Human Mobility on Opportunistic Forwarding Algorithms , 2007, IEEE Transactions on Mobile Computing.

[18]  Jie Wu,et al.  Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[19]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[20]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[21]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[22]  Tristan Henderson,et al.  CRAWDAD: a community resource for archiving wireless data at Dartmouth , 2005, CCRV.