Key points are not available for this paper at this time.
There has been significant recent research on secure control problems that arise from the open and complex real-world industrial environments. This paper focuses on addressing the issue of secure consensus control in multi-agent systems (MASs) under malicious attacks, utilizing the practical Byzantine fault tolerance (PBFT) and Raft consensus algorithm in blockchain. Unlike existing secure consensus control algorithms that have strict requirements for topology and high communication costs, our approach introduces a node grouping methodology based on system topology. Additionally, we utilize the PBFT consensus algorithm for intergroup leader identity verification, effectively reducing the communication complexity of PBFT in large-scale networks. Furthermore, we enhance the Raft algorithm through cryptographic validation during followers' log replication, which enhances the security of the system. Our proposed consensus process not only identifies the identities of malicious agents but also ensures consensus among normal agents. Through extensive simulations, we demonstrate robust convergence, particularly in scenarios with the relaxed topological requirements. Comparative experiments also validate the algorithm's lower consensus latency and improved efficiency compared to direct PBFT utilization for identity verification and classical secure consensus control method mean subsequence reduced (MSR) algorithm.
Zhu et al. (Tue,) studied this question.