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

A simple efficient anchor-free node localization algorithm for wireless sensor networks

Author

Listed:
  • Tao Du
  • Shouning Qu
  • Qingbei Guo
  • Lianjiang Zhu

Abstract

In wireless sensor networks, node localization is the first operation after deployment, and the efficiency of localization can directly influence the performance of the wireless sensor network, so designing an efficient localization algorithm has been an important focus in wireless sensor network research. Currently, anchor-free algorithms are the focus of research in node localization because they have the advantages of flexible structure, low cost, high stability and good extensibility. In this article, related research studies of unique localization-, angle- and distance-obtaining methods are introduced, and existing algorithms are analysed. Based on the analysis of existing research, an anchor-free localization algorithm named ladder diffusion node localization algorithm is proposed, in which sensor nodes are located by directional diffused activation and acknowledgement packets with fixed energy. In ladder diffusion node localization algorithm, the time cost of localization is greatly reduced, the communication tasks in localization are allocated in a more balanced manner, and node locations are obtained mainly by rigorous computation instead of measurement, which can reduce transmission measurement error. Finally, the performance of ladder diffusion node localization algorithm is proved both in theory and by the simulation results of experiments.

Suggested Citation

  • Tao Du & Shouning Qu & Qingbei Guo & Lianjiang Zhu, 2017. "A simple efficient anchor-free node localization algorithm for wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(4), pages 15501477177, April.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:4:p:1550147717705784
    DOI: 10.1177/1550147717705784
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717705784
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717705784?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
    ---><---

    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:13:y:2017:i:4:p:1550147717705784. 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.