Download

Adobe Portable Document Format - [PDF]
PostScript - [PS]

Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes can yield a significant decrease in convergence time. We develop a method for deriving lower bounds on the convergence time by merging nodes according to their mobility pattern. We use this method to show that if the agents have one-dimensional mobility in the same direction the convergence time is improved by at most a constant. We also obtain upper bounds on the convergence time using techniques from the theory of Markov chains and show that simple models of mobility can dramatically accelerate gossip as long as the mobility paths significantly overlap. We use simulations to show that our bounds are still valid for more general mobility models that seem analytically intractable, and further illustrate that different mobility patterns can have significantly different effects on the convergence of distributed algorithms.

Notes

Links

Anand Sarwate's homepage

Reference

A.D. Sarwate and A.G. Dimakis, The Impact of Mobility on Gossip Algorithms, Proceedings of the 28th Annual International Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, 19-24 April 2009.

BibTeX

@INPROCEEDINGS(SarwateD:09infocom,
   AUTHOR = "A.D. Sarwate and A.G. Dimakis",
   TITLE = "The Impact of Mobility on Gossip Algorithms",
   BOOKTITLE = "Proceedings of the 28th Annual International Conference on Computer Communications (INFOCOM)",
   ADDRESS = "Rio de Janeiro, Brazil",
   MONTH = "April",
   YEAR = "2009",
   )