Distributed H<inf>∞</inf> filtering of discrete-time linear systems over sensor networks with event-triggered communication

This paper is concerned with distributed event-triggered H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filtering for a discrete-time linear system over a sensor network. Sensor nodes are physically distributed and communicated through network medium. Firstly, a distributed event-triggered communication scheme is presented to determine when the measurement output on each sensor node should be broadcast and transmitted to its neighboring nodes. Each sensor node is equipped with an event monitor which consists of an event generator and a store. The event generator is configured to produce a series of events according to an event triggering rule. The store is employed to reserve the latest data packets. Secondly, based on the Lyapunov functional approach, criteria for analyzing H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filtering performance and designing desired distributed event-triggered H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filters are derived such that the resultant filtering error system is asymptotically stable with a prescribed H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> performance index. The filter design problem is posed in terms of linear matrix inequalities. Finally, an illustrative example is given to demonstrate the effectiveness of the obtained theoretical results.