IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i5p565290.html
   My bibliography  Save this article

Set-Membership Adaptive Localization Algorithm with Time-Varying Error Bounds for Underwater Wireless Sensor Networks

Author

Listed:
  • Yongji Ren
  • Ning Yu
  • Xiao Wang
  • Jiangwen Wan

Abstract

This paper presents a set-membership adaptive localization algorithm with time-varying error bounds for underwater wireless sensor networks (UWSNs). In large-scale UWSNs, the nonstationary underwater environments, the insufficient prior information of hybrid noise, the small sample size of available distance measurements, and the node mobility all pose severe challenges for localization, and most current schemes are not applicable. Unlike most of the existing approaches, we tackle the multihop localization problem in a set-membership framework based on the consideration that the distance measurement uncertainty can be cast into an unknown but bounded (UBB) context. The principle of our scheme is firstly to use the bootstrap method to build confidence intervals and error bounds from a small sample set of distance measurements and then to determine the positions by a low-complexity interval analysis method as well as an adaptive localization update specification with time-varying error bounds. Simulation results show that our proposed scheme is an effective and efficient localization approach in large-scale UWSNs.

Suggested Citation

  • Yongji Ren & Ning Yu & Xiao Wang & Jiangwen Wan, 2013. "Set-Membership Adaptive Localization Algorithm with Time-Varying Error Bounds for Underwater Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(5), pages 565290-5652, May.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:5:p:565290
    DOI: 10.1155/2013/565290
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/565290
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/565290?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
    ---><---

    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:sae:intdis:v:9:y:2013:i:5:p:565290. 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: SAGE Publications (email available below). General contact details of provider: .

    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.