IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v500y2025ics0096300325001730.html
   My bibliography  Save this article

Event-based privacy-consensus control for multiagent systems: An enhanced framework for fault-tolerance and protection against eavesdropping

Author

Listed:
  • Hu, Xiaoyan
  • Ye, Dan

Abstract

This paper investigates the consensus problem of privacy protection for multi-agent systems (MASs) under conditions of compound faults. We develop a fault-tolerant observer that utilizes intermediate variables to estimate both the system state and compound faults, specifically addressing sensor and actuator faults in the physical layer of the system. To safeguard the privacy of communication data at the network layer, a dual protection encoding and decoding strategy is proposed. Furthermore, an intermittent event-triggered mechanism (ETM) is introduced to mitigate the computational and communication burdens imposed by the encoding algorithms. Discrete-time combination measurement values are employed to enhance the generalizability of the ETM. Within the framework of encryption and decryption, fault-tolerant consensus control algorithm is designed to counter two types of eavesdroppers, thereby achieving privacy consensus for MASs while addressing challenges associated with physical layer faults. In the end, a simulation of an island microgrid (MG) with five distributed generators (DGs) is developed to confirm the efficacy of the suggested approach.

Suggested Citation

  • Hu, Xiaoyan & Ye, Dan, 2025. "Event-based privacy-consensus control for multiagent systems: An enhanced framework for fault-tolerance and protection against eavesdropping," Applied Mathematics and Computation, Elsevier, vol. 500(C).
  • Handle: RePEc:eee:apmaco:v:500:y:2025:i:c:s0096300325001730
    DOI: 10.1016/j.amc.2025.129446
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325001730
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129446?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.

    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:eee:apmaco:v:500:y:2025:i:c:s0096300325001730. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.