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

A weighted and distributed algorithm for multi-hop localization

Author

Listed:
  • Juan Cota-Ruiz
  • Rafael Gonzalez-Landaeta
  • Jose David Diaz-Roman
  • Boris Mederos-Madrazo
  • Ernesto Sifuentes

Abstract

Multi-hop wireless sensor networks are widely used in many location-dependent applications. Most applications assume the knowledge of geographic location of sensor nodes; however, in practical scenarios, the high accuracy on position estimates of sensor nodes is still a great challenge. In this research, we propose a hop-weighted scheme that can be useful in distance-based distributed multi-hop localization. The hop-weighted localization approach generates spatial locations around position estimates of unknown sensors and computes local functions that minimize distance errors among hop-weighted and static neighboring sensors. The iterative process of each unknown sensor to re-estimate its own location allows a significant reduction of initial position estimates. Simulations demonstrate that this weighted localization approach, when compared with other schemes, can be suitable to be used as a refinement stage to improve localization in both isotropic and anisotropic networks. Also, under rough initial position estimates, the proposed algorithm achieves root mean square error values less than the radio range of unknown sensors, in average, with only a few iterations.

Suggested Citation

  • Juan Cota-Ruiz & Rafael Gonzalez-Landaeta & Jose David Diaz-Roman & Boris Mederos-Madrazo & Ernesto Sifuentes, 2019. "A weighted and distributed algorithm for multi-hop localization," International Journal of Distributed Sensor Networks, , vol. 15(7), pages 15501477198, June.
    • Handle: RePEc:sae:intdis:v:15:y:2019:i:7:p:1550147719860412
    DOI: 10.1177/1550147719860412
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Jiawang Nie, 2009. "Sum of squares method for sensor network localization," Computational Optimization and Applications, Springer, vol. 43(2), pages 151-179, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chao Ding & Hou-Duo Qi, 2017. "Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation," Computational Optimization and Applications, Springer, vol. 66(1), pages 187-218, January.
    2. Kristijan Cafuta, 2019. "Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 397-413, June.
    3. Wu, Zhiyou & Tian, Jing & Quan, Jing & Ugon, Julien, 2014. "Optimality conditions and optimization methods for quartic polynomial optimization," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 968-982.
    4. João Gouveia & Ting Pong, 2012. "Comparing SOS and SDP relaxations of sensor network localization," Computational Optimization and Applications, Springer, vol. 52(3), pages 609-627, July.
    5. Meng-Meng Zheng & Zheng-Hai Huang & Sheng-Long Hu, 2022. "Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space," Journal of Global Optimization, Springer, vol. 84(2), pages 415-440, October.
    6. Ting Pong, 2012. "Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints," Computational Optimization and Applications, Springer, vol. 53(1), pages 23-44, September.

    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:15:y:2019:i:7:p:1550147719860412. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.