Gossip and consensus in mobile networks

We analyze the effect of node mobility on the convergence time of pairwise gossip algorithms. We use a simple mobility model and illustrate how to transform a gossip with mobile agents into gossip in a static network with a nonuniform distribution on selecting neighbors. We describe two methods for analyzing Markov chain convergence that can be used to derive upper and lower bounds on the convergence time of the network. Several examples are given to show the usefulness of these methods.

[1]  T. C. Aysal,et al.  Distributed Average Consensus With Dithered Quantization , 2008, IEEE Transactions on Signal Processing.

[2]  Christian Bettstetter,et al.  Mobility modeling in wireless networks: categorization, smooth movement, and border effects , 2001, MOCO.

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

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

[5]  A. Sinclair.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[7]  Alexandros G. Dimakis,et al.  Geographic Gossip: Efficient Averaging for Sensor Networks , 2007, IEEE Transactions on Signal Processing.

[8]  Alexandros G. Dimakis,et al.  Order-Optimal Consensus Through Randomized Path Averaging , 2010, IEEE Transactions on Information Theory.

[9]  Martin Vetterli,et al.  Locating mobile nodes with EASE: learning efficient routes from encounter histories alone , 2006, IEEE/ACM Transactions on Networking.

[10]  Konstantinos Psounis,et al.  An analytical study of fundamental mobility properties for encounter-based protocols , 2008, Int. J. Auton. Adapt. Commun. Syst..

[11]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[12]  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..

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

[14]  Konstantinos Psounis,et al.  Fundamental Mobility Properties for Realistic Performance Analysis of Intermittently Connected Mobile Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[15]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Sandro Zampieri,et al.  Randomized consensus algorithms over large scale networks , 2007 .

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

[18]  Martin Vetterli,et al.  Which Distributed Averaging Algorithm Should I Choose for my Sensor Network? , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[19]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

[20]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[21]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[22]  Robert D. Nowak,et al.  Decentralized compression and predistribution via randomized gossiping , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

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

[24]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[25]  Martin Vetterli,et al.  Interval consensus: From quantized gossip to voting , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.