Resilient Quantized Consensus in Multi-Hop Relay Networks

TL;DR

This paper introduces a resilient quantized consensus algorithm for multi-hop relay networks with asynchronous updates, malicious agents, and time delays, providing tighter conditions for achieving consensus.

Contribution

It presents a new algorithm with necessary and sufficient conditions for resilient consensus under Byzantine attacks in multi-hop networks.

Findings

Tighter graph conditions than previous algorithms.

Proven effectiveness under malicious and Byzantine attacks.

Numerical examples confirm algorithm performance.

Abstract

We study resilient quantized consensus in multi-agent systems, where some agents may malfunction. The network consists of agents taking integer-valued states, and the agents' communication is subject to asynchronous updates and time delays. We utilize the quantized weighted mean subsequence reduced algorithm where agents communicate with others through multi-hop relays. We prove necessary and sufficient conditions for our algorithm to achieve the objective under the malicious and Byzantine attack models. Our approach has tighter graph conditions compared to the one-hop algorithm and the flooding-based algorithms for binary consensus. Numerical examples verify the efficacy of our algorithm.