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

Distributed recursive filtering for multi-rate uniform sampling systems with packet losses in sensor networks

Author

Listed:
  • Yuqing Shen
  • Shuli Sun

Abstract

The distributed filtering problem is studied for a multi-rate uniform sampling linear discrete system over sensor networks, where packet losses may occur during data exchange between nodes. The multi-rate system is transformed into a single-rate system by using a virtual measurement method. At each sensor node, the estimates received from neighbour nodes are fused by matrix or scalar weighting according to their different estimation accuracy. A distributed recursive filter with the Kalman consensus filter structure is devised based on the fused estimate, where the filtering gain and consensus gain are solved by locally minimising an upper bound of the filtering error covariance. The obtained gains and the upper bound of the covariance depend on a group of free positive scalar parameters. The scalar parameters are optimised by minimising the upper bound of the covariance. It is proved that the upper bound of the covariance of the filter with optimal gains and parameters is smaller than the covariance of the local filter based on sensor measurements. It avoids calculating cross-covariance matrices between nodes and has small computational burden. The exponential boundedness in the mean square of the filtering error is analysed. A target tracking system verifies the effectiveness of the algorithm.

Suggested Citation

  • Yuqing Shen & Shuli Sun, 2023. "Distributed recursive filtering for multi-rate uniform sampling systems with packet losses in sensor networks," International Journal of Systems Science, Taylor & Francis Journals, vol. 54(8), pages 1729-1745, June.
  • Handle: RePEc:taf:tsysxx:v:54:y:2023:i:8:p:1729-1745
    DOI: 10.1080/00207721.2023.2209887
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207721.2023.2209887?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:54:y:2023:i:8:p:1729-1745. 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.