Asymptotic Performance of Distributed Detection in Clustered Multi-Hop Wireless Sensor Networks

We consider a multi-hop clustered wireless sensor network in which sensor nodes use their observations of the environment to make local hard (0/1) decisions about whether an event has occurred. The local decisions are transmitted over a binary symmetric channel (BSC) to the cluster head (CH) in a multi-hop fashion. The CH fuses the local decisions it receives to produce a final hard decision about the event. We investigate the asymptotic performance of the decision error probability (DEP) at the CH for a network with a fixed number of nodes and a randomly deployed network by deriving the error exponents. We analyze the performance improvement in the DEP and the error exponents when extra rings are added to the clustered network and show the effect of increasing the dimension of the network.

[1]  K. B. Oldham,et al.  An Atlas of Functions. , 1988 .

[2]  Lang Tong,et al.  Asymptotic Detection Performance of Type-Based Multiple Access Over Multiaccess Fading Channels , 2007, IEEE Transactions on Signal Processing.

[3]  Wen J. Li,et al.  Distributed Detection in Wireless Sensor Networks Using A Multiple Access Channel , 2007, IEEE Transactions on Signal Processing.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Venugopal V. Veeravalli,et al.  Asymptotic results for decentralized detection in power constrained wireless sensor networks , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Edward J. Coyle,et al.  Minimizing communication costs in hierarchically clustered networks of wireless sensors , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..