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

Robust Multihop Localization for Wireless Sensor Networks with Unreliable Beacons

Author

Listed:
  • Renjian Feng
  • Xiaolei Guo
  • Ning Yu
  • Jiangwen Wan

Abstract

Multihop localization is a popular approach for determining the positions of normal nodes in large-scale wireless sensor networks. However, most existing multihop localization studies assume that the declared positions of beacon nodes are always reliable or even free of errors, which is not a valid assumption in practice. In this paper, we propose a robust multihop localization algorithm (RMLA) based on trust evaluation for diminishing the effect of unreliable beacons on the accuracy of node localization. Firstly, the trust evaluation framework is established on the basis of evidence theory. According to the multihop geometric relationship among nodes, every beacon evaluates the reliability of other beacons' declared positions. Then, the normal nodes integrate the evaluation results to obtain the total trust degrees of their multihop communication beacons, by use of an average method or an enhanced D-S evidence combination rule. Finally, the normal nodes employ the weighted Taylor-series least squares solver to estimate the optimal values of their coordinates. Extensive simulation results in isotropic and anisotropic networks show the robustness and effectiveness of our algorithm.

Suggested Citation

  • Renjian Feng & Xiaolei Guo & Ning Yu & Jiangwen Wan, 2012. "Robust Multihop Localization for Wireless Sensor Networks with Unreliable Beacons," International Journal of Distributed Sensor Networks, , vol. 8(6), pages 972101-9721, June.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:6:p:972101
    DOI: 10.1155/2012/972101
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/972101
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/972101?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:8:y:2012:i:6:p:972101. 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.