Distributed State-Saturated Recursive Filtering Over Sensor Networks Under Round-Robin Protocol

• Published in: IEEE transactions on cybernetics Vol. 50; no. 8; pp. 3605 - 3615
• Main Authors: Shen, Bo, Wang, Zidong, Wang, Dong, Liu, Hongjian
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.08.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Covariance; Covariance matrices; Design of experiments; Difference equations; Discrete time systems; Distributed recursive filtering; IIR filters; Linear matrix inequalities; Network topologies; Network topology; Parameters; Protocol (computers); Protocols; round-robin (RR) protocol; sensor networks; Sensors; state saturations; Symmetric matrices; Time-varying systems; Upper bound; Upper bounds
• ISSN: 2168-2267; 2168-2275; 2168-2275
• DOI: 10.1109/TCYB.2019.2932460

This article is concerned with the distributed recursive filtering issue for stochastic discrete time-varying systems subjected to both state saturations and round-robin (RR) protocols over sensor networks. The phenomenon of state saturation is considered to better describe practical engineering. The RR protocol is introduced to mitigate a network burden by determining which component of the sensor node has access to the network at each transmission instant. The purpose of the issue under consideration is to construct a distributed recursive filter such that a certain filtering error covariance's upper bound can be found and the corresponding filter parameters' explicit expression is given with both state saturations and RR protocols. By taking advantage of matrix difference equations, a filtering error covariance's upper bound can be presented and then be minimized by appropriately designing filter parameters. In particular, by using a matrix simplification technique, the sensor network topology's sparseness issue can be tackled. Finally, the feasibility for the addressed filtering scheme is demonstrated by an example.