Gossip along the way: order-optimal consensus through randomized path averaging

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms 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 very slowly. A recently proposed algorithm called geographic gossip improves gossip efficiency by a $\sqrt{n / \log n}$ factor for random geometric graphs, by exploiting geographic information of node locations. In this paper we prove that a variation of geographic gossip that averages along routed paths, improves efficiency by an additional $\sqrt{n / \log n}$ factor and is order optimal for grids and random geometric graphs. Our analysis provides some general techniques and can be used to provide bounds on the performance of randomized message passing algorithms operating over various graph topologies.

[1]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[2]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[4]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[5]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Stephen P. Boyd,et al.  Analysis and optimization of randomized gossip algorithms , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[8]  Venkatesh Saligrama,et al.  A Random-Walk Model for Distributed Computation in Energy-Limited Networks , 2006 .

[9]  Benjamin Van Roy,et al.  Consensus Propagation , 2005, IEEE Transactions on Information Theory.

[10]  Richard M. Murray,et al.  Approximate distributed Kalman filtering in sensor networks with quantifiable performance , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[12]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[13]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[14]  A. Dimakis,et al.  Geographic gossip: efficient aggregation for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[15]  M. Rabbat,et al.  Decentralized compression and predistribution via randomized gossiping , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[16]  Huaiyu Dai,et al.  Location-Aided Fast Distributed Averaging , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[17]  Devavrat Shah,et al.  Information Dissemination via Gossip: Applications to Averaging and Coding , 2005 .

[18]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[19]  M. Alanyali,et al.  Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links , 2006, IEEE Transactions on Signal Processing.

[20]  D. Vere-Jones Markov Chains , 1972, Nature.