Distributed set-membership filtering for time-varying systems: A coding-decoding-based approach

In this paper, the distributed set-membership filtering problem is studied for a class of discrete time-varying systems over digital wireless sensor networks. In order to make full utilization of limited bandwidth of the communication channels connecting sensor nodes, a new coding-decoding communication strategy is implemented to regulate the data transmission between individual nodes. Under the scheduling of the proposed communication strategy, the transmitted signal will be converted to certain codewords belonging to a finite set before transmission according to the corresponding coding rules. Sufficient criteria are firstly established for the solvability of the addressed filtering problem in terms of a series of matrix inequalities. Subsequently, a sub-optimal problem is presented with the purpose of seeking the locally optimal distributed filter. Finally, two simulation examples are given to demonstrate the proposed filtering algorithm. (C) 2021 Elsevier Ltd. All rights reserved.

Automated summary

This paper examines the distributed set-membership filtering problem for a class of discrete time-varying systems over digital wireless sensor networks. A new coding-decoding communication strategy is implemented to regulate data transmission, and matrix inequalities are established to address the filtering problem solvability. A sub-optimal problem is presented to seek the locally optimal distributed filter.