Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Matrix analysis
Randomized algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Approximately uniform random sampling in sensor networks
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Approximate distributed Kalman filtering in sensor networks with quantifiable performance
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
The capacity of wireless networks
IEEE Transactions on Information Theory
Decentralized compression and predistribution via randomized gossiping
Proceedings of the 5th international conference on Information processing in sensor networks
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Distributed consensus and linear functional calculation in networks: an observability perspective
Proceedings of the 6th international conference on Information processing in sensor networks
Robust message-passing for statistical inference in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Geographic gossip on geometric random graphs via affine combinations
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
On collaborative content distribution using multi-message gossip
Journal of Parallel and Distributed Computing
A generic theoretical framework for modeling gossip-based algorithms
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed Online Simultaneous Fault Detection for Multiple Sensors
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
A piggybacking approach to reduce overhead in sensor network gossiping
Proceedings of the 2nd international workshop on Middleware for sensor networks
Segmenting a sensor field: Algorithms and applications in network design
ACM Transactions on Sensor Networks (TOSN)
Supporting situation-aware services with virtual macro sensors
Proceedings of the 2007 Workshop on INnovative SERvice Technologies
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Fast summation via sampling in large-scale sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Foundations and Trends® in Networking
Brief announcement: locality-based aggregate computation in wireless sensor networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Active wireless sensing: a versatile framework for information retrieval in sensor networks
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Averaging approach for distributed event detection in wireless sensor networks
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Network computing capacity for the reverse butterfly network
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Estimation of a population size in large-scale wireless sensor networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Handling dynamics in diffusive aggregation schemes: An evaporative approach
Future Generation Computer Systems
Reaching consensus in wireless networks with probabilistic broadcast
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal gossip-based aggregate computation
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Distributed averaging via lifted Markov chains
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Greedy gossip with eavesdropping
IEEE Transactions on Signal Processing
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Identifying frequent items in a network using gossip
Journal of Parallel and Distributed Computing
Information theoretic bounds for distributed computation over networks of point-to-point channels
IEEE Transactions on Information Theory
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
ChurnDetect: a gossip-based churn estimator for large-scale dynamic networks
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Design and implementation of a robust sensor data fusion system for unknown signals
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Self-organizing virtual macro sensors
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Analysis of gossip-based information propagation in wireless mesh networks
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
Data security in unattended wireless sensor networks with mobile sinks
Wireless Communications & Mobile Computing
Analysis of accelerated gossip algorithms
Automatica (Journal of IFAC)
Distributed and compact routing using spatial distributions in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Compression in wireless sensor networks: A survey and comparative evaluation
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.25 |
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is caused by slow mixing times of random walks on those graphs. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing a simple resampling method, we can demonstrate substantial gains over previously proposed gossip protocols. In particular, for random geometric graphs, our algorithm computes the true average to accuracy 1/nausing O(n1.5√log n) radio transmissions, which reduces the energy consumption by a √nover log n factor over standard gossip algorithms.