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

An Hi/H∞ optimisation approach to distributed event-triggered fault detection over wireless sensor networks

Author

Listed:
  • Maiying Zhong
  • Ting Xue
  • Xiaoqiang Zhu
  • Lu Zhang

Abstract

This paper is concerned with the problem of distributed event-triggered fault detection (FD) for linear discrete time-varying systems over resource-constrained wireless sensor networks. To reduce unnecessary communication frequency of sensor measurements and thus communication resource expenditure, an event-triggered communication mechanism is employed to determine whether or not each sensor's measurement should be broadcast to the distributed fault detection filter (FDF) over the wireless network at each time step. Then, an $ H_{i}/H_{\infty } $ Hi/H∞ optimisation approach is proposed to achieve distributed event-triggered fault detection for the concerned system. Specifically, a set of distributed event-triggered FDFs is constructed based on the event-triggered measurement information from each sensor node and its adjacent nodes. Different from the existing distributed event-triggered FD schemes, the major contributions of this paper are twofold. First, the proposed FDF for each sensor node can be designed individually and the residual signal on each node is completely decoupled from the event-triggered transmission error. Second, the design of distributed event-triggered FDFs is formulated as an $ H_{i}/H_{\infty } $ Hi/H∞ optimisation problem and an optimal solution can be obtained by recursively computing some Riccati recursions. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.

Suggested Citation

  • Maiying Zhong & Ting Xue & Xiaoqiang Zhu & Lu Zhang, 2021. "An Hi/H∞ optimisation approach to distributed event-triggered fault detection over wireless sensor networks," International Journal of Systems Science, Taylor & Francis Journals, vol. 52(6), pages 1160-1170, April.
  • Handle: RePEc:taf:tsysxx:v:52:y:2021:i:6:p:1160-1170
    DOI: 10.1080/00207721.2021.1897707
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2021.1897707
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2021.1897707?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:52:y:2021:i:6:p:1160-1170. 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.