Title :
Gossip and consensus in mobile networks
Author :
Sarwate, Anand D. ; Dimakis, Alexandros G.
Author_Institution :
Inf. Theor. & Applic. Center, Univ. of California, San Diego, La Jolla, CA, USA
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.
Keywords :
convergence; mobile agents; mobility management (mobile radio); Markov chain convergence analysis; lower bounds; mobile agents; mobile networks; node mobility effect model; pairwise gossip algorithms; static network; upper bounds; Algorithm design and analysis; Clocks; Computer networks; Conferences; Convergence; Distributed computing; Performance analysis; Protocols; Signal processing algorithms; Wireless sensor networks;
Conference_Titel :
Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2009 3rd IEEE International Workshop on
Conference_Location :
Aruba, Dutch Antilles
Print_ISBN :
978-1-4244-5179-1
Electronic_ISBN :
978-1-4244-5180-7
DOI :
10.1109/CAMSAP.2009.5413238
