A Power-Saving Data Aggregation Algorithm for Byzantine Faults in Wireless Sensor Networks

Yu-Chen KUO  Ji-Wei CHEN  

IEICE TRANSACTIONS on Communications   Vol.E92-B   No.6   pp.2201-2208
Publication Date: 2009/06/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E92.B.2201
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Sensing
Byzantine faults,  data aggregation,  fault tolerance,  quorum systems,  wireless sensor networks,  

Full Text: PDF>>
Buy this Article

The wireless sensor network is a resource-constrained self-organizing system that consists of a large number of tiny sensor nodes. Due to the low-cost and low-power nature of sensor nodes, sensor nodes are failure-prone when sensing and processing data. Most presented fault-tolerant research for wireless sensor networks focused on crash faults or power faults and less on Byzantine faults. Hence, in this paper, we propose a power-saving data aggregation algorithm for Byzantine faults to provide power savings and high success rates even in the environment with high fault rates. The algorithm utilizes the concept of Byzantine masking quorum systems to mask the erroneous values and to finally determine the correct value. Our simulation results demonstrate that when the fault rate of sensor nodes is up to 50%, our algorithm still has 48% success rate to obtain the correct value. Under the same condition, other fault-tolerant algorithms are almost failed.