PreprintarXiv licencearXiv
Topology Design for Distributed Consensus with Relay-Assisted Communication
Abstract
This paper focuses on relay-assisted topology optimization to accelerate the convergence of distributed consensus algorithms over weakly connected networks. Instead of permanently adding a fixed set of relay links, we introduce a time-sharing framework where multiple relay configurations are activated in a probabilistic manner. An ActiveSet-based algorithm incrementally constructs candidate relay edge sets and jointly optimizes the mixing matrices and the associated relay set activation probabilities, allowing adaptive relay selection in the optimization process. Simulation results demonstrate a substantially improved performance-cost trade-off compared with fixed-cardinality relay selection strategies.
Related
- Distributed Consensus, Optimization, and Learning under Communication Constraints
- Non-Coherent Over-the-Air Distributed Consensus: Algorithm Design and Power Control Optimization
- Consensus-Aware Co-design of Wireless Multi-Agent Control and Communication Systems
- Surrogate-assisted multi-objective topology optimization design method for prefabricated large-span Suspen-Dome based on structural-mapping-method and improved-PGSA
- Input-to-State Stability Framework for Fully Distributed Primal-Dual Dynamics for Quadratic GNEPs Without Multiplier Consensus
BibTeX
@misc{ren2026topology,
title = {{Topology Design for Distributed Consensus with Relay-Assisted Communication}},
author = {Shuyi Ren and Zheng Chen and Erik G. Larsson},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.08489},
eprint = {2610.08489},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.08489},
}
RIS
TY - UNPB
TI - Topology Design for Distributed Consensus with Relay-Assisted Communication
AU - Shuyi Ren
AU - Zheng Chen
AU - Erik G. Larsson
PY - 2026
DA - 2026/10/06
PB - arXiv
DO - 10.48550/arxiv.2610.08489
UR - https://arxiv.org/abs/2610.08489
AB - This paper focuses on relay-assisted topology optimization to accelerate the convergence of distributed consensus algorithms over weakly connected networks. Instead of permanently adding a fixed set of relay links, we introduce a time-sharing framework where multiple relay configurations are activated in a probabilistic manner. An ActiveSet-based algorithm incrementally constructs candidate relay edge sets and jointly optimizes the mixing matrices and the associated relay set activation probabilities, allowing adaptive relay selection in the optimization process. Simulation results demonstrate a substantially improved performance-cost trade-off compared with fixed-cardinality relay selection strategies.
ER -