TY - GEN
T1 - Gossip and consensus in mobile networks
AU - Sarwate, Anand D.
AU - Dimakis, Alexandros G.
PY - 2009/12/1
Y1 - 2009/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77951130684&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951130684&partnerID=8YFLogxK
U2 - 10.1109/CAMSAP.2009.5413238
DO - 10.1109/CAMSAP.2009.5413238
M3 - Conference contribution
AN - SCOPUS:77951130684
SN - 9781424451807
T3 - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
SP - 57
EP - 60
BT - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
T2 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009
Y2 - 13 December 2009 through 16 December 2009
ER -