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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
