Analyzing the techniques that improve fault tolerance of aggregation trees in sensor networks
Sensor networks are finding significant applications in large scale distributed systems. One of the basic operations in sensor networks is in-network aggregation. Among the various approaches to in-network aggregation, such as gossip and tree, including the hash-based techniques, the tree-based approaches have better performance and energy-saving characteristics. However, sensor networks are highly prone to failures. Numerous techniques suggested in the literature to counteract the effect Of failures have not been carefully analyzed. In this paper, we focus on the performance of these tree-based aggregation techniques in the presence of failures. First, we identify a fault model that Captures the important failure traits of the system. Then, we analyze the correctness of simple tree aggregation with Our fault model. We then use the same fault model to analyze the techniques that utilize redundant trees to improve the variance. The impact of techniques for maintaining the correctness under faults, Such as rebuilding or locally fixing the tree, is then studied under the same fault model. We also do the cost-benefit analysis Of using the hash-based schemes which are based on FM sketches, We conclude that these fault tolerance techniques for tree aggregation do not necessarily result in substantial improvement in fault tolerance. (C) 2009 Published by Elsevier Inc.
fault tolerance aggregation sensor network reliability modeling faults