Efficient Packet Routing in Highly Mobile Wireless Networks

Traditional mobile ad-hoc network (MANET) and delay tolerant network (DTN) routing schemes work properly only under the limited assumptions. MANET routing schemes are designed for densely populated networks while DTN routing schemes were developed for dealing with intermittently connected topologies. However, in a real environment, the assumption cannot be hold: the density of nodes constantly changes and a network can be separated due to node mobility even when it is composed of large number of nodes. We propose a routing scheme for maximizing the delivery rate in a network with varying density. In the proposed scheme, data packets are used to search an available path while they are delivered by DTN-based routing. If a path exists, subsequent packets are relayed along the path. Otherwise, packets are delivered continuously using DTN-based routing. Using simulation we show that the proposed scheme achieves high throughput and a low overhead in a dense part of the network, while it outperforms existing DTN routing schemes in an intermittently connected situation.

[1]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Baochun Li,et al.  CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding , 2008, 2008 IEEE International Conference on Network Protocols.

[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]  Christian Bettstetter,et al.  On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[5]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[6]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM 2007.

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Hui Li,et al.  Path availability in ad hoc network , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[9]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[10]  Vania Conan,et al.  HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks , 2009, WOWMOM.

[11]  Bernie Mulgrew,et al.  Proceedings IEEE International Conference on Communications , 1989 .

[12]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

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

[14]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

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

[16]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[17]  Sachin Katti,et al.  Trading structure for randomness in wireless opportunistic routing , 2007, SIGCOMM 2007.

[18]  Satish K. Tripathi,et al.  A framework for reliable routing in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

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

[21]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[22]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

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

[25]  Injong Rhee,et al.  Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

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

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

[29]  Christian Schindelhauer,et al.  DT-DYMO: Delay-Tolerant Dynamic MANET On-demand Routing , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems Workshops.

[30]  Taesoo Jun,et al.  Expressive Analytical Model for Routing Protocols in Mobile Ad Hoc Networks , 2008, 2008 IEEE International Conference on Communications.