2021/03/09 by Michal Yemini, Yemini, Michal, Angelia Nedić +5 · 3 citations
Computer Science · #Distributed Control Multi-Agent Systems #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Robotics (cs.RO) #Security in Wireless Sensor Networks #Signal Processing (eess.SP) #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2103.05464
openalex publication_date 2021/03/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work considers the problem of resilient consensus where stochastic values of trust between agents are available. Specifically, we derive a unified mathematical framework to characterize convergence, deviation of the consensus from the true consensus value, and expected convergence rate, when there exists additional information of trust between agents. We show that under certain conditions on the stochastic trust values and consensus protocol: 1) almost sure convergence to a common limit value is possible even when malicious agents constitute more than half of the network connectivity, 2) the deviation of the converged limit, from the case where there is no attack, i.e., the true consensus value, can be bounded with probability that approaches 1 exponentially, and 3) correct classification of malicious and legitimate agents can be attained in finite time almost surely. Further, the expected convergence rate decays exponentially as a function of the quality of the trust observations between agents.