.png){kind=icon}
.png){kind=icon}
Return
A Fully Distributed Robust Secure Consensus Protocol for Linear Multi-Agent Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2022.3153698.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This brief analyzes the robust secure consensus control problem for linear multi-agent systems under random Denial-of-Service (DoS) attacks and external disturbances. When agents communicate with its neighbors, a malicious attacker randomly carries out DoS attacks to certain communication channels in the network, thereby causing the communication topology to be Markovian switching. Solely depending on the immediate partial information per node rather than global information, a fully distributed robust secure consensus protocol is put forward under DoS attacks and external disturbances by using the Lyapunov function analysis. A simulation case of leader-follower formation is taken to explain the efficiency of the consensus algorithm.
Keywords:
Topology
Denial-of-service attack
Consensus protocol
Switches
Circuits and systems
Network topology
Markov processes
Denial-of-service (DoS) attacks
distributed algorithms
Markovian switching topologies
multi-agent systems
robustness
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W