A Study of Adaptive Gossip Routing in Wireless Mesh Networks

Gossip routing is an approach to limit the overhead of flooding in wireless networks. Each node, that receives a packet that would normally be flooded, applies a probabilistic approach. The packet is either forwarded with probability p or dropped with 1 − p. This paper is a follow-up to our last study that evaluated the approaches by Haas et al. in the DES-Testbed, a wireless mesh network. Four different gossip routing variants were discussed which used static parameters to determine the value p. In this study, we compare the proposals by four other entities and discuss whether they show an overall improvement regarding the two most important metrics in this domain: reachability and redundancy. We also discuss the assumptions and parameters of the simulation studies in the context of our experiments in a real world deployment.

[1]  Aminu Mohammed,et al.  Probabilistic counter-based route discovery for mobile ad hoc networks , 2009, IWCMC.

[2]  Jim S. Tiller.  Virtual Private Networks (VPNs) , 2011, Encyclopedia of Information Assurance.

[3]  Di Ma.  Secure Feedback Service in Wireless Sensor Networks , 2007, ISPEC.

[4]  Zhongmin Shi,et al.  Adaptive gossip-based routing algorithm , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[5]  Jamal-Deen Abdulai,et al.  Probabilistic route discovery for Wireless Mobile Ad Hoc Networks (MANETs) , 2009 .

[6]  Yakov Rekhter,et al.  BGP/MPLS IP Virtual Private Networks (VPNs) , 2006, RFC.

[7]  Felix Juraschek,et al.  Gossip routing in wireless mesh networks , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[8]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2005, Wirel. Networks.

[9]  Pardeep Kumar,et al.  DES-SERT: A framework for structured routing protocol implementation , 2009, 2009 2nd IFIP Wireless Days (WD).

[10]  Jochen H. Schiller,et al.  Trends, Advances, and Challenges in Testbed-based Wireless Mesh Network Research , 2010, Mob. Networks Appl..

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

[12]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[13]  Irfan-Ullah Awan,et al.  Performance evaluation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks , 2009, Simul. Model. Pract. Theory.

[14]  H M D Utidjian,et al.  The Proposed Standard , 1976 .