Recursive Minimum-Variance Filter Design for State-Saturated Complex Networks With Uncertain Coupling Strengths Subject to Deception Attacks

• Published in: IEEE transactions on cybernetics Vol. 52; no. 10; pp. 11121 - 11132
• Main Authors: Gao, Hongyu, Dong, Hongli, Wang, Zidong, Han, Fei
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.10.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Complex networks; Complex networks (CNs); Coupling; coupling uncertainties; Couplings; deception attacks; Filter design (mathematics); Petroleum; Radio frequency; Random variables; recursive filtering (RF); state saturations; Time-varying systems; Uncertainty; Upper bound; Upper bounds; Variance
• ISSN: 2168-2267; 2168-2275; 2168-2275
• DOI: 10.1109/TCYB.2021.3067822

In this article, the recursive filtering problem is investigated for state-saturated complex networks (CNs) subject to uncertain coupling strengths (UCSs) and deception attacks. The measurement signals transmitted via the communication network may suffer from deception attacks, which are governed by Bernoulli-distributed random variables. The purpose of the problem under consideration is to design a minimum-variance filter for CNs with deception attacks, state saturations, and UCSs such that upper bounds on the resulting error covariances are guaranteed. Then, the expected filter gains are acquired via minimizing the traces of such upper bounds, and sufficient conditions are established to ensure the exponential mean-square boundedness of the filtering errors. Finally, two simulation examples (including a practical application) are exploited to validate the effectiveness of our designed approach.