Broadcast gossip based distributed hypothesis testing in wireless sensor networks

We consider the scenario that N sensors collaborate to observe a single event. The sensors are distributed and can only exchange messages through a network to reach a consensus about the observed event. In this paper, we propose a very robust and simple method using broadcast gossip algorithm to solve the distributed hypothesis testing problem. The simulation result shows that our method has good performance and is very energy efficient comparing to existing methods.

[1]  Stephen P. Boyd,et al.  Distributed Average Consensus with Time-Varying Metropolis Weights ? , 2006 .

[2]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[3]  M. Alanyali,et al.  Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links , 2006, IEEE Transactions on Signal Processing.

[4]  J. Shamma,et al.  Belief consensus and distributed hypothesis testing in sensor networks , 2006 .

[5]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[6]  S. Venkatesh,et al.  Distributed Bayesian hypothesis testing in sensor networks , 2004, Proceedings of the 2004 American Control Conference.

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

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

[9]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[10]  Anand D. Sarwate,et al.  Broadcast gossip algorithms: Design and analysis for consensus , 2008, 2008 47th IEEE Conference on Decision and Control.

[11]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.