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

Optimized Distributed Filtering for Saturated Systems With Amplify-and-Forward Relays Over Sensor Networks: A Dynamic Event-Triggered Approach

In this article, the optimized distributed filtering problem is studied for a class of saturated systems with amplify-and-forward (AF) relays via a dynamic event-triggered mechanism (DETM). The AF relays are located in the channels between sensors and filters to prolong the transmission distance of signals, where the transmission powers of sensors and relays can be described by a sequence of random variables with a known probability distribution. With the purpose of alleviating the communication burden and preventing data collision, the DETM is used to schedule the transmission cases of nodes by dynamically adjusting the triggered threshold according to the practical requirements. An upper bound matrix (UBM) of the filtering error (FE) covariance is first provided under the sense of variance constraint and the proper filter gain is further constructed via minimizing the proposed UBM. In addition, the boundedness evaluation regarding the trace of the UBM is provided. Finally, simulation experiments are used to illustrate the usefulness of the developed distributed recursive filtering scheme.

Nonfragile output-feedback control for switched singular positive systems with time-varying delay under the Round-Robin protocol

This paper investigates a class of switched singular positive systems with time-varying delay, where the system parameters are uncertain. In order to decrease the consumption of the communication resources and avoid the phenomenon of data congestion, Round-Robin protocol is employed here. This is the first few attempts to introduce the Round-Robin protocol for such kind of positive systems. Moreover, the nonfragile controller is designed to suppress the undesired dynamical behaviors, which may occur if no control is implemented. By means of the matrix decomposition technique and the mode-dependent average dwell time method, sufficient conditions are established to ensure that the obtained closed-loop system has a prescribed l1 disturbance attenuation performance. Finally, three examples are presented to illustrate feasibility and effectiveness of the proposed control scheme.

Distributed H∞ filtering of replay attacks over sensor networks

A distributed H∞ filtering issue is addressed in this paper for discrete-time nonlinear systems in the face of replay attacks over sensor networks, where an indicator variable is introduced to describe whether a replay attack is launched by the adversaries. First, an interesting pattern dependent on three parameters including a time-varying one is established to account for the temporal behavior of malicious attacks. Then, taking advantage of such a model, the resulting filter dynamic is transformed into a switching system with a subsystem with time-varying delays. By means of the famous switching system theory, a sufficient condition guaranteeing the H∞ performance is derived to disclose the tolerant attack condition, that is, the attack-active duration and proportion. In addition, the applicable filter gains are achieved with the aid of the solutions of matrix inequalities. Finally, an example is purposively given to adequately illustrate the availability of the developed secure filtering strategy.

Measurement outlier-resistant mobile robot localization using multiple Doppler-azimuth radars under round-robin protocol

This paper is concerned with the measurement outlier-resistant mobile robot localization problem by using multiple Doppler-azimuth radars under round-robin protocol (R-RP). In the considered robot localization system, multiple Doppler-azimuth radars are equipped on the robot platform to produce the measurement including the Doppler frequency shift and the azimuth. In order to assuage communication link congestion, the R-RP is used. For mitigating the influence of outliers, a time-varying state estimator is constructed which contains a saturation function with variable saturation levels. This paper aims at seeking out a practicable yet effective solution to the addressed robot localization problem by devising the constructed estimator which can assure that, over a finite horizon, the localization error satisfies the given H_∞ performance index. By constructing an appropriate Lyapunov function, the sufficient condition, which can guarantee the localization error to fulfill the given H_∞ performance, is established. Then, by resorting to the solution to a set of linear matrix inequalities, the constructed estimator can be devised. In the light of the estimator design strategy proposed in this paper, the corresponding robot localization algorithm is developed. At last, some simulations are conducted to testify the usefulness of the developed robot localization algorithm.

State Estimation for Discrete Time-Delayed Impulsive Neural Networks Under Communication Constraints: A Delay-Range-Dependent Approach

In this article, a delay-range-dependent approach is put forward to tackle the state estimation problem for delayed impulsive neural networks. A new type of nonlinear function, which is more general than the normal sigmoid function and functions constrained by the Lipschitz condition, is adopted as the neuron activation function. To effectively alleviate data collisions and save energy, the round-robin protocol is utilized to mitigate the occurrence of unnecessary network congestion in communication channels from sensors to the estimator. With the aid of the Lyapunov stability theory, a state observer is constructed such that the estimation error dynamics are asymptotically stable. The observer existence is ensured by resorting to a set of delay-range-dependent criteria which is dependent on both the impulsive time instant and a coefficient matrix. In addition, the synthesis of the observer is discussed by using linear matrix inequalities. Simulations are provided to illustrate the reasonability of our delay-range-dependent estimation approach.

A Near-Optimal Energy Management Mechanism Considering QoS and Fairness Requirements in Tree Structure Wireless Sensor Networks

The rapid development of AIOT-related technologies has revolutionized various industries. The advantage of such real-time sensing, low costs, small sizes, and easy deployment makes extensive use of wireless sensor networks in various fields. However, due to the wireless transmission of data, and limited built-in power supply, controlling energy consumption and making the application of the sensor network more efficient is still an urgent problem to be solved in practice. In this study, we construct this problem as a tree structure wireless sensor network mathematical model, which mainly considers the QoS and fairness requirements. This study determines the probability of sensor activity, transmission distance, and transmission of the packet size, and thereby minimizes energy consumption. The Lagrangian Relaxation method is used to find the optimal solution with the lowest energy consumption while maintaining the network's transmission efficiency. The experimental results confirm that the decision-making speed and energy consumption can be effectively improved.

H∞ Proportional-Integral State Estimation for T-S Fuzzy Systems Over Randomly Delayed Redundant Channels With Partly Known Probabilities

In this article, we consider the H_∞ proportional-integral (PI) state estimation (SE) problem for discrete-time T-S fuzzy systems subject to transmission delays, external disturbances, and redundant channels. Multiple redundant communication channels are utilized between the sensors and the remote estimator to enhance the reliability of data transmissions. In order to characterize the transmission delays in network-based communication, a family of random variables with partly known probabilities, which are independent and identically distributed, is adopted to describe the random behavior of the transmission delays with the redundant channels. The objective of this work is to put forward a PI state estimator such that the dynamics of the estimation error is exponentially mean-square stable and satisfies the prescribed H_∞ performance index of the disturbance attenuation/rejection. By employing the stochastic analysis approach, the error dynamics of the SE under the proposed state estimator is analyzed and sufficient conditions are obtained to ensure the existence of the required PI state estimator. Furthermore, the desired estimator parameters are derived by solving a nonlinear optimization problem. Finally, two simulation examples are exploited to demonstrate the validity of the proposed SE scheme.

On Consensus of Second-Order Multiagent Systems With Actuator Saturations: A Generalized-Nyquist-Criterion-Based Approach

In this article, a frequency-domain approach is developed to deal with the global consensus problem for a class of general second-order multiagent systems (MASs) subject to actuator saturations. By employing the describing function and the generalized Nyquist criterion, the global consensus problem is thoroughly investigated for both undirected and directed topologies. First, the describing function is introduced to characterize the actuator saturations in the s -plane, and the inherent representation error is quantitatively analyzed from a frequency-domain perspective. Then, by means of the Kronecker product, the addressed consensus problem of the MAS is transformed into a corresponding stability analysis problem for a certain multi-input-multi-output (MIMO) system and, consequently, the generalized Nyquist criterion for MIMO systems is exploited to derive the condition for the global consensus of the MAS where the impact from the actuator saturation is explicitly reflected. Finally, numerical simulations are provided to illustrate the validity of the proposed theoretical result.

Resilient Event-Triggered Distributed State Estimation for Nonlinear Systems Against DoS Attacks

This article investigates the resilient event-triggered (ET) distributed state estimation problem for nonlinear systems under denial-of-service (DoS) attacks. Different from the existing results mainly considering linear or specified nonlinear systems, more general nonlinear systems are considered in this study. Moreover, the considered DoS attacks are able to compromise different communication links among estimators independently. In this context, by resorting to the techniques of incremental homogeneity, a nonlinear ET distributed estimation scheme is designed to estimate the states and regulate the data transmission. Under this scheme, the resilient state estimation is achieved by employing a multimode switching estimator, and the problem of efficiency loss of the ET mechanism caused by DoS attacks is solved by designing a dynamic trigger threshold with switched update laws. Then, based on the decay rates of the Lyapunov function corresponding to different communication modes, sufficient conditions are given to guarantee the stability of the estimation error system under DoS attacks. Finally, simulation results are provided to verify the effectiveness of the proposed method.

Distributed Quasiconsensus Control for Stochastic Multiagent Systems Under Round-Robin Protocol and Uniform Quantization

In this article, the problem of consensus control is investigated for a class of multiagent systems (MASs) with both stochastic noises and nonidentical exogenous disturbances. The signal transmission among agents is implemented through a digital communication network subject to both uniform quantization and round-robin protocol as a reflection of network constraints. The consensus strategy is designed by adopting the estimates of the relative states of the agent to its neighbors, which renders the distributed nature of the controller. A new consensus concept, namely, quasiconsensus in probability, is employed to evaluate the state response of the agents to the stochastic noises, the exogenous disturbances, and the quantization error. An augmented system is first formed that relies on the deviations of the individual state from the average state, the observer error of the relative state, as well as the relative measurement output. Based on the augmented model, an analysis approach on dynamical behaviors is developed to facilitate the consensus analysis of MASs by means of the switching Lyapunov function technique and the stochastic analysis methods. Then, the existence condition and the explicit expression of the time-varying gain matrices are proposed for the expected controller by resorting to the feasibility of several matrix inequalities. Numerical simulation results are presented to demonstrate the applicability of the theoretical results.

Integrated Channel-Aware Scheduling and Packet-Based Predictive Control for Wireless Cloud Control Systems

The scheduling and control of wireless cloud control systems involving multiple independent control systems and a centralized cloud computing platform are investigated. For such systems, the scheduling of the data transmission as well as some particular design of the controller can be equally important. From this observation, we propose a dual channel-aware scheduling strategy under the packet-based model predictive control framework, which integrates a decentralized channel-aware access strategy for each sensor, a centralized access strategy for the controllers, and a packet-based predictive controller to stabilize each control system. First, the decentralized scheduling strategy for each sensor is set in a noncooperative game framework and is then designed with asymptotical convergence. Then, the central scheduler for the controllers takes advantage of a prioritized threshold strategy, which outperforms a random one neglecting the information of the channel gains. Finally, we prove the stability for each system by constructing a new Lyapunov function, and further reveal the dependence of the control system stability on the prediction horizon and successful access probabilities of each sensor and controller. These theoretical results are successfully verified by numerical simulation.

Received Signal Strength Indicator-Based Indoor Localization Using Distributed Set-Membership Filtering

Most of the existing localization schemes necessitate a priori statistical characteristic of measurement noise, which may be unrealistic in practical applications. This article addresses the problem of indoor localization by implementing distributed set-membership filtering based on a received signal strength indicator (RSSI) under unknown-but-bounded process and measurement noises. First, the transmit power and the path-loss exponent are estimated by a novel least-squares curve fitting (LSCF) method in RSSI-based localization. Since the localization process of trilateration is susceptible to inaccuracy caused by the noise-affected distance measurements, a convex optimization method is then developed to obtain the state ellipsoid estimation under the unknown-but-bounded noises. Third, a recursive algorithm is established to compute the global ellipsoid that guarantees to locate the true target at every time step. Finally, experimental validation is presented to demonstrate the accuracy and effectiveness of the proposed set-membership filtering method for indoor localization.

Finite-Time H∞ State Estimation for Two-Time-Scale Complex Networks Under Stochastic Communication Protocol

The issue of finite-time H_∞ state estimation is studied for a class of discrete-time nonlinear two-time-scale complex networks (TTSCNs) whose measurement outputs are transmitted to a remote estimator via a bandwidth-limited communication network under the stochastic communication protocol (SCP). To reflect different time scales of state evolutions, a new discrete-time TTSCN model is devised by introducing a singular perturbation parameter (SPP). For the sake of avoiding/alleviating the undesirable data collisions, the SCP is adopted to schedule the data transmissions, where the transition probabilities involved are assumed to be partially unknown. By constructing a new Lyapunov function dependent on the information of the SCP and SPP, a sufficient condition is derived which ensures that the resulting error dynamics is stochastically finite-time bounded and satisfies a prescribed H_∞ performance index. By resorting to the solutions of several matrix inequalities, the gain matrices of the state estimator are given and the admissible upper bound of the SPP can be evaluated simultaneously. The performance of the designed state estimator is demonstrated by two examples.

Outlier-Resistant Recursive Filtering for Multisensor Multirate Networked Systems Under Weighted Try-Once-Discard Protocol

In this article, a new outlier-resistant recursive filtering problem (RF) is studied for a class of multisensor multirate networked systems under the weighted try-once-discard (WTOD) protocol. The sensors are sampled with a period that is different from the state updating period of the system. In order to lighten the communication burden and alleviate the network congestions, the WTOD protocol is implemented in the sensor-to-filter channel to schedule the order of the data transmission of the sensors. In the case of the measurement outliers, a saturation function is employed in the filter structure to constrain the innovations contaminated by the measurement outliers, thereby maintaining satisfactory filtering performance. By resorting to the solution to a matrix difference equation, an upper bound is first obtained on the covariance of the filtering error, and the gain matrix of the filter is then characterized to minimize the derived upper bound. Furthermore, the exponential boundedness of the filtering error dynamics is analyzed in the mean square sense. Finally, the usefulness of the proposed outlier-resistant RF scheme is verified by simulation examples.

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.

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.

Event-Triggering State and Fault Estimation for a Class of Nonlinear Systems Subject to Sensor Saturations

This paper is concerned with the state and fault estimation issue for nonlinear systems with sensor saturations and fault signals. For the sake of avoiding the communication burden, an event-triggering protocol is utilized to govern the transmission frequency of the measurements from the sensor to its corresponding recursive estimator. Under the event-triggering mechanism (ETM), the current transmission is released only when the relative error of measurements is bigger than a prescribed threshold. The objective of this paper is to design an event-triggering recursive state and fault estimator such that the estimation error covariances for the state and fault are both guaranteed with upper bounds and subsequently derive the gain matrices minimizing such upper bounds, relying on the solutions to a set of difference equations. Finally, two experimental examples are given to validate the effectiveness of the designed algorithm.

Proportional-Integral Observer Design for Multidelayed Sensor-Saturated Recurrent Neural Networks: A Dynamic Event-Triggered Protocol

In this article, the design problem of the proportional-integral observer (PIO) is investigated for a class of discrete-time multidelayed recurrent neural networks (RNNs). In the addressed RNN model, the delays occurring in the information interconnections are allowed to be different, and the phenomenon of sensor saturation is taken into consideration in the measurement model. A novel dynamic event-triggered protocol is employed in the data transmission from sensors to the observer with hope to improve the efficiency of resource utilization, where the threshold parameters are adaptive to the dynamical environment. By virtue of the Lyapunov-like approach, a general framework is established for examining the boundedness of the estimation errors in mean-square sense, and the ultimate bound of the error dynamics is also acquired. Subsequently, the explicit expression of the desired PIO is parameterized by using the matrix inequality techniques. Finally, a simulation example is utilized to verify the effectiveness and superiority of the proposed PIO design scheme.

H∞ and l2-l∞ state estimation for delayed memristive neural networks on finite horizon: The Round-Robin protocol

In this paper, a protocol-based finite-horizon H_∞ and l₂-l_∞ estimation approach is put forward to solve the state estimation problem for discrete-time memristive neural networks (MNNs) subject to time-varying delays and energy-bounded disturbances. The Round-Robin protocol is utilized to mitigate unnecessary network congestion occurring in the sensor-to-estimator communication channel. For the delayed MNNs, our aim is to devise an estimator that not only ensures a prescribed disturbance attenuation level over a finite time-horizon, but also keeps the peak value of the estimation error within a given range. By resorting to the Lyapunov-Krasovskii functional method, the delay-dependent criteria are formulated that guarantee the existence of the desired estimator. Subsequently, the estimator gains are obtained via figuring out a bank of convex optimization problems. The validity of our estimator is finally shown via a numerical example.