Polynomial filtering for fast convergence in distributed consensus
IEEE Transactions on Signal Processing
Broadcast gossip algorithms for consensus
IEEE Transactions on Signal Processing
Asynchronous gossip algorithms for stochastic optimization
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
ICT'09 Proceedings of the 16th international conference on Telecommunications
Fast distributed average consensus algorithms based on advection-diffusion processes
IEEE Transactions on Signal Processing
Optimization and analysis of distributed averaging with memory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reaching consensus in wireless networks with probabilistic broadcast
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Convergence of consensus models with stochastic disturbances
IEEE Transactions on Information Theory
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
SIAM Journal on Control and Optimization
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
Robust distributed orthogonalization based on randomized aggregation
Proceedings of the second workshop on Scalable algorithms for large-scale systems
Fast decentralized averaging via multi-scale gossip
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Fault-Tolerant aggregation: flow-updating meets mass-distribution
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On distributed computation of information potentials
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
| Hi-index | 35.81 |
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste of energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of n and radicn, respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy e using O((n1.5radiclogn) logisin-1) radio transmissions, which yields a radicn/ log n factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.