Gossiping is an important problem in Radio Networks that has been well studied, leading to many important results. Due to strong resouce limitations of sensor nodes, previous solutions are frequently not feasible in Sensor Networks. In this paper, we study the gossiping problem in the restrictive context of Sensor Networks. By exploiting the geometry of sensor node distributions, we present reduced, optimal running time of O(D + Δ) for an algorithm that completes gossiping with high probability in a Sensor Network of unknown topology and adversarial wake-up, where D is the diameter and Δ the maximum degree of the network. Given that an algorithm for gossiping also solves the broadcast problem, our result proves that the classic lower bound of [16] can be broken if nodes are allowed to do preprocessing. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Farach-Colton, M., & Mosteiro, M. A. (2007). Sensor network gossiping or how to break the broadcast lower bound. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4835 LNCS, pp. 232–243). Springer Verlag. https://doi.org/10.1007/978-3-540-77120-3_22
Mendeley helps you to discover research relevant for your work.