2020/06/21 by Yuan Wang, Wang, Yuan, Hideaki Ishii +5
Computer Science · #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #FOS: Electrical engineering #Mobile Agent-Based Network Management #Optimization and Search Problems #Parallel #Systems and Control (eess.SY) #and Cluster Computing (cs.DC) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2006.11711
openalex publication_date 2020/06/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper addresses novel consensus problems in the presence of adversaries that can move within the network and induce faulty behaviors in the attacked agents. By adopting several mobile adversary models from the computer science literature, we develop protocols which can mitigate the influence of such malicious agents. The algorithms follow the class of mean subsequence reduced (MSR) algorithms, under which agents ignore the suspicious values received from neighbors during their state updates. Different from the static adversary models, even after the adversaries move away, the infected agents may remain faulty in their values, whose effects must be taken into account. We develop conditions on the network structures for both the complete and non-complete graph cases, under which the proposed algorithms are guaranteed to attain resilient consensus. Extensive simulations are carried out over random graphs to verify the effectiveness of our approach under uncertainties in the systems.