The Impact of Mobility on Gossip Algorithms

Details The Impact of Mobility on Gossip Algorithms The Impact of Mobility on Gossip Algorithms

2008-10-14

arxiv.org/abs/0810.2513v3

Computer Science

Networking and Internet Architecture

Revised version submitted to IEEE Transactions on Information Theory

Scientific paper

The influence of node mobility on the convergence time of averaging gossip algorithms in networks is studied. It is shown that a small number of fully mobile nodes can yield a significant decrease in convergence time. A method is developed for deriving lower bounds on the convergence time by merging nodes according to their mobility pattern. This method is used to show that if the agents have one-dimensional mobility in the same direction the convergence time is improved by at most a constant. Upper bounds are obtained 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. Simulations verify that different mobility patterns can have significantly different effects on the convergence of distributed algorithms.

Affiliated with

Also associated with

No associations

Rating

The Impact of Mobility on Gossip Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Impact of Mobility on Gossip Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Impact of Mobility on Gossip Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591956