Secure multi-dimensional consensus algorithm against malicious attacks

In this paper, we investigate the problem of multi-dimensional consensus subject to the internal agent dynamics constraint and external non-cooperative malicious attacks. We propose a secure discrete-time multi-dimensional consensus algorithm (SMCA), where two-hop information is utilized to check th...

Full description

Saved in:
Bibliographic Details
Published inAutomatica (Oxford) Vol. 157; p. 111224
Main Authors Luo, Xiaoyu, Zhao, Chengcheng, He, Jianping
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 01.11.2023
Subjects
Incremental norm
Malicious attacks
Multi-dimensional consensus
Secure algorithm
Two-hop information
Secure algorithm
Malicious attacks
Two-hop information
Multi-dimensional consensus
Incremental norm
Online AccessGet full text

Cover

More Information
Summary:In this paper, we investigate the problem of multi-dimensional consensus subject to the internal agent dynamics constraint and external non-cooperative malicious attacks. We propose a secure discrete-time multi-dimensional consensus algorithm (SMCA), where two-hop information is utilized to check the integrity of neighboring agents’ information. Furthermore, we derive a necessary and sufficient condition for all normal agents to achieve consensus exponentially under SMCA. For the boundary-case attacks under SMCA, we first cast the problem as an equivalent problem of multi-dimensional consensus with nonuniform time-delays, and then obtain the analytical expression of the attacks’ effects on the final state and convergence rate. Compared with the existing works, SMCA can achieve multi-dimensional consensus for all normal agents with local dynamics even when the number of compromised agents is unknown. Finally, extensive simulations demonstrate the effectiveness of the proposed algorithm.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2023.111224