The Impact of Speed on the Convergence of Gossip Algorithms with Mobility in Wireless Sensor Networks

摘要

This work presents two speed based mobility models for gossip algorithms in wireless sensor networks. The corresponding upper bounds on the convergence time are derived, which show the relationship between speed of agents and convergence rate of gossip algorithms. The influences of speed are examined under both mobility models. Simulation results indicate that the speed based mobility model can offer more precise estimates of communication cost, which provide useful references for large-scale sensor network planning.