690 research outputs found
Performance analysis with network-enhanced complexities: On fading measurements, event-triggered mechanisms, and cyber attacks
Copyright © 2014 Derui Ding et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.Nowadays, the real-world systems are usually subject to various complexities such as parameter uncertainties, time-delays, and nonlinear disturbances. For networked systems, especially large-scale systems such as multiagent systems and systems over sensor networks, the complexities are inevitably enhanced in terms of their degrees or intensities because of the usage of the communication networks. Therefore, it would be interesting to (1) examine how this kind of network-enhanced complexities affects the control or filtering performance; and (2) develop some suitable approaches for controller/filter design problems. In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered mechanisms, and attack behaviors of adversaries. First, these three kinds of complexities are introduced in detail according to their engineering backgrounds, dynamical characteristic, and modelling techniques. Then, the developments of the performance analysis and synthesis issues for various networked systems are systematically reviewed. Furthermore, some challenges are illustrated by using a thorough literature review and some possible future research directions are highlighted.This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Resilient Control under Denial-of-Service
We investigate resilient control strategies for linear systems under
Denial-of-Service (DoS) attacks. By DoS attacks we mean interruptions of
communication on measurement (sensor-to-controller) and/or control
(controller-to-actuator) channels carried out by an intelligent adversary. We
characterize the duration of these interruptions under which stability of the
closed-loop system is preserved. The resilient nature of the control descends
from its ability to adapt the sampling rate to the occurrence of the DoS.Comment: 10 pages, abridged version submitte
Towards Stabilization of Distributed Systems under Denial-of-Service
In this paper, we consider networked distributed systems in the presence of
Denial-of-Service (DoS) attacks, namely attacks that prevent transmissions over
the communication network. First, we consider a simple and typical scenario
where communication sequence is purely Round-robin and we explicitly calculate
a bound of attack frequency and duration, under which the interconnected
large-scale system is asymptotically stable. Second, trading-off system
resilience and communication load, we design a hybrid transmission strategy
consisting of Zeno-free distributed event-triggered control and Round-robin. We
show that with lower communication loads, the hybrid communication strategy
enables the systems to have the same resilience as in pure Round-robin
Dynamic Quantized Consensus of General Linear Multi-agent Systems under Denial-of-Service Attacks
In this paper, we study multi-agent consensus problems under
Denial-of-Service (DoS) attacks with data rate constraints. We first consider
the leaderless consensus problem and after that we briefly present the analysis
of leader-follower consensus. The dynamics of the agents take general forms
modeled as homogeneous linear time-invariant systems. In our analysis, we
derive lower bounds on the data rate for the multi-agent systems to achieve
leaderless and leader-follower consensus in the presence of DoS attacks, under
which the issue of overflow of quantizer is prevented. The main contribution of
the paper is the characterization of the trade-off between the tolerable DoS
attack levels for leaderless and leader-follower consensus and the required
data rates for the quantizers during the communication attempts among the
agents. To mitigate the influence of DoS attacks, we employ dynamic
quantization with zooming-in and zooming-out capabilities for avoiding
quantizer saturation
Quantized State Feedback Stabilization of Nonlinear Systems under Denial-of-Service
This paper studies the resilient control of networked systems in the presence of cyber attacks. In particular, we consider the state feedback stabilization problem for nonlinear systems when the state measurement is sent to the controller via a communication channel that only has a finite transmitting rate and is moreover subject to cyber attacks in the form of Denial-of-Service (DoS). We use a dynamic quantization method to update the quantization range of the encoder/decoder and characterize the number of bits for quantization needed to stabilize the system under a given level of DoS attacks in terms of duration and frequency. Our theoretical result shows that under DoS attacks, the required data bits to stabilize nonlinear systems bv state feedback control are larger than those without DoS since the communication interruption induced by DoS makes the quantization uncertainty expand more between two successful transmissions
- …