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

Localization Algorithms in Large-Scale Underwater Acoustic Sensor Networks: A Quantitative Comparison

Author

Listed:
  • Guangjie Han
  • Aihua Qian
  • Chenyu Zhang
  • Yan Wang
  • Joel J. P. C. Rodrigues

Abstract

Recently underwater acoustic sensor networks (UASNs) have drawn much attention because of their great value in many underwater applications where human operation is hard to carry out. In this paper, we introduce and compare the performance of four localization algorithms in UASNs, namely, distance vector-hop (DV-hop), a new localization algorithm for underwater acoustic sensor networks (NLA), large-scale hierarchical localization (LSHL), and localization scheme for large scale underwater networks (LSLS). The four algorithms are all suitable for large-scale UASNs. We compare the localization algorithms in terms of localization coverage, localization error, and average energy consumption. Besides, we analyze the impacts of the ranging error and the number of anchor nodes on the performance of the localization algorithms. Simulations show that LSHL and LSLS perform much better than DV-hop and NLA in localization coverage, localization error, and average energy consumption. The performance of NLA is similar to that of the DV-hop. The advantage of DV-hop and NLA is that the localization results do not rely on the number of anchor nodes; that is, only a small number of anchor nodes are needed for localization.

Suggested Citation

  • Guangjie Han & Aihua Qian & Chenyu Zhang & Yan Wang & Joel J. P. C. Rodrigues, 2014. "Localization Algorithms in Large-Scale Underwater Acoustic Sensor Networks: A Quantitative Comparison," International Journal of Distributed Sensor Networks, , vol. 10(3), pages 379382-3793, March.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:3:p:379382
    DOI: 10.1155/2014/379382
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/379382
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/379382?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:3:p:379382. 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.