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

Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration

Author

Listed:
  • Chi-Chang Chen
  • Chi-Yu Chang
  • Yan-Nong Li

Abstract

A low-cost yet effective localization scheme for wireless sensor networks (WSNs) is presented in this study. The proposed scheme uses only two anchor nodes and uses bilateration to estimate the coordinates of unknown nodes. Many localization algorithms for WSNs require the installation of extra components, such as a GPS, ultrasonic transceiver, and unidirectional antenna, to sensors. The proposed localization scheme is range-free (i.e., not demanding any extra devices for the sensors). In this scheme, two anchor nodes are installed at the bottom-left corner (Sink X ) and the bottom-right corner (Sink Y ) of a square monitored region of the WSN. Sensors are identified with the same minimum hop counts pair to Sink X and Sink Y to form a zone, and the estimated location of each unknown sensor is adjusted according to its relative position in the zone. This study compares the proposed scheme with the well-known DV-Hop method. Simulation results show that the proposed scheme outperforms the DV-Hop method in localization accuracy, communication cost, and computational complexity.

Suggested Citation

  • Chi-Chang Chen & Chi-Yu Chang & Yan-Nong Li, 2013. "Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration," International Journal of Distributed Sensor Networks, , vol. 9(1), pages 620248-6202, January.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:1:p:620248
    DOI: 10.1155/2013/620248
    as

    Download full text from publisher

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