Efficient Adaptive Routing in Delay Tolerant Networks

Conventional routing algorithms in mobile ad hoc networks (MANETs), i.e., multi-hop forwarding, assume the existence of contemporaneous source-destination paths and are not scalable to large networks. On the other hand, in delay tolerant networks (DTNs), routing protocols use the mobility-assisted, store-carry-forward paradigm which allows delivery among disconnected network components. Adaptive routing, which combines multi-hop and mobility-assisted routing protocols, is of practical value: it allows efficient multi-hop forwarding while providing the flexibility to deliver messages among disconnected network components. However, existing adaptive routing protocols use mobility-assisted routing protocols as an alternative only when the former fails. In this paper, we propose to improve the performance of adaptive routing from a resource allocation point of view, in situations where bandwidth is a critical and limited resource affecting routing performance. We propose an adaptive routing protocol, named efficient adaptive routing (EAR), which allocates bandwidth (or forwarding opportunities) between its multi-hop forwarding component and its mobility-assisted routing component dynamically to improve bandwidth utility. Simulations are conducted to evaluate the routing performance of EAR under different network parameters.

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

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

[3]  Cecilia Mascolo,et al.  Adaptive routing for intermittently connected mobile ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[4]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

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

[6]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

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

[8]  Jörg Ott,et al.  Integrating DTN and MANET routing , 2006, CHANTS '06.

[9]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

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

[11]  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).

[12]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2006, IEEE/ACM Trans. Netw..

[13]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[14]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.