Event-triggered bipartite consensus over cooperation-competition networks under DoS attacks

Abstract

This paper addresses the bipartite consensus over cooperation-competition networks affected by denial-of-service (DoS) attacks. Consider that a network consists of multiple interactive agents, and the relationship between neighboring agents is cooperative or competitive. Meanwhile, information transmission among the agents is unavailable during the intervals of attacks. In order to save communication resources and exclude the Zeno behavior, an event-triggered scheme depending on the sampled-data information from neighboring agents is proposed, and efficient defense strategies in response to the attacks are put forward. Suppose that the frequency and duration of DoS attacks meet certain requirements, then according to the signed graph theory, the LaSalle’s invariance principle, and the convergence of monotone sequences, the results of bipartite consensus via the event-triggered protocol are provided, which are mainly related to the communication topology of the network, the sampling period, and the threshold parameters in the event-triggered scheme. It is shown that the bipartite consensus is realized even though the DoS attacks take place frequently. Furthermore, this paper discusses the bipartite consensus in the presence of DoS attacks with a random unsuccessful rate. Finally, numerical simulations illustrate the theoretical results.