Gossip routing, percolation, and restart in wireless multi-hop networks

Route and service discovery in wireless multi-hop networks applies flooding or gossip routing to disseminate and gather information. Since packets may get lost, retransmissions of lost packets are required. In many protocols the retransmission timeout is fixed in the protocol specification. In this paper we demonstrate that optimization of the timeout is required in order to ensure proper functioning of flooding schemes. Based on an experimental study, we apply percolation theory and derive analytical models for computing the optimal restart timeout. To the best of our knowledge, this is the first comprehensive study of gossip routing, percolation, and restart in this context.

[1]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[2]  Felix Juraschek,et al.  A testbed-based study of uni- and multi-path Dynamic Source Routing in a WMN , 2010, 2010 IFIP Wireless Days.

[3]  N. Chetty,et al.  Suppressed bond-site percolation , 2009, Comput. Phys. Commun..

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

[5]  Katinka Wolter.  Stochastic Models for Fault Tolerance - Restart, Rejuvenation and Checkpointing , 2010 .

[6]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[7]  D. Jhonson.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007 .

[8]  Felix Juraschek,et al.  Properties and topology of the DES-Testbed , 2011 .

[9]  Felix Juraschek,et al.  Challenges and limits of flooding and gossip routing based route discovery schemes , 2011, 2011 IEEE 36th Conference on Local Computer Networks.

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

[11]  T. E. Harris.  A lower bound for the critical probability in a certain percolation process , 1960, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  M. Yanuka,et al.  Bond-site percolation: empirical representation of critical probabilities , 1990 .

[13]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[14]  Geoffrey Grimmett,et al.  Percolation and disordered systems , 1997 .