Randomized algorithms
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Decentralized compression and predistribution via randomized gossiping
Proceedings of the 5th international conference on Information processing in sensor networks
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
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
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Robust message-passing for statistical inference in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
IEEE Transactions on Signal Processing
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
Efficient in-network processing through local ad-hoc information coalescence
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Distributed optimal estimation from relative measurements for localization and time synchronization
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links
IEEE Transactions on Signal Processing
Distributed Average Consensus With Dithered Quantization
IEEE Transactions on Signal Processing - Part I
The capacity of wireless networks
IEEE Transactions on Information Theory
Gossiping With Multiple Messages
IEEE Transactions on Information Theory
Randomized consensus algorithms over large scale networks
IEEE Journal on Selected Areas in Communications
Computing along routes via gossiping
IEEE Transactions on Signal Processing
Location-aided fast distributed consensus in wireless networks
IEEE Transactions on Information Theory
Analysis of accelerated gossip algorithms
Automatica (Journal of IFAC)
| Hi-index | 754.90 |
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However, for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges as slowly as flooding (O(n2) messages). A recently proposed algorithm called geographic gossip improves gossip efficiency by a √n factor, by exploiting geographic information to enable multihop long-distance communications. This paper proves that a variation of geographic gossip that averages along routed paths, improves efficiency by an additional √n factor, and is order optimal (O(n) messages) for grids and random geometric graphs with high probability. We develop a general technique (travel agency method) based on Markov chain mixing time inequalities which can give bounds on the performance of randomized message-passing algorithms operating over various graph topologies.