Detection in Dense Wireless Sensor Networks

We study decentralized detection in tree networks with bounded height, and in which there are either sensor failures or unreliable communications between sensors. We characterize the asymptotically optimal performance of such tree networks, when certain parameters are allowed to become large, to model the case of dense sensor networks. We also develop simple strategies that nearly achieve the optimal performance.

[1]  Lang Tong,et al.  A Large Deviation Analysis of Detection Over Multi-Access Channels with Random Number of Sensors , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[2]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[3]  W. W. Irving,et al.  Some properties of optimal thresholds in decentralized detection , 1994, IEEE Trans. Autom. Control..

[4]  P.K. Varshney,et al.  Optimal Data Fusion in Multiple Sensor Detection Systems , 1986, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Pramod K. Varshney,et al.  Distributed Detection and Fusion in a Large Wireless Sensor Network of Random Size , 2005, EURASIP J. Wirel. Commun. Netw..

[6]  Robert R. Tenney,et al.  Detection with distributed sensors , 1980 .

[7]  Moe Z. Win,et al.  Data Fusion Trees for Detection: Does Architecture Matter? , 2008, IEEE Transactions on Information Theory.

[8]  John N. Tsitsiklis,et al.  Decentralized detection by a large number of sensors , 1988, Math. Control. Signals Syst..

[9]  Pramod K. Varshney,et al.  Distributed detection with multiple sensors I. Fundamentals , 1997, Proc. IEEE.