Optimal Memory-aware Sensor Network Gossiping ⋆

Gossiping is an important problem in Radio Networks that has been well studied, leading to many important results. 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. By exploiting the geometry of sensor node distributions, we present a reduced, optimal running time of Θ(D + ∆) for a distributed algorithm that completes gossiping with high probability in a Sensor Network of unknown topology and adversarial start-up, where D is the diameter and ∆ the maximum degree of the network. Given that an algorithm for gossiping also solves the broadcast problem, this result shows that the classic broadcast lower bound of Kushilevitz and Mansour does not hold if nodes are allowed to do preprocessing, given that the topology used in that paper is feasible for Sensor Networks. The proposed algorithm requires that a linear number of messages can be stored and transmitted in one time unit. When only a constant number of messages can be stored, an optimal distributed algorithm that solves the problem in linear time is also given. keywords: radio networks, sensor networks, gossiping, distributed algorithms, broadcast, convergecast.

[1]  Andrzej Pelc,et al.  Broadcasting in UDG radio networks with unknown topology , 2007, PODC '07.

[2]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[3]  David E. Culler,et al.  The emergence of a networking primitive in wireless sensor networks , 2008, CACM.

[4]  Andrzej Lingas,et al.  Oblivious gossiping in ad-hoc radio networks , 2001, DIALM '01.

[5]  Antonio Fernández,et al.  Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks , 2008, DISC.

[6]  Vlady Ravelomanana,et al.  Optimal Initialization and Gossiping Algorithms for Random Radio Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[7]  Wojciech Rytter,et al.  Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.

[8]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[9]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[10]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[11]  Dariusz R. Kowalski,et al.  Average-Time Complexity of Gossiping in Radio Networks , 2006, SIROCCO.

[12]  Miguel A. Mosteiro,et al.  Sensor Network Gossiping or How to Break the Broadcast Lower Bound , 2007, ISAAC.

[13]  Dariusz R. Kowalski,et al.  On selection problem in radio networks , 2005, PODC '05.

[14]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[15]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[16]  Robert E. Tarjan,et al.  An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..

[17]  Charles U. Martel,et al.  Maximum Finding on a Multiple Access Broadcast Network , 1994, Inf. Process. Lett..

[18]  Thanasis Tsantilas,et al.  Efficient optical communication in parallel computers , 1992, SPAA '92.

[19]  Ding Liu,et al.  On Randomized Broadcasting and Gossiping in Radio Networks , 2002, COCOON.

[20]  Miguel A. Mosteiro,et al.  Bootstrapping a Hop-Optimal Network in the Weak Sensor Model , 2005, ESA.

[21]  Roger Wattenhofer,et al.  Initializing newly deployed ad hoc and sensor networks , 2004, MobiCom '04.

[22]  L. Fejes.  Über einen geometrischen Satz , 1940 .

[23]  Dariusz R. Kowalski,et al.  Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks , 2005, Second Annual Conference on Wireless On-demand Network Systems and Services.

[24]  Andrzej Pelc,et al.  Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism , 2005, Theor. Comput. Sci..

[25]  Igor Potapov,et al.  Gossiping with Unit Messages in Known Radio Networks , 2002, IFIP TCS.

[26]  Wojciech Rytter,et al.  A randomized algorithm for gossiping in radio networks , 2004, Networks.

[27]  Dariusz R. Kowalski,et al.  Many-to-Many Communication in Radio Networks , 2007, Algorithmica.

[28]  Roger Wattenhofer,et al.  Maximal independent sets in radio networks , 2005, PODC '05.