Randomized algorithms
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Building efficient wireless sensor networks with low-level naming
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
Time Synchronization for Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Locally constructed algorithms for distributed computations in ad-hoc networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Synopsis diffusion for robust aggregation in sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
CountTorrent: ubiquitous access to query aggregates in dynamic and mobile sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
FAIR: fuzzy-based aggregation providing in-network resilience for real-time wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Fault-Tolerant Aggregation by Flow Updating
DAIS '09 Proceedings of the 9th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems
Brief announcement: locality-based aggregate computation in wireless sensor networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
A Robust Algorithm for the Membership Management of Super-Peer Overlay
MMNS 2009 Proceedings of the 12th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Wired-Wireless Multimedia Networks and Services Management
ACC'09 Proceedings of the 2009 conference on American Control Conference
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Sensor relocation for emergent data acquisition in sparse mobile sensor networks
Mobile Information Systems
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
A real-time data aggregation method for fault-tolerant wireless sensor networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
| Hi-index | 0.00 |
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. Computing aggregates such as average, minimum, maximum and sum is fundamental to various primitive functions of a sensor network, such as system monitoring, data querying, and collaborative information processing. In this paper, we present and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates. Our Distributed Random Grouping (DRG) algorithm is simple and natural and uses probabilistic grouping to progressively converge to the aggregate value. DRG is local and randomized and is naturally robust against dynamic topology changes from link/node failures. Although our algorithm is natural and simple, it is nontrivial to show that it converges to the correct aggregate value and to bound the time needed for convergence. Our analysis uses the eigenstructure of the underlying graph in a novel way to show convergence and to bound the running time of our algorithms. We also present simulation results of our algorithm and compare its performance to various other known distributed algorithms. Simulations show that DRG needs far fewer transmissions than other distributed localized schemes.