A Jamming-Resilient Algorithm for Self-Triggered Network Coordination

Senejohnny, Danial; Tesi, Pietro; Persis, Claudio De

doi:10.1109/tcns.2017.2668901

Cited by 108 publications

(68 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Wang consensus. It is also remarked that, as a different class of cyber attacks, the effects of jamming and DoS attacks on multi-agent consensus have recently been analyzed in [13], [28].…”

Section: Introductionmentioning

confidence: 99%

Resilient Consensus Through Event-Based Communication

Wang

Ishii

2020

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

We consider resilient versions of discrete-time multiagent consensus in the presence of faulty or even malicious agents in the network. In particular, we develop event-triggered update rules which can mitigate the influence of the malicious agents and at the same time reduce the communication. Each regular agent updates its state based on a given rule using its neighbors' information. Only when the triggering condition is satisfied, the regular agents send their current states to their neighbors. Otherwise, the neighbors will continue to use the state received the last time. Assuming that a bound on the number of malicious nodes is known, we propose two update rules with event-triggered communication. They follow the socalled mean subsequence reduced (MSR) type algorithms and ignore values received from potentially malicious neighbors. We characterize the necessary connectivity in the network for the algorithms to perform correctly, which are stated in terms of the notion of graph robustness. A numerical example is provided to demonstrate the effectiveness of the proposed approach.

show abstract

“…Wang consensus. It is also remarked that, as a different class of cyber attacks, the effects of jamming and DoS attacks on multi-agent consensus have recently been analyzed in [13], [28].…”

Section: Introductionmentioning

confidence: 99%

Resilient Consensus Through Event-Based Communication

Wang

Ishii

2020

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

“…Security of CPS is no longer restricted to the cyber domain, and recent incidents such as the StuxNet malware [20] and the security flaws reported on modern cars [13,19] motivated the recent interest in security of CPS, (see for example, [1,6,26,41] and references therein). During the last decade, a number of security problems have been tackled by the control community, e.g., denial-of-service [8,14,34,45], replay attacks [27], man-in-the-middle attacks [40], false data injection [25], etc. This paper addresses the problem of state estimation when several sensors and actuators are under attack.…”

Section: Introductionmentioning

confidence: 99%

Securing state reconstruction under sensor and actuator attacks: Theory and design

et al. 2020

View full text Add to dashboard Cite

This paper discusses the problem of estimating the state of a linear time invariant system when some of its sensors and actuators are compromised by an adversarial agent. In the model considered in this paper, the malicious agent attacks an input (output) by manipulating its value arbitrarily, i.e., we impose no constraints (statistical or otherwise) on how control commands (sensor measurements) are changed by the adversary. In the first part of this paper, we introduce the notion of sparse strong observability and we show that is a necessary and sufficient condition for correctly reconstructing the state despite the considered attacks. In the second half of this work, we propose an estimator to harness the complexity of this intrinsically combinatorial problem, by leveraging satisfiability modulo theory solving. Numerical simulations demonstrate the effectiveness and scalability of our estimator.

show abstract

“…The works (Sundaram and Hadjicostis, 2011;Pasqualetti et al, 2012) proposed a different approach to detect and identify malicious agents, which is based on observability and reconstruction of the initial conditions. Other complementary approaches to the problem include adding trusted agents (Abbas et al, 2018) and designing self-triggered control strategies (Senejohnny et al, 2018).…”

Section: Introductionmentioning

confidence: 99%

Resilient consensus for multi-agent systems subject to differential privacy requirements

Fiore

Russo

2019

Automatica

View full text Add to dashboard Cite

We consider multi-agent systems interacting over directed network topologies where a subset of agents is adversary/faulty and where the non-faulty agents have the goal of reaching consensus, while fulfilling a differential privacy requirement on their initial conditions. To address this problem, we develop an update law for the non-faulty agents. Specifically, we propose a modification of the so-called Mean-Subsequence-Reduced (MSR) algorithm, the Differentially Private MSR (DP-MSR) algorithm, and characterize three important properties of the algorithm: correctness, accuracy and differential privacy. We show that if the network topology is (2f + 1)-robust, then the algorithm allows the non-faulty agents to reach consensus despite the presence of up to f faulty agents and we characterize the accuracy of the algorithm. Furthermore, we also show in two important cases that our distributed algorithm can be tuned to guarantees differential privacy of the initial conditions and the differential privacy requirement is related to the maximum network degree. The results are illustrated via simulations.

show abstract

A Jamming-Resilient Algorithm for Self-Triggered Network Coordination

Cited by 108 publications

References 26 publications

Resilient Consensus Through Event-Based Communication

Resilient Consensus Through Event-Based Communication

Securing state reconstruction under sensor and actuator attacks: Theory and design

Resilient consensus for multi-agent systems subject to differential privacy requirements

Contact Info

Product

Resources

About