Stealthy attacks in power systems: Limitations on manipulating the estimation deviations caused by switching network topologies

Author(s):  
Shaocheng Wang ◽  
Wei Ren
2019 ◽  
Vol 26 (1) ◽  
pp. 145-152
Author(s):  
Liyuan Wang ◽  
Wei Yue ◽  
Rubo Zhang

Abstract This paper is concerned with sampled-data leader following consensus of multiple unmanned surface vehicle (MUSV) systems with random switching network topologies and wave-induced disturbance. By modelling the switching of network topologies with the use of a Markov process and considering the effect of wave-induced disturbance, a new sampled-data consensus control protocol is proposed. By employing an appropriate Lyapunov-Krosovskii function method and the weak infinitesimal operation, a novel stability criterion is derived, which ensures that the MUSV system can reach robustly leader-following consensus with H∞ performance satisfied. Based on this criterion, the Markov dependent switching consensus controller gains are obtained by solving a set of linear matrix inequalities. Finally, an illustrative example is given to verify the effectiveness of the proposed control scheme for MUSV systems.


2020 ◽  
pp. 1-38
Author(s):  
Jiu-Gang Dong ◽  
Seung-Yeal Ha ◽  
Doheon Kim

We study the emergent dynamics of the thermomechanical Cucker–Smale (TCS) model with switching network topologies. The TCS model is a generalized CS model with extra internal dynamical variable called “temperature” in which isothermal case exactly coincides with the CS model for flocking. In previous studies, emergent dynamics of the TCS model has been mostly restricted to some static network topologies such as complete graph, connected graph with positive in and out degrees at each node, and digraphs with spanning trees. In this paper, we consider switching network topologies with a spanning tree in a sequence of time-blocks, and present two sufficient frameworks leading to the asymptotic mono-cluster flocking in terms of initial data and system parameters. In the first framework in which the sizes of time-blocks are uniformly bounded by some positive constant, we show that temperature and velocity diameters tend to zero exponentially fast, and spatial diameter is uniformly bounded. In the second framework, we admit a situation in which the sizes of time-blocks may grow mildly by a logarithmic function. In latter framework, our temperature and velocity diameters tend to zero at least algebraically slow.


Author(s):  
Qing Guo ◽  
Zhenlei Chen ◽  
Dan Jiang

Abstract A leader-following quasi-synchronization control is proposed in multiple electrohydraulic actuators (MEHAs) under different switching network topologies to guarantee the follower electrohydraulic actuators (EHAs) tracking the leader motion. Firstly, each electro-hydraulic actuator (EHA) has a 3-order nonlinear dynamics with unknown external load. Then by using Lie derivative technique, the MEHAs nonlinear models with $n+1$ nodes are feedback linearized for convenient control design. Furthermore, the leader node is constructed as a virtual simulation model to be stabilized by PI controller. Meanwhile, a quasi-synchronized controller together with a disturbance observer is designed by LMI and Lyapunov techniques to guarantee that the synchronization errors between the n follower nodes and the leader node 0 are uniformly ultimate boundaries. Finally, the effectiveness of the leader-following quasi-synchronized controller is verified by a MEHAs experimental bench with 3 EHAs under switching network topologies.


2019 ◽  
Vol 214 ◽  
pp. 08013
Author(s):  
Andrey Baginyan ◽  
Vladimir Korenkov ◽  
Andrey Dolbilov ◽  
Ivan Kashunin

The article presents a hierarchical diagram of the network farm and a model of the network architecture levels. Protocols for disposal full mesh network topologies are considered. Modern data transfer protocol TRILL is presented. Its advantages are analysed in comparison with other possible protocols that may be used in the full-mesh topology. Empirical calculations of data routing based on a Dijkstra's algorithm and a patent formula of the TRILL protocol are given. Two monitoring systems of downloading data channels are described. The data obtained from 40G interfaces through each monitoring systems is presented, and their behaviour is analysed. The main result is that the discrepancy of experimental data with theoretical predictions to be equal to the weight balancing of the traffic when transmitting the batch information over the equivalent edges of the graph. It is shown that the distribution of the traffic over such routes is of arbitrary and inconsistent with the patent formula character. The conclusion analyses issues of the traffic behaviour under extreme conditions.


Sign in / Sign up

Export Citation Format

Share Document