Stochastic Denial-of-Service Attack Allocation in Leader-Following Multiagent Systems
Lucheng Sun, Ya Zhang, Changyin Sun
Abstract
In this article, an intelligent attacker is considered, which aims to prevent leader-following multiagent systems from achieving consensus. The attacker randomly injects denial-of-service (DoS) attacks to some communication channels in the network, which make the corresponding attacked edges disconnected. The minimum number of communication channels needed to be jammed by the attacker to guarantee the system fails to achieve the consensus is provided based on the Max-Flow Min-Cut lemma and an algorithm to generate the minimum attacked edges is proposed. Furthermore, a lower bound and an upper bound of the attack probability to destroy the consensusability of the system are provided, respectively. Finally, numerical simulations are given to illustrate the results.