Lightweight neighborhood cardinality estimation in dynamic wireless networks

Standard

We address the problem of estimating the neighborhood cardinality of nodes in dynamic wireless networks. Different from previous studies, we consider networks with high densities (a hundred neighbors per node) and where all nodes estimate cardinality concurrently. Performing concurrent estimations on dense mobile networks is hard; we need estimators that are not only accurate, but also fast, asynchronous (due to mobility) and lightweight (due to concurrency and high density). To cope with these requirements, we propose Estreme, a neighborhood cardinality estimator with extremely low overhead that leverages the rendezvous time of low- power medium access control (MAC) protocols. We implemented Estreme on the Contiki OS and show a significant improvement over the state-of-the-art. With Estreme, 100 nodes can concurrently estimate their neighborhood cardinality with an error of ≈10%. State-of- the-art solutions provide a similar accuracy, but on net- works consisting of a few tens of nodes and where only a fraction of nodes estimate the cardinality concurrently.

ACM Digital LibraryPaper | Presentation | Video

AuthorsMarco Cattani and Marco A. Zuniga and Andreas Loukas and Koen G. Langendoen
Research group: Embedded Software group, Delft University of Technology, Delft, Netherlands
Conference13th Int. Conf. on Information Processing in Sensor Networks (IPSN)
Year: 2014