IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v53y2022i1p108-121.html
   My bibliography  Save this article

Scaled consensus for multiagent systems under denial-of-service attacks and exogenous disturbance

Author

Listed:
  • Bilal J. Karaki
  • Magdi S. Mahmoud

Abstract

In this paper, the scaled group consensus problem of high-order multi-agent systems is investigated over directed graphs. In terms of an appropriate Lyapunov function, sufficient conditions are derived to guarantee scaled consensus for high-order continuous-time systems for strongly connected networks. For the case where the agents are subject to exogenous inputs, the scaled consensus is achieved with a guaranteed $ \mathcal {H}_2 $ H2/ $ \mathcal {H}_\infty $ H∞ performance. Moreover, the scaled-consensus problem for multiagents subject Denial-of-Service (DoS) attack is investigated. The considered attack model allows the adversaries to compromise agents independently. Decay rates for each attack mode are obtained based on a set of linear matrix inequalities. Sufficient conditions in terms of decay rates are derived to guarantee secure scaled consensus. Simulation results are also presented to illustrate the effectiveness of the proposed theoretical results.

Suggested Citation

  • Bilal J. Karaki & Magdi S. Mahmoud, 2022. "Scaled consensus for multiagent systems under denial-of-service attacks and exogenous disturbance," International Journal of Systems Science, Taylor & Francis Journals, vol. 53(1), pages 108-121, January.
    • Handle: RePEc:taf:tsysxx:v:53:y:2022:i:1:p:108-121
    DOI: 10.1080/00207721.2021.1938280
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2021.1938280
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2021.1938280?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:53:y:2022:i:1:p:108-121. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.