Event-triggered Approximate Byzantine Consensus with Multi-hop Communication
arXiv:2204.08883 · doi:10.1109/TSP.2023.3266975
Abstract
In this paper, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop an event-triggered update rule to tackle this problem as well as reduce the communication for each agent. Our approach is based on the mean subsequence reduced (MSR) algorithm with agents being capable to communicate with multi-hop neighbors. Since delays are critical in such an environment, we provide necessary graph conditions for the proposed algorithm to perform well with delays in the communication. We highlight that through multi-hop communication, the network connectivity can be reduced especially in comparison with the common onehop communication case. Lastly, we show the effectiveness of the proposed algorithm by a numerical example.
arXiv commentarXiv admin note: text overlap with arXiv:2201.03214
References in corpus (7)
- Distributed Bayesian Detection with Byzantine Data
- Cooperative Algorithms for MIMO Amplify-and-Forward Relay Networks
- The Internet of Things: Secure Distributed Inference
- Resilient Distributed Parameter Estimation with Heterogeneous Data
- Dynamic Resilient Network Games with Applications to Multi-Agent Consensus
- Binary Hypothesis Testing with Byzantine Sensors: Fundamental Trade-off Between Security and Efficiency
- Global Synchronization of Pulse-Coupled Oscillator Networks Under Byzantine Attacks