Resilient Recursive Filter Design for Complex Networks With Event-Triggering Random Access Scheme and Random Coupling Strengths

• Published in: IEEE systems journal Vol. 18; no. 1; pp. 725 - 736
• Main Authors: Zha, Lijuan, Miao, Jinzhao, Liu, Jinliang, Xie, Xiangpeng, Tian, Engang
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.03.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Bandwidth; Complex networks; Complex networks (CNs); Coupling; Couplings; Covariance; Data transmission; deception attacks; Difference equations; Event detection; event-triggered control; Filter design (mathematics); IIR filters; Measurement uncertainty; Protocols; Radio frequency; Random access; random access (RA) protocol; Random access memory; recursive filter (RF); Scheduling; Security; Upper bounds
• ISSN: 1932-8184; 1937-9234
• DOI: 10.1109/JSYST.2024.3357901

In this article, a recursive filter (RF) is designed for randomly coupled complex networks (CNs) subject to deception attacks under limited network bandwidth. It is assumed that the coupling strengths between nodes conform to a uniform distribution that is mutually independent. A hybrid scheduling scheme including the event-triggering scheme and the RA protocol is developed to alleviate the burden of network data transmission. An RF method for each node will be created, which can capably restrict the maximum of filtering errors (FEs) under the random coupling, deception attacks, and hybrid scheduling scheme. The solution to difference equations yields the upper bound of FE covariance. The satisfactory filter parameters are derived by minimizing this upper bound. The verification of mean-square boundedness of FE covariance is confirmed under specific assumptions. Finally, the validity of the proposed RF is evidenced by a simulation example.