FarachColton, Martin and Fernández Anta, Antonio and Mosteiro, Miguel A. (2013) Optimal Memoryaware Sensor Network Gossiping (or How to Break the Broadcast Lower Bound). [Journal Articles]

PDF (Optimal Memoryaware Sensor Network Gossiping (or How to Break the Broadcast Lower Bound) )
 Accepted Version
Download (569Kb)  Preview 
Abstract
Gossiping is a wellstudied 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 startup. 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.
Item Type:  Journal Articles 

Subjects:  Q Science > Q Science (General) Q Science > QA Mathematics > QA75 Electronic computers. Computer science T Technology > T Technology (General) 
Divisions:  Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science Faculty of Engineering, Science and Mathematics > School of Engineering Sciences 
Depositing User:  Antonio Fernandez 
Date Deposited:  03 Dec 2012 11:19 
Last Modified:  16 Aug 2013 09:27 
URI:  http://eprints.networks.imdea.org/id/eprint/364 
Actions (login required)
View Item 