Fault-Tolerant Aggregation by Flow Updating

11 years 1 months ago
Fault-Tolerant Aggregation by Flow Updating
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed applications. In the particular case of wireless sensor networks, data collection is often only practicable if aggregation is performed. Several aggregation algorithms have been proposed in the last few years, exhibiting different properties in terms of accuracy, speed and communication tradeoffs. Nonetheless, existing approaches are found lacking in terms of fault tolerance. In this paper, we introduce a novel fault-tolerant averaging based data aggregation algorithm. It tolerates substantial message loss (link failures), while competing algorithms in the same class can be affected by a single lost message. The algorithm is based on manipulating flows (in the graph theoretical sense), that are updated using idempotent messages, providing it with unique robustness capabilities. Furthermore, evaluation results ...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2009
Where DAIS
Authors Paulo Jesus, Carlos Baquero, Paulo Sérgio Almeida
Comments (0)