Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
