Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Gossiping is a well-studied problem in Radio Networks. However, due to the strong resource 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. We present a distributed algorithm that completes Gossiping with high probability in a Sensor Network of unknown topology and adversarial start-up. This algorithm exploits the geometry of sensor node distributions to achieve an optimal running time of Θ(D+Δ), where D is the diameter and Δ the maximum degree of the network. Given that any algorithm for Gossiping also solves the Broadcast problem, this result shows that the classical Broadcast lower bound of Kushilevitz and Mansour does not hold if nodes are allowed to do preprocessing. The proposed algorithm requires that a linear number of messages be stored and transmitted per unit time. We also show an optimal distributed algorithm that solves the problem in linear time for the case where only a constant number of messages can be stored. © 2012 Elsevier B.V. All rights reserved.
Theoretical Computer Science
First Page Number
Last Page Number
Farach-Colton, Martín; Fernández Anta, Antonio; and Mosteiro, Miguel A., "Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)" (2013). Kean Publications. 2081.