An Empirical Study of Flooding in Mesh Networks Thomas Zahn, Greg OâShea and Antony Rowstron Microsoft Research, Cambridge, UK 1. INTRODUCTION Flooding in wireless mesh networks is a fundamental operation to many routing (e.g. AODV, OLSR), networklevel (e.g. server-less DNS) and application-level (e.g. WSDiscovery) protocols. Thus, e cient ooding is important. It has been shown that naive ooding can generate broadcast storms [2]. This has inspired much research on optimized ooding, most of which has been based on analysis and simulation. However, it has been shown that broadcasts can behave very di erently in real-world wireless networks [1]. The goal of this paper is to quantitatively evaluate the performance of ooding protocols on a large-scale o ce 802. 11a mesh network of 110 nodes distributed across four oors. We compare three protocols: naive ooding and two optimized ooding protocols. The two optimized protocols are inspired by the multi-point relay algorithm [3], which selects subsets of the nodes to rebroadcast. We have found that there is a clear trade-o for ood-based protocols between e ciency and reliability. This implies that such protocols need to explicitly manage this trade-o . A full version of this paper is available as
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/an-empirical-study-of-flooding-in-mesh-networks-yrV008GOE8
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
An empirical study of flooding in mesh networks
Zahn, Thomas; O'Shea, Greg; Rowstron, Antony
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 37 (2)
Association for Computing Machinery – Oct 16, 2009
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
