A Discrete Consensus Protocol with Algebraic-Connectivity-Based Fault Tolerance for Decentralized Multi-Agent Communication Networks
Open Access
- 11 September 2026
- conference paper
- Published by MDPI AG in Engineering Proceedings
- Vol. 154 (1) , 78
Abstract
Decentralized coordination of multi-agent communication networks underpins autonomous UAV swarms, sensor meshes, and cyber-physical systems that must operate without a single point of failure, yet quantitative design rules linking topology degradation to coordination collapse are still lacking. This paper aims to characterize the fault tolerance of a discrete linear consensus protocol that drives mobile agents’ scalar states toward a common value over a time-varying communication graph. The convergence rate and fault tolerance budget of the protocol are explicitly tied to the algebraic connectivity of the graph Laplacian, and three failure regimes—random independent failures (), sequential staged failures (), and targeted attacks on the highest-degree hubs ()—are analyzed using a full-factorial Monte-Carlo experiment of 1620 runs implemented in Python with the Mesa framework and NetworkX. Critical failure thresholds are 0.42–0.51 for , 0.38–0.48 for , and 0.28–0.38 for ; a Kruskal–Wallis test (p < 0.001) confirms the ordering , providing quantitative design rules for fault-tolerant consensus-driven networks.
Keywords
This publication has 14 references indexed in Scilit:
- Resilient Consensus of Multiagent Systems Under Collusive Attacks on Communication LinksIEEE Transactions on Cybernetics, 2022
- Resilient Consensus for Multi-Agent Systems Under Adversarial Spreading ProcessesIEEE Transactions on Network Science and Engineering, 2022
- Resilient Consensus of Higher Order Multiagent Networks: An Attack Isolation-Based ApproachIEEE Transactions on Automatic Control, 2021
- Utilizing Python for Agent-Based Modeling: The Mesa Framework2020
- UAV swarm communication and control architectures: a reviewJournal of Unmanned Vehicle Systems, 2019
- Multi-Agent Systems: A SurveyIEEE Access, 2018
- Flocking for Multi-Agent Dynamic Systems: Algorithms and TheoryIEEE Transactions on Automatic Control, 2006
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Error and attack tolerance of complex networksNature, 2000
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997