Spray and wait: an efficient routing scheme for intermittently connected mobile networks

Intermittently connected mobile networks are sparse wireless networks where most of the time there does not exist a complete path from the source to the destination. These networks fall into the general category of Delay Tolerant Networks. There are many real networks that follow this paradigm, for example, wildlife tracking sensor networks, military networks, inter-planetary networks, etc. In this context, conventional routing schemes would fail.To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention, which can significantly degrade their performance. Furthermore, proposed efforts to significantly reduce the overhead of flooding-based schemes have often be plagued by large delays. With this in mind, we introduce a new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination.Using theory and simulations we show that Spray and Wait outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered; its overall performance is close to the optimal scheme. Furthermore, it is highly scalable retaining good performance under a large range of scenarios, unlike other schemes. Finally, it is simple to implement and to optimize in order to achieve given performance goals in practice.

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

[2]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[5]  Qun Li,et al.  Communication in disconnected ad hoc networks using message relay , 2003, J. Parallel Distributed Comput..

[6]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[7]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[8]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

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

[10]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[11]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[12]  T. Spyropoulos,et al.  Multiple-copy Routing in Intermittently Connected Mobile Networks , 2004 .

[13]  Ahmed Helmy,et al.  PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols , 2003, MobiHoc '03.

[14]  Philippe Bonnet,et al.  Smart-tag based data dissemination , 2002, WSNA '02.

[15]  R. Durrett Probability: Theory and Examples , 1993 .

[16]  Vinny Cahill,et al.  Sensor Network with Delay Tolerance (SeNDT) , 2007, 2007 16th International Conference on Computer Communications and Networks.

[17]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[18]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

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

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

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

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

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

[24]  Jean-Luc Meunier,et al.  Pollen: using people as a communication medium , 2001, Comput. Networks.