Multi-Agent Trustworthy Consensus under Random Dynamic Attacks
Preprint
Abstract
In this work, we study the consensus problem in which legitimate agents send their values over an undirected communication network in the presence of an unknown subset of malicious or faulty agents. In contrast to former works, we generalize and characterize the properties of consensus dynamics with dependent sequences of malicious transmissions with dynamic (time-varying) rates, based on not necessarily independent trust observations. We consider a detection algorithm utilizing stochastic trust observations available to legitimate agents. Under these conditions, legitimate agents almost surely classify their neighbors and form their trusted neighborhoods correctly with decaying misclassification probabilities. We further prove that the consensus process converges almost surely despite the existence of malicious agents. For a given value of failure probability, we characterize the deviation from the nominal consensus value ideally occurring when there are no malicious agents in the system. We also examine the convergence rate of the process in finite time. Numerical simulations show the convergence among agents and indicate the deviation under different attack scenarios.Keywords
All Related Versions
This publication has 39 references indexed in Scilit:
- On the non-resiliency of subsequence reduced resilient consensus in multiagent networksEuropean Journal of Control, 2024
- Resilient and constrained consensus against adversarial attacks: A distributed MPC frameworkAutomatica, 2023
- Secure gossip against intermittently malicious agentsSystems & Control Letters, 2022
- An overview on multi-agent consensus under adversarial attacksAnnual Reviews in Control, 2022
- Resilient Multi-Agent Consensus Using Wi-Fi SignalsIEEE Control Systems Letters, 2018
- Guaranteeing spoof-resilient multi-robot networksAutonomous Robots, 2017
- Adaptive Inter-Robot Trust for Robust Multi-Robot Sensor Coverage2016
- Resilient Asymptotic Consensus in Robust NetworksIEEE Journal on Selected Areas in Communications, 2013
- Fast linear iterations for distributed averagingSystems & Control Letters, 2004
- The Byzantine generals strike againJournal of Algorithms, 1982