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

Geometric Range-Free Localization Algorithm Based on Optimal Anchor Node Selection in Wireless Sensor Networks

Author

Listed:
  • Hyunjae Woo
  • Chaewoo Lee

Abstract

In range-free localization scheme of wireless sensor networks, estimating the distance to the anchor nodes having the actual location is common to compute the position of unknown node. Since the range-free scheme is based on the topology information, the accuracy of distance estimation is considerably affected by node density or node deployment. In this paper, we propose a geometric range-free localization algorithm which estimates the unknown positions geometrically by topological information without considering the distance estimation. To achieve this, we propose an optimal anchor node selection algorithm which selects the anchor nodes connected topologically well for the geometrical location estimation. Simulation results show that the proposed algorithm offers considerably an improved performance compared to the other existing studies.

Suggested Citation

  • Hyunjae Woo & Chaewoo Lee, 2014. "Geometric Range-Free Localization Algorithm Based on Optimal Anchor Node Selection in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 10(4), pages 509892-5098, April.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:4:p:509892
    DOI: 10.1155/2014/509892
    as

    Download full text from publisher

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