License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SAND.2022.10
URN: urn:nbn:de:0030-drops-159521
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15952/
Charron-Bost, Bernadette ;
Lambein-Monette, Patrick
Computing Outside the Box: Average Consensus over Dynamic Networks
Abstract
Networked systems of autonomous agents, and applications thereof, often rely on the control primitive of average consensus, where the agents are to compute the average of private initial values. To provide reliable services that are easy to deploy, average consensus should continue to operate when the network is subject to frequent and unpredictable change, and should mobilize few computational resources, so that deterministic, low powered, and anonymous agents can partake in the network.
In this stringent adversarial context, we investigate the implementation of average consensus by distributed algorithms over networks with bidirectional, but potentially short-lived, communication links. Inspired by convex recurrence rules for multi-agent systems, and the Metropolis average consensus rule in particular, we design a deterministic distributed algorithm that achieves asymptotic average consensus, which we show to operate in polynomial time in a synchronous temporal model.
The algorithm is easy to implement, has low space and computational complexity, and is fully distributed, requiring neither symmetry-breaking devices like unique identifiers, nor global control or knowledge of the network. In the fully decentralized model that we adopt, to our knowledge, no other distributed average consensus algorithm has a better temporal complexity.
Our approach distinguishes itself from classical convex recurrence rules in that the agent’s values may sometimes leave their previous convex hull. As a consequence, our convergence bound requires a subtle analysis, despite the syntactic simplicity of our algorithm.
BibTeX - Entry
@InProceedings{charronbost_et_al:LIPIcs.SAND.2022.10,
author = {Charron-Bost, Bernadette and Lambein-Monette, Patrick},
title = {{Computing Outside the Box: Average Consensus over Dynamic Networks}},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-224-2},
ISSN = {1868-8969},
year = {2022},
volume = {221},
editor = {Aspnes, James and Michail, Othon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15952},
URN = {urn:nbn:de:0030-drops-159521},
doi = {10.4230/LIPIcs.SAND.2022.10},
annote = {Keywords: average consensus, dynamic networks, distributed algorithms, iterated averaging, Metropolis}
}
|
Keywords: |
|
average consensus, dynamic networks, distributed algorithms, iterated averaging, Metropolis |
|
Collection: |
|
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
29.04.2022 |
