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

One-Dimensional Localization Algorithm Based on Signal Strength Ratio

Author

Listed:
  • Xinyu Yang
  • Qingru Kong
  • Xiaoyang Xie

Abstract

Localization algorithm in wireless sensor networks has attracted significant interest in recent years. The RSSI approach is considered as the cheapest solution allowing coarse-grain, yet effective for many applications in outdoor environments. However, when environments change, there exists a big localization error using RSSI without a reconstructing data set. In order to solve the problem of reestablishing the data set when the environments change, a novel one-dimensional localization algorithm based on received signal strength ratio (1-DIM-RSSR) is proposed for the one-dimensional wireless sensor network applications, such as road surveillance and pipeline transmission. While synthetically considering accuracy, power consumption, localization time, and device costs, we can only use coordinate x to locate the nodes by defining y as 0. Our algorithm is based on the theory as follows: the values of Signal Strength vary from one environment to another. When environments change, even the distance between the transmitter and the receiver remains unchanged, but there is still at least 10dBm's difference. On the contrary, the ratio of the received signal strength from two base stations varies little in the condition of the unchanged distance, and thus it avoids reconstructing the dataset when environments change. 1-DIM-RSSR comprises of two phases: the data set construction phase and the localization phase. In the first phase, N reference nodes are uniformly distributed between the two base stations BS1 and BS2. We collect the signal strength RR i1 and RR i1 from BS1 and BS2 respectively and get signal strength ratio R i = RR i1 /RR i2 at each point, where i ϵ [1, N] corresponding to the N references nodes. In the localization phase, we record the signal strength ratio Rʹ of mobile nodes and pick the one that best matches the observed signal strength ratio. Our idea is to compute the distance | R i - Rʹ | at a fixed set of locations, and then pick the location that minimizes the distance. Simulation and experiment results show that localization precision of the proposed algorithm compared with the RSSI algorithm is improved when the environments change. The proposed method is easy to operate, and need not reconstruct the dataset when the environments change. So this method holds the promise for many applications such as monitoring product lines, road surveillance, and pipeline transmission. Meanwhile, since our algorithm is based on 1-D localization, how to extend this conception to 2-D or even 3-D localization will be our ongoing work.

Suggested Citation

  • Xinyu Yang & Qingru Kong & Xiaoyang Xie, 2009. "One-Dimensional Localization Algorithm Based on Signal Strength Ratio," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 79-79, January.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:79-79
    DOI: 10.1080/15501320802571822
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802571822
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802571822?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:5:y:2009:i:1:p:79-79. 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.