Research Article
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
@INPROCEEDINGS{10.1007/978-3-642-17994-5_7, author={Bastian Blywis and Mesut G\'{y}neş and Sebastian Hofmann and Felix Juraschek}, title={A Study of Adaptive Gossip Routing in Wireless Mesh Networks}, proceedings={Ad Hoc Networks. Second International Conference, ADHOCNETS 2010, Victoria, BC, Canada, August 18-20, 2010, Revised Selected Papers}, proceedings_a={ADHOCNETS}, year={2012}, month={5}, keywords={Wireless Mesh Network (WMN) Gossip Routing Probabilistic Flooding Testbed}, doi={10.1007/978-3-642-17994-5_7} }- Bastian Blywis
Mesut Güneş
Sebastian Hofmann
Felix Juraschek
Year: 2012
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
ADHOCNETS
Springer
DOI: 10.1007/978-3-642-17994-5_7
Abstract
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 or dropped with 1 − . 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 . 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.
