Algebraic Connectivity Control and Maintenance in Multi-Agent Networks under Attack
<|reference_start|>Algebraic Connectivity Control and Maintenance in Multi-Agent Networks under Attack: This paper studies the problem of increasing the connectivity of an ad-hoc peer-to-peer network subject to cyber-attacks targeting the agents in the network. The adopted strategy involves the design of local interaction rules for the agents to locally modify the graph topology by adding and removing links with neighbors. Two distributed protocols are presented to boost the algebraic connectivity of the network graph beyond $k-2\sqrt{k-1}$ where $k\in \mathbb{N}$ is a free design parameter; these two protocols are achieved through the distributed construction of random (approximate) regular graphs. One protocol leverages coordinated actions between pairs of neighboring agents and is mathematically proven to converge to the desired graph topology. The other protocol relies solely on the uncoordinated actions of individual agents and it is validated by a spectral analysis through Monte-Carlo simulations. Numerical simulations offer a comparative analysis with other state-of-the-art algorithms, showing the ability of both proposed protocols to maintain high levels of connectivity despite attacks carried out with full knowledge of the network structure, and highlighting their superior performance.<|reference_end|>
@article{zhao2024algebraic,
    title={Algebraic Connectivity Control and Maintenance in Multi-Agent Networks
  under Attack},
    author={Wenjie Zhao, Diego Deplano, Zhiwu Li, Alessandro Giua and Mauro
  Franceschelli},
    journal={arXiv preprint arXiv:2406.18467},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.18467},
    primaryClass={eess.SY cs.SY math.OC}
}