A Survey of Distributed Data Aggregation Algorithms
- 9 September 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Surveys & Tutorials
- Vol. 17 (1), 381-404
- https://doi.org/10.1109/comst.2014.2354398
Abstract
Distributed data aggregation is an important task, allowing the decentralized determination of meaningful global properties, which can then be used to direct the execution of other applications. The resulting values are derived by the distributed computation of functions like Count, Sum, and Average. Some application examples deal with the determination of the network size, total storage capacity, average load, majorities and many others. In the last decade, many different approaches have been proposed, with different trade-offs in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of aggregation algorithms, it can be difficult and time consuming to determine which techniques will be more appropriate to use in specific settings, justifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally defines the concept of aggregation, characterizing the different types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.Keywords
This publication has 90 references indexed in Scilit:
- Fault-Tolerant Aggregation for Dynamic NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Adam2: Reliable Distribution Estimation in Decentralised EnvironmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Fault-Tolerant Aggregation by Flow UpdatingLecture Notes in Computer Science, 2009
- Fast Estimation of Aggregates in Unstructured NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Peer counting and sampling in overlay networks based on random walksDistributed Computing, 2007
- Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and AnalysisIEEE Transactions on Parallel and Distributed Systems, 2006
- Random walk for self-stabilizing group communication in ad hoc networksIEEE Transactions on Mobile Computing, 2006
- Gossip-based aggregation in large dynamic networksACM Transactions on Computer Systems, 2005
- Decentralized Schemes for Size Estimation in Large and Dynamic GroupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Gossip-based computation of aggregate informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004