Detection in decentralized sensor networks

Advances in integrated technologies are making networks of many inexpensive deployable autonomous sensors a reality. Individually, each sensor may not accomplish much, but working cooperatively they have for example the potential to monitor large areas, detect the presence or absence of targets, or track moving objects. These sensors operate under constraints imposed by scarce power and other limited resources like bandwidth or computing capacity. The paper considers detection in such a distributed sensor environment. We investigate the impact on detection performance, as measured by the probability of error, of such parameters as number of sensors, number of quantization levels at each sensor, or signal to noise ratio, under a rate constraint on the common access communications channel. We optimize the local detectors when the number of sensors is large. We show that the performance loss due to quantization decays exponentially fast as the number of bits per sensor increases and that the choice between hard versus soft local detectors depends not only on the noise distribution and the quantization rate, but also on the SNR under which the sensors operate.

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

[2]  José M. F. Moura,et al.  Fusion in sensor networks with communication constraints , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

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

[4]  Venugopal V. Veeravalli,et al.  Decentralized detection in sensor networks , 2003, IEEE Trans. Signal Process..

[5]  Pramod K. Varshney,et al.  Distributed Detection and Data Fusion , 1996 .

[6]  E. Polak Introduction to linear and nonlinear programming , 1973 .