Distributed Set-Membership Filtering for Multirate Systems Under the Round-Robin Scheduling Over Sensor Networks

Self Cite

144

Summary This paper is concerned with the distributed filtering problem for a class of nonlinear time‐delay system over sensor networks subject to multiplicative link noises and switching topology. Both discrete and distributed time delays are included in the system model. Each sensor estimates the system state by means of the measurements not only from itself but also from its neighboring nodes according to an interactive topology. The multiplicative stochastic link noises are taken into consideration to reflect the random perturbations during the information exchanges between sensor nodes. The considered communication topology is switching according to certain predetermined rules. The purpose of the addressed problem is to develop a distributed filtering strategy such that, in the presence of multiplicative stochastic link noises and switching topology, the resulting filtering error dynamics is exponentially stable in the mean square sense and also satisfies the prespecified weighted disturbance attenuation level. In light of the average dwell time technique in combination with stochastic analysis, sufficient conditions are derived for the solvability of the addressed distributed filtering problem, and the desired filtering gains are then obtained through solving certain convex optimization problems. An illustrative simulation example is presented to demonstrate the correctness and applicability of the obtained theoretical results.

Section: Resultsmentioning

confidence: 99%

“…One of the future research topics would be to extend the main results to more complicated systems with more performance requirements. 9,[43][44][45][46]…”

Section: Resultsmentioning

confidence: 99%

Distributed filtering for nonlinear time‐delay systems over sensor networks subject to multiplicative link noises and switching topology

Wang

Liu

et al. 2019

Self Cite

144

“…At last, a numerical simulation has been given to verify the feasibility and usefulness of our designed fault estimation approach. The future research topics would be the extension of the main results obtained in this paper to (1) the system with communication protocols and (2) the time‐varying complex systems …”

Section: Resultsmentioning

confidence: 99%

“…The future research topics would be the extension of the main results obtained in this paper to (1) the system with communication protocols 37,38 and (2) the time-varying complex systems. 39,40…”

Section: Resultsmentioning

confidence: 99%

Finite‐horizon fault estimation for time‐varying systems with multiple fading measurements under torus‐event–based protocols

Wei

Ding

et al. 2019

Self Cite

Summary In this paper, the issue of the finite‐horizon H∞ fault estimation is dealt with for a class of discrete time‐varying systems subject to randomly occurring faults and multiple fading measurements. The missing phenomena may occur in a random way from different sensors, which is represented by an individual stochastic variable meeting a certain probability distribution. Furthermore, in order to alleviate the communication burden, the torus‐event–based protocols are adopted to schedule the data transmissions only when some significant events occur. Our aim of the presented issue is to estimate the fault such that, with multiple fading measurements via the received information governed by torus‐event–based protocols, the H∞ index is satisfied over a given finite horizon. Sufficient conditions are obtained for the desired time‐varying estimator in terms of the technique of stochastic analysis and the methods of completing squares. The desired estimator gains are calculated by working out two backward recursive Riccati difference equations. Finally, a numerical simulation is given to verify the usefulness of our designed fault estimation approach.

“…Set the storage function as V i ( i,k ) = T i,k  i,k i,k . In order to verify inequality (14), the storage function concerning the ith node is calculated along the trajectory of system (10) with the aid of (17) as…”

Section: Definitionmentioning

confidence: 99%

Local design of distributed H_∞‐consensus filtering over sensor networks under multiplicative noises and deception attacks

Han

Dong

Wang

et al. 2019

Self Cite

Summary This paper is concerned with the local design of the distributed H∞‐consensus filtering problem for a class of discrete time‐varying systems subject to both multiplicative noises and deception attacks over sensor networks. The target plant and the measuring sensors are disturbed by multiplicative noises with known statistics. The malicious signal involved in deception attacks is constrained by a specific sector‐like bounded condition, which reflects certain tolerable bound on the difference between the attack signal and the true signal. Attention is paid to the design of filter gains for guaranteeing a desirable filtering performance that simultaneously characterizes the filtering accuracy and the consensus requirement. To handle the proposed filtering problem, the supply rate function is firstly chosen for each node and then the dissipation matrix is constructed as a column substochastic matrix based on the stochastic vector dissipation theory. Subsequently, sufficient conditions by means of recursive linear matrix inequalities are presented for each node such that the filtering error and the consensus error satisfy the desirable H∞‐consensus performance index over a finite horizon. Finally, an illustrative simulation is presented to demonstrate the effectiveness of the proposed filter strategy.