Distributed H∞ Filtering for Switched Stochastic Delayed Systems Over Sensor Networks With Fading Measurements

Distributed State Estimation for Mixed Delays System Over Sensor Networks With Multichannel Random Attacks and Markov Switching Topology

This article deals with the distributed state estimation for mixed delays system under unknown attacks. A new multichannel random attack model is established for the first time, where network attacks are considered to exist in three channels: the target-to-sensor channel, the senor-to-sensor channel, and the sensor-to-estimator channel. In the above model, transmitted packets are allowed to be attacked multiple times simultaneously, and when they are successfully attacked, the transmitted information is modified. Besides, the topology of the sensor network is considered to change dynamically according to the Markov chain. Based on the newly established distributed estimation model, the estimation error system is proven to be asymptotically mean-square stable under a given H∞ antidisturbance index by using a Lyapunov theory and a stochastic analysis technique; then, the estimator parameter matrices are solved utilizing a linearization method. Finally, several simulation examples are listed to testify the effectiveness of the designed algorithm.

Multiple Mismatched Synchronization for Coupled Memristive Neural Networks With Topology-Based Probability Impulsive Mechanism on Time Scales

This article is concerned with the exponential synchronization of coupled memristive neural networks (CMNNs) with multiple mismatched parameters and topology-based probability impulsive mechanism (TPIM) on time scales. To begin with, a novel model is designed by taking into account three types of mismatched parameters, including: 1) mismatched dimensions; 2) mismatched connection weights; and 3) mismatched time-varying delays. Then, the method of auxiliary-state variables is adopted to deal with the novel model, which implies that the presented novel model can not only use any isolated system (regard as a node) in the coupled system to synchronize the states of CMNNs but also can use an external node, that is, not affiliated to the coupled system to synchronize the states of CMNNs. Moreover, the TPIM is first proposed to efficiently schedule information transmission over the network, possibly subject to a series of nonideal factors. The novel control protocol is more robust against these nonideal factors than the traditional impulsive control mechanism. By means of the Lyapunov-Krasovskii functional, robust analysis approach, and some inequality processing techniques, exponential synchronization conditions unifying the continuous-time and discrete-time systems are derived on the framework of time scales. Finally, a numerical example is provided to illustrate the effectiveness of the main results.

Delay Compensation-Based State Estimation for Time-Varying Complex Networks With Incomplete Observations and Dynamical Bias

In this article, a delay-compensation-based state estimation (DCBSE) method is given for a class of discrete time-varying complex networks (DTVCNs) subject to network-induced incomplete observations (NIIOs) and dynamical bias. The NIIOs include the communication delays and fading observations, where the fading observations are modeled by a set of mutually independent random variables. Moreover, the possible bias is taken into account, which is depicted by a dynamical equation. A predictive scheme is proposed to compensate for the influences induced by the communication delays, where the predictive-based estimation mechanism is adopted to replace the delayed estimation transmissions. This article focuses on the problems of estimation method design and performance discussions for addressed DTVCNs with NIIOs and dynamical bias. In particular, a new distributed state estimation approach is presented, where a locally minimized upper bound is obtained for the estimation error covariance matrix and a recursive way is designed to determine the estimator gain matrix. Furthermore, the performance evaluation criteria regarding the monotonicity are proposed from the analytic perspective. Finally, some experimental comparisons are proposed to show the validity and advantages of the new DCBSE approach.

Distributed Intermittent Fault Detection for Linear Stochastic Systems Over Sensor Network

In this article, the problem of intermittent fault (IF) detection is investigated for linear stochastic systems over sensor networks, where the appearing and disappearing times, and magnitude of IF are all nondeterministic. By utilizing the moving-horizon estimator, a novel residual generator is designed to realize the distributed detection of IFs in sensor networks. Different from the traditional moving horizon estimation algorithms, weight matrices of the quadratic cost function in this article are regulated by an unreliability index of the prior estimate to suppress the smearing effect of IFs. In virtue of the matrix transformation method and statistical theory, estimator parameters are obtained and the detectability of a single IF is analyzed by using the residual. In order to avoid the collisions of detection results from different residuals, the global detectability condition is given for all IFs. A cooperative decision-making strategy is proposed such that the only detection result can be guaranteed, which includes the appearing and disappearing times of IFs, and the nodes suffering from IFs. Finally, an illustrative example is provided to show the feasibility and effectiveness of the derived results.

Distributed Estimation for Stochastic Hamiltonian Systems With Fading Wireless Channels

This article introduces a distributed estimator design problem for the stochastic Hamiltonian systems under fading wireless channels. The phenomenon that the channel outputs are related to the target state and the estimation of the adjacent state is considered to facilitate the implementation of distributed state estimation. Furthermore, the fixed undirected graph simplifies the analysis of the system. By resorting to fading channels and the graph theory, the main goal of the addressed problem is to design estimators to estimate the target state of the Hamiltonian system and guarantee the exponential stability in the mean-square sense of the estimation system. Based on the stochastic analysis method and the structural properties of the Hamiltonian system, sufficient conditions are obtained for the existence of the designed estimator gain for each sensor. Two examples are given to indicate the effectiveness of the theoretical claim.

A Partial-Node-Based Approach to State Estimation for Complex Networks With Sensor Saturations Under Random Access Protocol

In this article, the robust finite-horizon state estimation problem is investigated for a class of time-varying complex networks (CNs) under the random access protocol (RAP) through available measurements from only a part of network nodes. The underlying CNs are subject to randomly occurring uncertainties, randomly occurring multiple delays, as well as sensor saturations. Several sequences of random variables are employed to characterize the random occurrences of parameter uncertainties and multiple delays. The RAP is adopted to orchestrate the data transmission at each time step based on a Markov chain. The aim of the addressed problem is to design a series of robust state estimators that make use of the available measurements from partial network nodes to estimate the network states, under the RAP and over a finite horizon, such that the estimation error dynamics achieves the prescribed H_∞ performance requirement. Sufficient conditions are provided for the existence of such time-varying partial-node-based H_∞ state estimators via stochastic analysis and matrix operations. The desired estimators are parameterized by solving certain recursive linear matrix inequalities. The effectiveness of the proposed state estimation algorithm is demonstrated via a simulation example.

Genetic-Algorithm-Assisted Sliding-Mode Control for Networked State-Saturated Systems Over Hidden Markov Fading Channels

The sliding-mode control (SMC) problem is studied in this article for state-saturated systems over a class of time-varying fading channels. The underlying fading channels, whose channel fading amplitudes (characterized by the expectation and variance) are allowed to be different, are modeled as a finite-state Markov process. A key feature of the problem addressed is to use a hidden Markov mode detector to estimate the actual network mode. The novel model of hidden Markov fading channels (HMFCs) is shown to be more general yet practical than the existing fading channel models. Based on a linear sliding surface, a switching-type SMC law is dedicatedly constructed by just using the estimated network mode. By exploiting the concept of stochastic Lyapunov stability and the approach of hidden Markov models, sufficient conditions are obtained for the resultant SMC systems that ensure both the mean-square stability and the reachability with a sliding region. With the aid of the Hadamard product, a binary genetic algorithm (GA) is developed to solve the proposed SMC design problem subject to some nonconvex constraints induced by the state saturations and the fading channels, where the proposed GA is based on the objective function for optimal reachability. Finally, a numerical example is employed to verify the proposed GA-assisted SMC scheme over the HMFCs.

l₂-l∞ State Estimation for Persistent Dwell-Time Switched Coupled Networks Subject to Round-Robin Protocol

This article is concerned with the issue of l₂ - l_∞ state estimation for nonlinear coupled networks, where the variation of coupling mode is governed by a set of switching signals satisfying a persistent dwell-time property. To solve the problem of data collisions in a constrained communication network, the round-robin protocol, as an important scheduling strategy for orchestrating the transmission order of sensor nodes, is introduced. Redundant channels with signal quantization are used to improve the reliability of data transmission. The main purpose is to determine an estimator that can guarantee the exponential stability in mean square sense and an l₂ - l_∞ performance level of the estimation error system. Based on the Lyapunov method, sufficient conditions for the addressed problem are established. The desired estimator gains can be obtained by addressing a convex optimization case. The correctness and availability of the developed approach are finally explained via two illustrative examples.

Finite-Horizon H∞ State Estimation for Stochastic Coupled Networks With Random Inner Couplings Using Round-Robin Protocol

This article is concerned with the problem of finite-horizon H_∞ state estimation for time-varying coupled stochastic networks through the round-robin scheduling protocol. The inner coupling strengths of the considered coupled networks are governed by a random sequence with known expectations and variances. For the sake of mitigating the occurrence probability of the network-induced phenomena, the communication network is equipped with the round-robin protocol that schedules the signal transmissions of the sensors' measurement outputs. By using some dedicated approximation techniques, an uncertain auxiliary system with stochastic parameters is established where the multiplicative noises enter the coefficient matrix of the augmented disturbances. With the established auxiliary system, the desired finite-horizon H_∞ state estimator is acquired by solving coupled backward Riccati equations, and the corresponding recursive estimator design algorithm is presented that is suitable for online application. The effectiveness of the proposed estimator design method is validated via a numerical example.

Input-Output Finite-Time Generalized Dissipative Filter of Discrete Time-Varying Systems With Quantization and Adaptive Event-Triggered Mechanism

This article discusses the issue of input-output finite-time generalized dissipative filter design for a class of discrete time-varying systems. First, an adaptive event-triggered mechanism (AETM) with an adaptive law is proposed to adjust the threshold in the AETM according to the error between the system states and the filter states. Such an AETM determines whether the measurement output should be transmitted or not, which is more effective to economize the communication resources comparing with the traditional event-triggered mechanism. Second, in view of network-induced delays, the quantization and the AETM, a time-varying filter error system (TV-FES) is modeled. Then, a new augmented time-varying Lyapunov functional containing triple sum terms is provided. Based on the new finite-sum inequality and improved reciprocally convex combination lemma, delay-dependent conditions are obtained, which can ensure the TV-FES to be input-output finite-time stable and satisfy the given generalized dissipative performance. Moreover, the recursive linear matrix inequalities are presented to obtain the desired filter gains. Finally, numerical examples demonstrate the superiority and feasibility of the proposed method in this article.

An Event-Triggering Approach to Recursive Filtering for Complex Networks With State Saturations and Random Coupling Strengths

In this article, the recursive filtering problem is investigated for a class of time-varying complex networks with state saturations and random coupling strengths under an event-triggering transmission mechanism. The coupled strengths among nodes are characterized by a set of random variables obeying the uniform distribution. The event-triggering scheme is employed to mitigate the network data transmission burden. The purpose of the problem addressed is to design a recursive filter such that in the presence of the state saturations, event-triggering communication mechanism, and random coupling strengths, certain locally optimized upper bound is guaranteed on the filtering error covariance. By using the stochastic analysis technique, an upper bound on the filtering error covariance is first derived via the solution to a set of matrix difference equations. Next, the obtained upper bound is minimized by properly parameterizing the filter parameters. Subsequently, the boundedness issue of the filtering error covariance is studied. Finally, two numerical simulation examples are provided to illustrate the effectiveness of the proposed algorithm.

Mixed H2/H∞ State Estimation for Discrete-Time Switched Complex Networks With Random Coupling Strengths Through Redundant Channels

This article investigates the mixed H₂/H_∞ state estimation problem for a class of discrete-time switched complex networks with random coupling strengths through redundant communication channels. A sequence of random variables satisfying certain probability distributions is employed to describe the stochasticity of the coupling strengths. A redundant-channel-based data transmission mechanism is adopted to enhance the reliability of the transmission channel from the sensor to the estimator. The purpose of the addressed problem is to design a state estimator for each node, such that the error dynamics achieves both the stochastic stability (with probability 1) and the prespecified mixed H₂/H_∞ performance requirement. By using the switched system theory, an extensive stochastic analysis is carried out to derive the sufficient conditions ensuring the stochastic stability as well as the mixed H₂/H_∞ performance index. The desired state estimator is also parameterized by resorting to the solutions to certain convex optimization problems. A numerical example is provided to illustrate the validity of the proposed estimation scheme.

Scalable Distributed Filtering for a Class of Discrete-Time Complex Networks Over Time-Varying Topology

This article is concerned with the distributed filtering problem for a class of discrete complex networks over time-varying topology described by a sequence of variables. In the developed scalable filtering algorithm, only the local information and the information from the neighboring nodes are used. As such, the proposed filter can be implemented in a truly distributed manner at each node, and it is no longer necessary to have a certain center node collecting information from all the nodes. The aim of the addressed filtering problem is to design a time-varying filter for each node such that an upper bound of the filtering error covariance is ensured and the desired filter gain is then calculated by minimizing the obtained upper bound. The filter is established by solving two sets of recursive matrix equations, and thus, the algorithm is suitable for online application. Sufficient conditions are provided under which the filtering error is exponentially bounded in mean square. The monotonicity of the filtering error with respect to the coupling strength is discussed as well. Finally, an illustrative example is presented to demonstrate the feasibility and effectiveness of our distributed filtering strategy.

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

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.

Adaptive Neural Event-Triggered Control for Discrete-Time Strict-Feedback Nonlinear Systems

This paper proposes a novel event-triggered (ET) adaptive neural control scheme for a class of discrete-time nonlinear systems in a strict-feedback form. In the proposed scheme, the ideal control input is derived in a recursive design process, which relies on system states only and is unrelated to virtual control laws. In this case, the high-order neural networks (NNs) are used to approximate the ideal control input (but not the virtual control laws), and then the corresponding adaptive neural controller is developed under the ET mechanism. A modified NN weight updating law, nonperiodically tuned at triggering instants, is designed to guarantee the uniformly ultimate boundedness (UUB) of NN weight estimates for all sampling times. In virtue of the bounded NN weight estimates and a dead-zone operator, the ET condition together with an adaptive ET threshold coefficient is constructed to guarantee the UUB of the closed-loop networked control system through the Lyapunov stability theory, thereby largely easing the network communication load. The proposed ET condition is easy to implement because of the avoidance of: 1) the use of the intermediate ET conditions in the backstepping procedure; 2) the computation of virtual control laws; and 3) the redundant triggering of events when the system states converge to a desired region. The validity of the presented scheme is demonstrated by simulation results.

Distributed Robust Filtering for Wireless Sensor Networks with Markov Switching Topologies and Deception Attacks

This paper is concerned with the distributed full- and reduced-order l2-l∞ state estimation issue for a class of discrete time-invariant systems subjected to both randomly occurring switching topologies and deception attacks over wireless sensor networks. Firstly, a switching topology model is proposed which uses homogeneous Markov chain to reflect the change of filtering networks communication modes. Then, the sector-bound deception attacks among the communication channels are taken into consideration, which could better characterize the filtering network communication security. Additionally, a random variable obeying the Bernoulli distribution is used to describe the phenomenon of the randomly occurring deception attacks. Furthermore, through an adjustable parameter E, we can obtain full- and reduced-order l2-l∞ state estimator over sensor networks, respectively. Sufficient conditions are established for the solvability of the addressed switching topology-dependent distributed filtering design in terms of certain convex optimization problem. The purpose of solving the problem is to design a distributed full- and reduced-order filter such that, in the presence of deception attacks, stochastic external interference and switching topologies, the resulting filtering dynamic system is exponentially mean-square stable with prescribed l2-l∞ performance index. Finally, a simulation example is provided to show the effectiveness and flexibility of the designed approach.

Non-Fragile Robust H∞ Filtering of Takagi-Sugeno Fuzzy Networked Control Systems with Sensor Failures

The fault-tolerant robust non-fragile H∞ filtering problem for networked control systems with sensor failures is studied in this paper. The Takagi-Sugeno fuzzy model which can appropriate any nonlinear systems is employed. Based on the model, a filter which can maintain stability and H∞ performance level under the influence of gain perturbation of the filter and sensor failures is designed. Moreover, the gain matrix of sensor failures is converted into a dynamic interval to expand the range of allowed failures. And the sufficient condition for the existence of the desired filter is derived in terms of linear matrix inequalities (LMIs) solutions. Finally a simulation example is given to illustrate the effectiveness of the proposed method.