Improving routing protocol performance in delay tolerant networks using extended information

Delay tolerant networks (DTNs) are wireless mobile networks that do not guarantee the existence of a path between a source and a destination at any time. When two nodes move within each other's transmission range during a period of time, they can contact each other. The contact of nodes can be periodical, predictable and nonpredictable. In this paper, we assume the contact of nodes is nonpredictable so that it can reflect the most flexible way of nodes movement. Due to the uncertainty and time-varying nature of DTNs, routing poses special challenges. Some existing schemes use utility functions to steer the routing in the right direction. We find that these schemes do not capture enough information of the network. Thus, we develop an extended information model that can capture more mobility information and use regression functions for data processing. Experimental results from both our own simulator and real wireless trace data show that our routing algorithms based on the extended information model can increase the delivery ratio and reduce the delivery latency of routing compared with existing ones.

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

[2]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[3]  Jie Wu,et al.  A novel information model for efficient routing protocols in delay tolerant networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

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

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

[6]  Jie Wu,et al.  Scalable routing in delay tolerant networks , 2007, MobiHoc '07.

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

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

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

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

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

[12]  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..

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

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

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

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

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

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

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