Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks
Authors:
- Po-Ning ChenPCPo-Ning Chen
- Tsang-Yi WangTWTsang-Yi Wang
- Yunghsiang S. HanYHYunghsiang S. Han
- Pramod K. VarshneyPVPramod K. Varshney
- 30 April 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 53 (5) , 1716-1734
Abstract
Distributed classification fusion using error-correcting codes (DCFECC) has recently been proposed for wireless sensor networks operating in a harsh environment. It has been shown to have a considerably better capability against unexpected sensor faults than the optimal likelihood fusion. In this paper, we analyze the performance of a DCFECC code with minimum Hamming distance fusion. No assumption on identical distribution for local observations, as well as common marginal distribution for the additive noises of the wireless links, is made. In addition, sensors are allowed to employ their own local classification rules. Upper bounds on the probability of error that are valid for any finite number of sensors are derived based on large deviations technique. A necessary and sufficient condition under which the minimum Hamming distance fusion error vanishes as the number of sensors tends to infinity is also established. With the necessary and sufficient condition and the upper error bounds, the relation between the fault-tolerance capability of a DCFECC code and its pair-wise Hamming distances is characterized, and can be used together with any code search criterion in finding the code with the desired fault-tolerance capability. Based on the above results, we further propose a code search criterion of much less complexity than the minimum Hamming distance fusion error criterion adopted earlier by the authors. This makes the code construction with acceptable fault-tolerance capability for a network with over a hundred of sensors practical. Simulation results show that the code determined based on the new criterion of much less complexity performs almost identically to the best code that minimizes the minimum Hamming distance fusion error. Also simulated and discussed are the performance trends of the codes searched based on the new simpler criterion with respect to the network size and the number of hypothesesKeywords
This publication has 15 references indexed in Scilit:
- Large system decentralized detection performance under communication constraintsIEEE Communications Letters, 2005
- An isotropic universal decentralized estimation scheme for a bandwidth constrained ad hoc sensor networkIEEE Journal on Selected Areas in Communications, 2005
- Distributed fault-tolerant classification in wireless sensor networksIEEE Journal on Selected Areas in Communications, 2005
- Asymptotic Results for Decentralized Detection in Power Constrained Wireless Sensor NetworksIEEE Journal on Selected Areas in Communications, 2004
- Distributed Decision Fusion With a Random-Access Channel for Sensor Network ApplicationsIEEE Transactions on Instrumentation and Measurement, 2004
- Data versus decision fusion for distributed classification in sensor networks2004
- Data versus decision fusion in wireless sensor networks2004
- Decentralized detection in sensor networksIEEE Transactions on Signal Processing, 2003
- New asymptotic results in parallel distributed detectionIEEE Transactions on Information Theory, 1993
- Decentralized detection by a large number of sensorsMathematics of Control, Signals, and Systems, 1988