IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v526y2026ics0096300326001086.html

Fixed-time projective quasi-synchronization for multi-layer coupled memristive neural networks under deception attacks

Author

Listed:
  • Haliding, Xiahedan
  • Zhang, Yijun
  • Zhang, Baoyong
  • Zhou, Kai

Abstract

This study addresses the issue of fixed-time projective quasi (FTPQ)-synchronization for multi-layer coupled memristive neural networks (MNNs) with deception attacks. Unlike complete synchronization, this paper focuses on the problems of intra-layer synchronization and inter-layer synchronization. A multi-layer coupled MNN model is proposed to characterize not only the multi-layer structures of the network but also the inter-layer and intra-layer interactions among nodes. Deception attackers are assumed to tamper with transmitted information in controller-to-actuator channels, and these attacks are modeled using a Bernoulli random variable. A dynamic event-triggered control (DETC) framework is established to ensure synchronization of multi-layer coupled MNNs, where controller updates only occur when necessary, thereby reducing communication and computation burden. Based on the Lyapunov function method and fixed-time stability theory, sufficient conditions are obtained for both intra-layer and inter-layer FTPQ-synchronization in multi-layer coupled MNNs, while the Zeno phenomena are excluded. Finally, a numerical example with application to image encryption/decryption is presented to validate the obtained results and demonstrate the method’s effectiveness.

Suggested Citation

  • Haliding, Xiahedan & Zhang, Yijun & Zhang, Baoyong & Zhou, Kai, 2026. "Fixed-time projective quasi-synchronization for multi-layer coupled memristive neural networks under deception attacks," Applied Mathematics and Computation, Elsevier, vol. 526(C).
  • Handle: RePEc:eee:apmaco:v:526:y:2026:i:c:s0096300326001086
    DOI: 10.1016/j.amc.2026.130056
    as

    Download full text from publisher

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

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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:eee:apmaco:v:526:y:2026:i:c:s0096300326001086. 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.