Gossip and consensus in mobile networks

Anand D. Sarwate, Alexandros G. Dimakis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationCAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
Pages57-60
Number of pages4
DOIs
StatePublished - Dec 1 2009
Externally publishedYes
Event2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009 - Aruba, Netherlands
Duration: Dec 13 2009Dec 16 2009

Publication series

NameCAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing

Other

Other2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009
CountryNetherlands
CityAruba
Period12/13/0912/16/09

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Software

Fingerprint Dive into the research topics of 'Gossip and consensus in mobile networks'. Together they form a unique fingerprint.

Cite this