Discrete stochastic approximation algorithms for design of optimal sensor fusion rules
International Journal of Sensor Networks
Distributed Activity Recognition with Fuzzy-Enabled Wireless Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
A survey on wireless sensor networks deployment
WSEAS TRANSACTIONS on COMMUNICATIONS
Challenges for wireless sensor networks deployment
DIWEB'08 Proceedings of the 8th WSEAS international conference on Distance learning and web engineering
Equal-Gain Combination for adaptive distributed classification in Wireless Sensor Networks
International Journal of Ad Hoc and Ubiquitous Computing
Recognition of user activity sequences using distributed event detection
EuroSSC'07 Proceedings of the 2nd European conference on Smart sensing and context
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
On the design of soft-decision fusion rule for coding approach in wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Self-Adapting Event Configuration in Ubiquitous Wireless Sensor Networks
International Journal of Adaptive, Resilient and Autonomic Systems
On-line anomaly detection and resilience in classifier ensembles
Pattern Recognition Letters
| Hi-index | 0.07 |
Fault-tolerance and data fusion have been considered as two fundamental functions in wireless sensor networks. In this paper, we propose a novel approach for distributed multiclass classification using a fault-tolerant fusion rule for wireless sensor networks. Binary decisions from local sensors, possibly in the presence of faults, are forwarded to the fusion center that determines the final classification result. Classification fusion in our approach is implemented via error correcting codes to incorporate fault-tolerance capability. This new approach not only provides an improved fault-tolerance capability but also reduces computation time and memory requirements at the fusion center. Code matrix design is essential for the design of such systems. Two efficient code matrix design algorithms are proposed in this paper. The relative merits of both algorithms are also studied. We also develop sufficient conditions for asymptotic detection of the correct hypothesis by the proposed approach. Performance evaluation of the proposed approach in the presence of faults is provided. These results show significant improvement in fault-tolerance capability as compared with conventional parallel fusion networks.