@inproceedings{blywis+:2010b,
  title = {{A Study of Adaptive Gossip Routing in Wireless Mesh Networks}},
  author = {Bastian Blywis and Mesut G\"unes and Sebastian Hofmann and Felix Juraschek},
  booktitle = {Ad Hoc Networks},
  year = {2010},
  editor = {Akan, Ozgur and Bellavista, Paolo and Cao, Jiannong and Dressler, Falko and Ferrari, Domenico and Gerla, Mario and Kobayashi, Hisashi and Palazzo, Sergio and Sahni, Sartaj and Shen, Xuemin (Sherman) and Stan, Mircea and Xiaohua, Jia and Zomaya, Albert and Coulson, Geoffrey and Zheng, Jun and Simplot-Ryl, David and Leung, Victor C. M.},
  pages = {98-113},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering},
  volume = {49},
  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 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.},
  affiliation = {Institute of Computer Science - Distributed Embedded Systems, Freie Universität Berlin, Germany},
  isbn = {978-3-642-17994-5},
  keyword = {Computer Science},
  owner = {blywis},
  timestamp = {2010.06.04},
  url = {http://dx.doi.org/10.1007/978-3-642-17994-5_7},
}