Volume 32, Issue 18 pp. 9997-10010
RESEARCH ARTICLE

Flocking control for Cucker–Smale model under denial-of-service attacks

Xiaoyu Shi

Xiaoyu Shi

School of Electrical Engineering and Electronic Information, Xihua University, Chengdu, China

Search for more papers by this author
Lei Shi

Corresponding Author

Lei Shi

School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China

Correspondence

Lei Shi, School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China.

Email: [email protected]

Search for more papers by this author
Yuhua Cheng

Yuhua Cheng

School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China

Search for more papers by this author
Kai Chen

Kai Chen

School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China

Search for more papers by this author
First published: 13 September 2022
Citations: 1

Funding information: China Postdoctoral Science Foundation, Grant/Award Number: 2021M700696; National Natural Science Foundation of China, Grant/Award Number: 62103080; National Postdoctoral Program for Innovative Talents, Grant/Award Number: BX2021056; Natural Science Foundation of Sichuan Province, Grant/Award Number: 2022NSFSC0878; Sichuan Science and Technology Program, Grant/Award Number: 2021YFH0042

Abstract

In this article, the issue of flocking control for Cucker–Smale model under denial-of-service (DoS) attacks is discussed. It is assumed that there is an active stage and an asleep stage for each period of the DoS. Malicious attacks partially or completely destroy the network communication links in the active stages, and replenish energy without any attacks in the dormant stages. By constructing the agents' position and velocity errors, the C–S model under DoS attacks is equivalently transformed into error systems. By applying the approach of products convergence for infinite sub-stochastic matrices, a sufficient condition for producing the flocking behavior is obtained. An upper bound of relative errors for agents' final positions is established, which depends on initial states, the topology structure and the weight function. Finally, simulation experiments verify the effectiveness of the theoretical results.

DATA AVAILABILITY STATEMENT

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.