{"title":"Recursive Filtering for Complex Networks With Amplify-and-Forward Relays Over Double Time-Correlated Fading Channels","authors":"Qi Li;Zidong Wang;Jun Hu;Weiguo Sheng","doi":"10.1109/TSMC.2025.3647812","DOIUrl":null,"url":null,"abstract":"In this article, the recursive filtering problem is investigated for a class of complex networks (CNs) incorporating amplify-and-forward (AF) relays and subject to double time-correlated fading channels (TCFCs). To extend the transmission distance, AF relays are deployed between sensors and filters to facilitate the signal transmission process. Both the sensor-to-relay and relay-to-filter channels are modeled as TCFCs, with their fading coefficients governed by distinct dynamical processes. A suitably augmented model is constructed to capture the combined effects of the network state and fading coefficients. Based on this model, a set of recursive filters is designed to ensure an upper bound on the filtering error covariance (FEC), and the corresponding filter gains that minimize this bound are parameterized by solving a set of recursive equations. Furthermore, the filtering performance is rigorously analyzed, and a sufficient condition is provided to guarantee the exponential boundedness of the filtering error in the mean-square sense. Finally, an example is presented to demonstrate the effectiveness of the proposed filtering strategy.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"56 3","pages":"1561-1573"},"PeriodicalIF":8.4000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11361272/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/22 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In this article, the recursive filtering problem is investigated for a class of complex networks (CNs) incorporating amplify-and-forward (AF) relays and subject to double time-correlated fading channels (TCFCs). To extend the transmission distance, AF relays are deployed between sensors and filters to facilitate the signal transmission process. Both the sensor-to-relay and relay-to-filter channels are modeled as TCFCs, with their fading coefficients governed by distinct dynamical processes. A suitably augmented model is constructed to capture the combined effects of the network state and fading coefficients. Based on this model, a set of recursive filters is designed to ensure an upper bound on the filtering error covariance (FEC), and the corresponding filter gains that minimize this bound are parameterized by solving a set of recursive equations. Furthermore, the filtering performance is rigorously analyzed, and a sufficient condition is provided to guarantee the exponential boundedness of the filtering error in the mean-square sense. Finally, an example is presented to demonstrate the effectiveness of the proposed filtering strategy.
期刊介绍:
The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.