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.
KeywordsWireless Mesh Network (WMN) Gossip Routing Probabilistic Flooding Testbed
Unable to display preview. Download preview PDF.
- 1.Moy, J.: OSPF Version 2, RFC 2328 (Standard) (April 1998), http://www.ietf.org/rfc/rfc2328.txt
- 2.IEEE Std 802.11-2007. IEEE standard for information technology – Telecommunications and information exchange between systems – Local and metropolitan area networks-specific requirements – Part 11: Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, LAN/MAN Standards Committee, New York, NY, USA, pp. C1-1184 (June 2007), http://dx.doi.org/10.1109/IEEESTD.2007.373646
- 4.Vahdat, A., Becker, D.: Epidemic routing for partially-connected ad hoc networks, Duke University, Tech. Rep. CS-2000-06 (July 2000)Google Scholar
- 5.Blywis, B., Günes, M., Juraschek, F., Hofmann, S.: Gossip routing in wireless mesh networks. In: International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2010 (2010)Google Scholar
- 8.Blywis, B., Günes, M., Juraschek, F., Schiller, J.: Trends, advances, and challenges in testbed-based wireless mesh network research. In: ACM/Springer Mobile Networks and Applications (MONET), special issue on Advances in Wireless Testbeds and Research Infrastructures (February 2010) http://www.springerlink.com/content/hk25051135m36571/
- 9.Shi, Z., Shen, H.: Adaptive gossip-based routing algorithm. In: Proceedings, 23rd IEEE International Performance, Computing, and Communications Conference IPCCC (2004)Google Scholar
- 10.Mohammed, A., Ould-Khaoua, M., Mackenzie, L.M., Perkins, C., Abdulai, J.-D.: Probabilistic counter-based route discovery for mobile ad hoc networks. In: IWCMC 2009: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing, pp. 1335–1339. ACM, New York (2009)Google Scholar
- 12.Abdulai, J.: Probabilistic Route Discovery for Wireless Mobile Ad Hoc Networks (MANETs) (2009)Google Scholar
- 13.Philipp, M.: A framework for distributed channel assignment in wireless mesh networks. Master Thesis, Freie Universität Berlin (March 2010)Google Scholar
- 14.De Couto, D.S.J., Aguayo, D., Bicket, J., Morris, R.: A high-throughput path metric for multi-hop wireless routing. In: MobiCom 2003: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp. 134–146. ACM, New York (2003)Google Scholar
- 15.Blywis, B., Günes, M., Juraschek, F., Schmidt, P., Kumar, P.: Des-sert: A framework for structured routing protocol implementation. In: IFIP Wireless Days 2009 (2009)Google Scholar
- 16.Rosen, E., Rekhter, Y.: BGP/MPLS IP Virtual Private Networks (VPNs), RFC 4364 (Proposed Standard) (February 2006), updated by RFCs 4577, 4684, http://www.ietf.org/rfc/rfc4364.txt