Distributed estimation of the maximum value over a wireless sensor network
Résumé
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.