Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths
Department of Biomedical Engineering and Sciences, Tecnun, University of Navarra, Manuel Lardizábal 13, 20018 San Sebastián, Spain
*
Author to whom correspondence should be addressed.
Sensors 2018, 18(4), 968; https://doi.org/10.3390/s18040968
Received: 22 February 2018 / Revised: 20 March 2018 / Accepted: 22 March 2018 / Published: 24 March 2018
(This article belongs to the Special Issue Smart Communication Protocols and Algorithms for Sensor Networks)
In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required). The selected network topologies for the analysis (comparison) are the cycle and the path. Specifically, in the present paper, we compute closed-form expressions for the convergence time of four known deterministic algorithms and closed-form bounds for the convergence time of two known randomized algorithms on cycles and paths. Moreover, we also compute a closed-form expression for the convergence time of the fastest deterministic algorithm considered on grids.
View Full-Text
Keywords:
average consensus algorithms; distributed computation; sensor networks; convergence time; number of transmissions
▼
Show Figures
Figure 1
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Gutiérrez-Gutiérrez, J.; Zárraga-Rodríguez, M.; Insausti, X. Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths. Sensors 2018, 18, 968.
Show more citation formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
