Distributed estimation of the maximum value over a Wireless Sensor Network

This paper focuses on estimating the maximum of the initial measures in a Wireless Sensor Network. Two different algorithms are studied: the RANDOM GOSSIP, relying on pairwise exchanges between the nodes, and the BROADCAST in which each sensor sends its value to all its neighbors; both are asynchronous and distributed. We prove the convergence of these algorithms and provide tight bounds for their convergence speed.

[1]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[2]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[3]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

[4]  Jeff Cheeger,et al.  Spectral geometry of singular Riemannian spaces , 1983 .

[5]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[6]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[7]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[8]  Alexandros G. Dimakis,et al.  Order-Optimal Consensus Through Randomized Path Averaging , 2010, IEEE Transactions on Information Theory.

[9]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[10]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[11]  Konstantinos Panagiotou,et al.  Reliable Broadcasting in Random Networks and the Effect of Density , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Alexandros G. Dimakis,et al.  Geographic Gossip: Efficient Averaging for Sensor Networks , 2007, IEEE Transactions on Signal Processing.

[13]  Stephen P. Boyd,et al.  Analysis and optimization of randomized gossip algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).