Abstract

This paper aims to solve scaled consensus problem for general linear multiagent systems under denial-of-service (DoS) attacks. Firstly, we propose a new scaled disagreement vector and investigate its properties under switching and undirected graphs. Secondly, we establish sufficient conditions in terms of linear matrix inequalities in order to guarantee that the multiagent system achieves scaled consensus under DoS attacks. Contrary to most existing studies where DoS attacks on all the channels are same, in this note, we formulate the problem such that the adversary compromises each agent independently. Moreover, the distributed consensus protocol is investigated for networks with time-varying delay. Finally, two simulation examples are given to demonstrate effectiveness of the proposed design methodologies.

Full Text
Paper version not known

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 call

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.