Distributed stopping for average consensus in undirected graphs via event-triggered strategies
Date
2016Source
AutomaticaVolume
70Issue
Journal ArticlePages
121-127Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We develop and analyze two distributed event-triggered linear iterative algorithms that enable the components of a distributed system, each with some initial value, to reach approximate average consensus on their initial values, after executing a finite number of iterations. Each proposed algorithm provides a criterion that allows the nodes to determine, in a distributed manner, when to terminate because approximate average consensus has been reached, i.e., all nodes have obtained a value that is within a small distance from the average of their initial values. We focus on a distributed system whose underlying topology is captured by an undirected (symmetric) graph, and develop linear iterative strategies with time-varying weights, chosen based on the subset of edges that separate nodes with significantly different values and are considered active at each iteration. In our simulations, we illustrate the proposed algorithms and compare the number of iterations and transmitted values required by the proposed protocols against a previously proposed stopping protocol for approximate average consensus. © 2016 Elsevier Ltd. All rights reserved.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Article
Distributed finite-time average-consensus with limited computational and storage capability
Oliva, G.; Setola, R.; Hadjicostis, Christoforos N. (2017)Consensus is a fundamental feature of distributed systems, and it is the prerequisite for several complex tasks, such as flocking of mobile robots, localization in wireless-sensor networks, or decentralized control of smart ...
-
Article
Random spectral measure for non Gaussian moving averages
Baxevani, Anastassia; Podgórski, K. (2017)We study the distribution of phases and amplitudes for the spectral representation of weighted moving averages of a general noise measure. The simple independent structure, known for the Gaussian case, and involving Rayleigh ...
-
Article
On Locally Dyadic Stationary Processes
Moysiadis, Theodoros; Fokianos, Konstantinos (2017)We introduce the concept of local dyadic stationarity, to account for nonstationary time series, within the framework of Walsh-Fourier analysis. We define and study time-varying, dyadic, autoregressive, moving average ...