8 April 2020 in IEEE Transactions on Automatic Control
This paper considers the problem of designing physical watermark signals in order to optimally detect possible replay attack in a linear time-invariant system, under the assumption that the system parameters are unknown and need to be identified online. We first provide a replay attack model, where an adversary replays the previous sensor data in order to fool the system. A physical watermarking scheme, which leverages a random input as a watermark to detect the replay attack, is then introduced. The optimal watermark signal design problem is cast as an optimization problem, which aims to achieve the optimal trade-off between control performance and intrusion detection. An online watermarking design and system identification algorithm is provided to deal with systems with unknown parameters. We prove that the proposed algorithm converges to the optimal one and characterize the almost sure convergence rate. An industrial process example is provided to illustrate the effectiveness of the proposed strategy.
24 June 2020 in IEEE Journal of Emerging and Selected Topics in Industrial Electronics
Load shedding is usually adopted as an emergency management to cope with large frequency deviation and supply-demand imbalance in a microgrid (MG). As generators and loads are usually highly distributed in MG, distributed load shedding strategy is considered in this paper. In the proposed strategy, each agent first locally discovers the system's global knowledge. Efficient load shedding decisions are then made with the acquired information. Inspired by the fact that the communication channels are very vulnerable to malicious attacks, we further address the security issue of the considered strategy. It is assumed that an attacker intends to disrupt the information discovery procedure and further deteriorates the system operation by injecting malicious signals. By considering the injected signal as an external input with no prior knowledge, we first establish necessary and sufficient conditions for the misbehaviors to be observed. The design procedure of an unknown input observer (UIO) is then presented, based on which, a detect and isolate mechanism is developed to mitigate the negative effects. The simulation and experimental results finally validate the effectiveness of our schemes.
19 August 2020 in IEEE Transactions on Control of Network Systems
This paper considers the problem of containment control in adversarial environment, where some of the agents might be misbehaving (or faulty). Despite the influence of network misbehaviors, the normal followers aim to move into the convex hull spanned by the normal leaders. Towards this goal, resilient containment control is investigated in this work. We propose secure protocols for both first-order and second-order systems, where each normal follower ignores the most extreme values in its neighborhood and modifies its state based on the remaining ones. Assuming that the number of malicious agents is locally upper bounded, sufficient conditions on the network topology are derived to guarantee the achievement of resilient containment. Numerical examples are also provided in the end to verify our theoretical results.
19 May 2022 in IEEE Transactions on Automatic Control
This article studies the distributed state estimation in sensor network, where $m$ sensors are deployed to infer the $n$ -dimensional state of a linear time-invariant Gaussian system. By a lossless decomposition of the optimal steady-state Kalman filter, we show that the problem of distributed estimation can be reformulated as that of the synchronization of homogeneous linear systems. Based on such decomposition, a distributed estimator is proposed, where each sensor node runs a local filter using only its own measurement, alongside with a consensus algorithm to fuse the local estimate of every node. We prove that the average of local estimates from all sensors coincides with the optimal Kalman estimate, and under certain condition on the graph Laplacian matrix and the system matrix, the covariance of local estimation error is bounded and the asymptotic error covariance is derived. As a result, the distributed estimator is stable for each single node. We further show that the proposed algorithm has a low message complexity of $\min (m,n)$ . Numerical examples are provided in the end to illustrate the efficiency of the proposed algorithm.
1 January 2018 in IEEE Transactions on Signal Processing
This paper studies binary hypothesis testing based on measurements from a set of sensors, a subset of which can be compromised by an attacker. The measurements from a compromised sensor can be manipulated arbitrarily by the adversary. The asymptotic exponential rate, with which the probability of error goes to zero, is adopted to indicate the detection performance of a detector. In practice, we expect the attack on sensors to be sporadic, and therefore the system may operate with all the sensors being benign for an extended period of time. This motivates us to consider the trade-off between the detection performance of a detector, i.e., the probability of error, when the attacker is absent (defined as efficiency) and the worst-case detection performance when the attacker is present (defined as security). We first provide the fundamental limits of this trade-off, and then propose a detection strategy that achieves these limits. We then consider a special case, where there is no trade-off between security and efficiency. In other words, our detection strategy can achieve the maximal efficiency and the maximal security simultaneously. Two extensions of the secure hypothesis testing problem are also studied and fundamental limits and achievability results are provided: 1) a subset of sensors, namely “secure” sensors, are assumed to be equipped with better security countermeasures and hence are guaranteed to be benign; 2) detection performance with unknown number of compromised sensors. Numerical examples are given to illustrate the main results.
12 October 2020 in IEEE Transactions on Circuits and Systems II: Express Briefs
In this paper, we investigate the problem of resilient consensus in continuous-time second-order networks, where some nodes might be faulty or adversarial. Despite the existence of such malicious and unexpected behaviors, the normal agents still aim to reach an agreement. Towards this end, a resilient impulsive algorithm is proposed, in which the signal transmission among agents occurs with aperiodic intervals. At each sampling time, the normal agent removes the most extreme values in the neighborhood and then derives its control signal with the remaining ones. We show the influence of the malicious nodes on the normal ones would be limited by this manner. Sufficient conditions related to the network topology and tolerable number of misbehaving nodes are finally established to achieve the resilient consensus.