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.
Attacks on a set of agents with cooperative and antagonistic interactions attempting to achieve linear bipartite consensus are considered here. In bipartite consensus, two clusters are formed, agents in each cluster converging to a final state which is negative of the other cluster's final state. The adversary seeks to slow down the bipartite consensus by a Denial of Service (DoS) type attack where the attacker has the capability to break a specific number of links at each time instant. The problem is formulated as an optimal control problem and the optimal strategy for the adversary is determ…
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…
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze a distributed averaging algorithm which operates exclusively with quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization…
We study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. The goal of distributed average consensus is for the nodes, each associated with some initial value, to obtain the average (or some value close to the average) of these initial values. In this paper, we present and analyze novel distributed averaging algorithms which operate exclusively on quantized values (specifically, the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantizati…
In this paper, we consider the problem of privacy preservation in the average consensus problem when communication among nodes is quantized. More specifically, we consider a setting where some nodes in the network are curious but not malicious and they try to identify the initial states of other nodes based on the data they receive during their operation (without interfering in the computation in any other way), while some nodes in the network want to ensure that their initial states cannot be inferred exactly by the curious nodes. We propose two privacy-preserving event-triggered quantized av…
Due to their flexibility, battery powered or energy-harvesting wireless networks are employed in diverse applications. Securing data transmissions between wireless devises is of critical importance in order to avoid privacy-sensitive user data leakage. In this paper, we focus on the scenario where some nodes are curious (but not malicious) and try to identify the initial states of one (or multiple) other nodes, while some nodes aim to preserve the privacy of their initial states from the curious nodes. We present a privacy preserving finite transmission event-triggered quantized average consen…
This paper is concerned with the quantized consensus problem for uncertain nonlinear multi-agent systems under data-rate constraints and Denial-of-Service (DoS) attacks. The agents are modeled in strict-feedback form with unknown nonlinear dynamics and external disturbance. Extended state observers (ESOs) are leveraged to estimate agents' total uncertainties along with their states. To mitigate the effects of DoS attacks, a novel dynamic quantization with zooming-in and holding capabilities is proposed. The idea is to zoom-in and hold the variable to be quantized if the system is in the absenc…
Composed of spatially distributed sensors and actuators that communicate through wireless networks, networked control systems are emerging as a fundamental infrastructure technology in 5G and IoT technologies, including diverse applications, such as autonomous vehicles, UAVs, and various sensing devices. In order to increase flexibility and reduce deployment and maintenance costs, many such applications consider battery-powered or energy-harvesting networks, which bring additional limitations on the energy consumption of the wireless network. Specifically, the operation of battery-powered or e…
In this paper we study the distributed average consensus problem in multi-agent systems with directed communication links that are subject to quantized information flow. Specifically, we present and analyze a distributed averaging algorithm which operates exclusively with quantized values (i.e., the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). The main idea of the proposed algori…
Distributed Optimization with Nesterov Momentum and Finite-Time Quantized Consensus
The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））；The Hong Kong University of Science and Technology（香港科技大学）；KTH Royal Institute of Technology（皇家理工学院）
Motivated by recent security issues in cyber-physical systems, this technical note studies the stabilization problem of networked control systems under Denial-of-Service (DoS) attacks. In particular, we consider to stabilize a nonlinear system with limited data rate via linearization. We employ a deterministic DoS attack model constrained in terms of attacks' frequency and duration, allowing us to cover a large class of potential attacks. To achieve asymptotic stabilization, we propose a resilient dynamic quantizer in the sense that it does not saturate in the presence of packet losses caused …
This paper studies the problem of stabilizing a self-triggered control system with quantized output. Employing a standard observer-based state feedback control law, a self-triggering mechanism that dictates the next sampling time based on quantized output is co-developed with an output encoding scheme. If, in addition, the transmission protocols at the controller-to-actuator (C-A) and sensor-to-controller (S-C) channels can be adapted, the self-triggered control architecture can be considerably simplified, leveraging a delicate observer-based deadbeat controller to eliminate the need for runni…
The University of Hong Kong（香港大学）；Shenzhen University（深圳大学）；China Academy of Space Technology（中国空间技术研究院）；University of Alberta（阿尔伯塔大学）；Texas A&M University at Qatar（德州农工大学卡塔尔分校）
This paper studies the leader-following consensuses of uncertain and nonlinear multi-agent systems against composite attacks (CAs), including Denial of Service (DoS) attacks and actuation attacks (AAs). A double-layer control framework is formulated, where a digital twin layer (TL) is added beside the traditional cyber-physical layer (CPL), inspired by the recent Digital Twin technology. Consequently, the resilient control task against CAs can be divided into two parts: One is distributed estimation against DoS attacks on the TL and the other is resilient decentralized tracking control against…
Networked microgrids with high penetration of distributed generators have ubiquitous remote information exchange, which may be exposed to various cyber security threats. This paper, for the first time, addresses a consensus problem in terms of frequency synchronisation in networked microgrids subject to multi-layer denial of service (DoS) attacks, which could simultaneously affect communication, measurement and control actuation channels. A unified notion of Persistency-of-Data-Flow (PoDF) is proposed to characterise the data unavailability in different information network links, and further q…
Data Rate for Distributed Consensus of Multi-agent Systems with High Order Oscillator Dynamics
School of Electrical and Electronic Engineering, Nanyang Technological University（南洋理工大学电气与电子工程学院）；Key Laboratory of Systems and Control, Institute of Systems Science, Chinese Academy of Sciences（中国科学院系统科学研究所系统与控制系统重点实验室）
Blockchain has recently been depicted as a secure protocol for information exchange in cyber-physical microgrids. However, it is still found vulnerable to consensus manipulation attacks. These stealth attacks are often difficult to detect as they use kernel-level access to mask their actions. In this paper, we firstly build a trusted and secured peer-to-peer network mechanism for physical DC microgrids' validation of transactions over Distributed Ledger. Secondly, we leverage from a physics-informed approach for detecting malware-infected nodes and then recovering from stealth attacks using a …
Distributed Coordination Algorithms with Efficient Communication for Open Multi-Agent Systems with Dynamic Communication Links and Processing Delays: Extended Version
We study the so-called distributed two-time-scale gradient method for solving convex optimization problems over a network of agents when the communication bandwidth between the nodes is limited, and so information that is exchanged between the nodes must be quantized. Our main contribution is to provide a novel analysis, resulting to an improved convergence rate of this method as compared to the existing works. In particular, we show that the method converges at a rate $O(log_2 k/\sqrt k)$ to the optimal solution, when the underlying objective function is strongly convex and smooth. The key te…
