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

Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks

Author

Listed:
  • Chao Zhang
  • Yingjian Liu
  • Zhongwen Guo
  • Yu Wang

Abstract

Localization is one of the most fundamental problems in wireless sensor networks (including ocean sensor networks). Current localization algorithms mainly focus on how to localize as many sensors as possible given a set of mobile or static anchor nodes and distance measurements. In this paper, we consider an optimization problem, the minimum cost three-dimensional (3D) localization problem , in an ocean sensor network, which aims to localize all underwater sensors using the minimum number of anchor nodes or the minimum travel distance of the surface vessel which deploys and measures the anchors. Given the hardness of 3D localization, we propose a set of greedy methods to pick the anchor set and its visiting sequence. Aiming at minimizing the localization errors, we also adopt a confidence-based approach for all proposed methods to deal with noisy ranging measurements (which is very common in ocean sensor networks) and possible flip ambiguity. Our simulation results demonstrate the efficiency of all proposed methods.

Suggested Citation

  • Chao Zhang & Yingjian Liu & Zhongwen Guo & Yu Wang, 2014. "Solving Minimum Cost Three-Dimensional Localization Problem in Ocean Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(5), pages 452718-4527, May.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:5:p:452718
    DOI: 10.1155/2014/452718
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/452718
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/452718?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:10:y:2014:i:5:p:452718. 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.