Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed Algorithms
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Epidemic-Style Proactive Aggregation in Large Overlay Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Implementing aggregation and broadcast over Distributed Hash Tables
ACM SIGCOMM Computer Communication Review
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Decentralized Schemes for Size Estimation in Large and Dynamic Groups
NCA '05 Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications
Veracity radius: capturing the locality of distributed computations
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Peer counting and sampling in overlay networks: random walk methods
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Fast Estimation of Aggregates in Unstructured Networks
ICAS '09 Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems
Robust distributed orthogonalization based on randomized aggregation
Proceedings of the second workshop on Scalable algorithms for large-scale systems
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
The cost of fault tolerance in multi-party communication complexity
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
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 obtained by comparing it with other averaging approaches have revealed that it outperforms them in terms of time and message complexity.