Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions

DOI10.1016/J.AUTOMATICA.2024.111908MaRDI QIDQ6659191zbMATH OpenFDO

Authors Liwei Yuan, Hideaki Ishii

Publication date 8 January 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2024.111908

zbMATH Keywords

asynchronous distributed algorithmsByzantine consensuscyber-securitymulti-hop communication

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Reaching approximate Byzantine consensus with multi-hop communication
• Resilient consensus in continuous-time networks with -hop communication and time delay
• Resilient leaderless and leader-follower consensus over random networks through \(\ell\)-hop communication
• Reaching approximate Byzantine consensus with multi-hop communication

Cites work

• A probabilistic characterization of random and malicious communication failures in multi-hop networked control
• Approximate agreement under mobile Byzantine faults
• Asynchronous Byzantine Approximate Consensus in Directed Networks
• Chance-constrained \(H_\infty\) control for a class of time-varying systems with stochastic nonlinearities: the finite-horizon case
• Consensus and Cooperation in Networked Multi-Agent Systems
• Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
• Distributed secure state estimation for linear systems against malicious agents through sorting and filtering
• Fault-tolerant consensus in directed graphs
• Fundamentals of Wireless Communication
• Global leader-following consensus of a group of general linear systems using bounded controls
• scientific article; zbMATH DE number 996442 (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
• Principles of Distributed Systems
• Reaching approximate agreement in the presence of faults
• Reaching approximate Byzantine consensus with multi-hop communication
• Resilient consensus of second-order agent networks: asynchronous update rules with delays
• Resilient Consensus Through Event-Based Communication
• Resilient Randomized Quantized Consensus
• Resilient stabilization of multi-hop control networks subject to malicious attacks
• Secure consensus with distributed detection via two-hop communication
• State consensus for multi-agent systems with switching topologies and time-varying delays
• The Byzantine generals strike again

Cited in

(3)

• Resilient distributed averaging: adversary detection and topological insights
• Resilient leaderless and leader-follower consensus over random networks through \(\ell\)-hop communication
• On the non-resiliency of subsequence reduced resilient consensus in multiagent networks

This page was built for publication: Asynchronous approximate Byzantine consensus: a multi-hop relay method and tight graph conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659191)