24 October 2018 in IEEE Transactions on Neural Networks and Learning Systems
This paper studies the synchronization issue of time-varying Markovian jump neural networks (NNs). The denial-of-service (DoS) attack is considered in the communication channel connecting master NNs and slave NNs. An observer is designed based on the measurements of master NNs transmitted over this unreliable channel to estimate their states. The deception attack is used to destroy the controller by changing the sign of the control signal. Then, the mixed-type attacks are expressed uniformly, and a synchronization error system is established using this function. A finite-horizon l2-l∞ performance is proposed, and sufficient conditions are derived to ensure that the synchronization error system satisfies this performance. The controllers are then obtained by a recursive linear matrix inequality algorithm. At last, a simulation result to show the feasibility of the developed results is given.
15 March 2022 in IEEE Transactions on Automatic Control
This paper is concerned with the distributed filtering issue for linear discrete-time systems under bounded noises and constrained bit rate over wireless sensor networks. A bit rate constraint, which is subject to the so-called bandwidth allocation strategy, is placed to quantify the effect of the network bandwidth on the distributed filtering performance. An improved coding-decoding procedure is proposed to enable each node to decode messages from its neighbor nodes. Based on this procedure, a decoded-innovation-based distributed filtering scheme is put forward and a sufficient condition is established to ensure that the filtering error dynamics is ultimately bounded. Subsequently, a relationship between the bit rate and certain specific filtering performance is discovered. The desired parameters of the distributed filter are determined via solving two optimization problems whose objectives are actually the filtering performance indices including the smallest ultimate bound and the fastest decay rate. Furthermore, the co-design issue of the bit rate allocation protocol and the filter gain is converted into the mixed integer nonlinear programming problem.
27 April 2021 in IEEE Transactions on Network Science and Engineering
In this paper, the partial-nodes-based (PNB) state estimation issue is investigated for a class of discrete-time complex networks with constrained bit rate and bounded noises. Measurements from only a fraction of nodes in a complex network are acquired and used for state estimation. The communication between sensor nodes and estimators is accomplished over a wireless digital communication network with limited bandwidth. A bit rate constraint model is introduced to reflect the bandwidth allocation rules of partially accessible nodes. A sufficient condition is proposed under which the PNB state estimation error system is guaranteed to be ultimately bounded, and then a bit rate condition assuring a specific estimation performance is presented. The estimator gains are derived by solving two optimization problems in order to ensure two estimation performance metrics (i.e. the smallest ultimate bound and the fastest decay rate). Furthermore, the co-design issue of the bit rate allocation protocol and the estimator gains is addressed by means of particle swarm optimization and linear matrix inequalities. Finally, three numerical simulations are provided to verify the validity of the proposed PNB state estimation approach.
24 February 2019 in IEEE Transactions on Cybernetics
This paper studies the distributed state estimator design method for periodic systems with time-varying delays and periodic communication scheduling strategy over sensor networks. To mitigate the stability attenuation and the performance loss caused by delays, a periodic delay-dependent Lyapunov function is constructed, which relaxes the conservatism and improves the ${H_\infty }$ performance of the estimators. Then, a periodic scheduling strategy, which updates the correlative innovations of each node during a period in an average way by solving an integer programming problem, is proposed to save energy. Periodic gains of distributed estimators are designed by using analog tool. Finally, a visual example is utilized to describe the periodic communication scheduling. The effectiveness of the strategy and the novel Lyapunov function is demonstrated by the example.
8 September 2021 in IEEE Transactions on Neural Networks and Learning Systems
In this article, the cluster synchronization control problem is studied for discrete-time complex dynamical networks when the data transmission is subject to constrained bit rate. A bit-rate model is presented to quantify the limited network bandwidth, and the effects from the constrained bit rate onto the control performance of the cluster synchronization are evaluated. A sufficient condition is first proposed to guarantee the ultimate boundedness of the error dynamics of the cluster synchronization, and then, a bit-rate condition is established to reveal the fundamental relationship between the bit rate and the certain performance index of the cluster synchronization. Subsequently, two optimization problems are formulated to design the desired synchronization controllers with aim to achieve two distinct synchronization performance indices. The codesign issue for the bit-rate allocation protocol and the controller gains is further discussed to reduce the conservatism by locally minimizing a certain asymptotic upper bound of the synchronization error dynamics. Finally, three illustrative simulation examples are utilized to validate the feasibility and effectiveness of the developed synchronization control scheme.
25 October 2023 in IEEE Transactions on Automatic Control
This paper studies the optimal transmission scheduling for remote state estimation over multi-hop networks. A smart sensor observes a dynamic system, and sends its local state estimate to a remote estimator (RE). To save energy, multi-hop networks are deployed to relay data packets from the smart sensor to the RE. The smart sensor needs to decide the hop number communicating with the RE by adjusting its transmission power. To minimize the estimation error and the energy consumption, the transmission scheduling is formulated as a modified Markov decision process (MDP) by incorporating historical actions into the state. A sufficient condition is constructed to guarantee that the MDP has an optimal deterministic and stationary policy. The optimal policy's structure is further obtained to reduce the computation complexity. A deep reinforcement learning (DRL) algorithm, i.e., dueling double Q-network (D3QN), is introduced to obtain a near-optimal policy. Finally, a simulation example is provided to illustrate the developed results.