TY - JOUR

T1 - How dense should a sensor network be for detection with correlated observations?

AU - Chamberland, Jean François

AU - Veeravalli, Venugopal V.

N1 - Funding Information:
Manuscript received March 26, 2005; revised January 12, 2006. This work was supported by the National Science Foundation (NSF) under the CAREER/ PECASE Award CCR-0049089. The material in this correspondence was presented in part at the IEEE Information Theory Workshop, San Antonio, TX, October 2004.

PY - 2006/11

Y1 - 2006/11

N2 - A detection problem in sensor networks is considered, where the sensor nodes are placed on a line and receive partial information about their environment. The nodes transmit a summary of their observations over a noisy communication channel to a fusion center for the purpose of detection. The observations at the sensors are samples of a spatial stochastic process, which is one of two possible signals corrupted by Gaussian noise. Two cases are considered: one where the signal is deterministic under each hypothesis, and the other where the signal is a correlated Gaussian process under each hypothesis. The nodes are assumed to be subject to a power density constraint, i.e., the power per unit distance is fixed, so that the power per node decreases linearly with the node density. Under these constraints, the central question that is addressed is: how dense should the sensor array be, i.e., is it better to use a few high-cost, high-power nodes or to have many low-cost, low-power nodes? An answer to this question is obtained by resorting to an asymptotic analysis where the number of nodes is large. In this asymptotic regime, the Gärtner-Ellis theorem and similar large-deviation theory results are used to study the impact of node density on system performance. For the deterministic signal case, it is shown that performance improves monotonically with sensor density. For the stochastic signal case, a finite sensor density is shown to be optimal.

AB - A detection problem in sensor networks is considered, where the sensor nodes are placed on a line and receive partial information about their environment. The nodes transmit a summary of their observations over a noisy communication channel to a fusion center for the purpose of detection. The observations at the sensors are samples of a spatial stochastic process, which is one of two possible signals corrupted by Gaussian noise. Two cases are considered: one where the signal is deterministic under each hypothesis, and the other where the signal is a correlated Gaussian process under each hypothesis. The nodes are assumed to be subject to a power density constraint, i.e., the power per unit distance is fixed, so that the power per node decreases linearly with the node density. Under these constraints, the central question that is addressed is: how dense should the sensor array be, i.e., is it better to use a few high-cost, high-power nodes or to have many low-cost, low-power nodes? An answer to this question is obtained by resorting to an asymptotic analysis where the number of nodes is large. In this asymptotic regime, the Gärtner-Ellis theorem and similar large-deviation theory results are used to study the impact of node density on system performance. For the deterministic signal case, it is shown that performance improves monotonically with sensor density. For the stochastic signal case, a finite sensor density is shown to be optimal.

KW - Decentralized detection

KW - Decision-making

KW - Distributed detection

KW - Multisensor systems

KW - Sensor network

KW - Wireless sensors

UR - http://www.scopus.com/inward/record.url?scp=33750590109&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750590109&partnerID=8YFLogxK

U2 - 10.1109/TIT.2006.883551

DO - 10.1109/TIT.2006.883551

M3 - Article

AN - SCOPUS:33750590109

SN - 0018-9448

VL - 52

SP - 5099

EP - 5106

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 11

ER -