Resilient multi-dimensional consensus in adversarial environment
From MaRDI portal
Abstract: This paper considers the multi-dimensional consensus in networked systems, where some of the agents might be misbehaving (or faulty). Despite the influence of these misbehaviors, the benign agents aim to reach an agreement while avoiding being seriously influenced by the faulty ones. To this end, this paper first considers a general class of consensus algorithms, where each benign agent computes an "auxiliary point" based on the received values and moves its state toward this point. Concerning this generic form, we present conditions for achieving resilient consensus and obtain a lower bound on the exponential convergence rate. Assuming that the number of malicious agents is upper bounded, two specific resilient consensus algorithms are further developed based on the obtained conditions. Particularly, the first solution, based on Helly's Theorem, achieves the consensus within the convex hull formed by the benign agents' initial states, where the auxiliary point can be efficiently computed through linear programming. On the other hand, the second algorithm serves as a "built-in" security guarantee for standard average consensus algorithms, in the sense that its performance coincides exactly with that of the standard ones in the absence of faulty nodes while also resisting the serious influence of the misbehaving ones in adversarial environment. Some numerical examples are provided in the end to verify the theoretical results.
Recommendations
- Low complexity resilient consensus in networked multi-agent systems with adversaries
- Secure multi-dimensional consensus algorithm against malicious attacks
- General resilient consensus algorithms
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- Resilient group consensus in the presence of Byzantine agents
Cites work
- A Distributed Cyber-Attack Detection Scheme With Application to DC Microgrids
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Algorithms for center and Tverberg points
- Approximating the centroid is hard
- Byzantine vector consensus in complete graphs
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus Computation in Unreliable Networks: A System Theoretic Approach
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus Propagation
- Constrained Consensus and Optimization in Multi-Agent Networks
- Detection in Adversarial Environments
- Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
- Distributed fault detection for interconnected second-order systems
- Distributed Optimization Under Adversarial Nodes
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3214278 (Why is no real title available?)
- Improving Network Connectivity and Robustness Using Trusted Nodes With Application to Resilient Consensus
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Multidimensional approximate agreement in Byzantine asynchronous systems
- On Conditions for Convergence to Consensus
- Reaching approximate agreement in the presence of faults
- Resilience against misbehaving nodes in asynchronous networks
- Resilient consensus in multi-agent systems with state constraints
- Resilient First-Order Consensus and Weakly Stable, Higher Order Synchronization of Continuous-Time Networked Multiagent Systems
- Resilient Randomized Quantized Consensus
- Stochastic and deterministic fault detection for randomized gossip algorithms
Cited in
(20)- Resilient distributed vector consensus using centerpoint
- Multi-armed bandit based distributed resilient consensus and its applications in social networks
- Secure rendezvous and static containment in multi-agent systems with adversarial intruders
- Resilient consensus in multi-agent systems with state constraints
- Resilient consensus for multi-agent systems subject to differential privacy requirements
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- Secure consensus with distributed detection via two-hop communication
- Secure gossip against intermittently malicious agents
- Consensus in networked multi-agent systems with adversaries
- Low complexity resilient consensus in networked multi-agent systems with adversaries
- Consensus of second-order multi-agent systems in the presence of locally bounded faults
- An event-triggered approach to quantized resilient consensus
- Resilient group consensus in the presence of Byzantine agents
- Matrix-scaled resilient consensus of discrete-time and continuous-time networks
- Secure multi-dimensional consensus algorithm against malicious attacks
- Resilient interval consensus in robust networks
- Resilient consensus of high-order networks against collusive attacks
- Mixed self/event-triggered ternary control for resilient consensus against mobile adversarial agents
- On the non-resiliency of subsequence reduced resilient consensus in multiagent networks
- Resilient quantised consensus of multiagent systems under malicious attacks
This page was built for publication: Resilient multi-dimensional consensus in adversarial environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081822)
