IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v80y2022i3d10.1007_s11235-022-00897-z.html
   My bibliography  Save this article

Regularized least square multi-hops localization algorithm based on DV-Hop for wireless sensor networks

Author

Listed:
  • Hend Liouane

    (National Engineering School of Monastir, (ENIM) University of Monastir)

  • Sana Messous

    (National Engineering School of Monastir, (ENIM) University of Monastir)

  • Omar Cheikhrouhou

    (Taif University)

Abstract

Localization is a crucial method applied in Wireless Sensor Networks (WSNs) to determine the geographic position of the sensor nodes in the sensing region. Many existing WSNs applications require location awareness of sensor nodes. Global Positioning System (GPS) is a well-known technique of localization. However, as a WSN is composed of thousands of sensor nodes, the installation of GPS is not available at every node. Nowadays, many localization algorithms are developed to solve the location awareness problem. The Distance Vector-Hop algorithm (DV-Hop) is a well-known technique thanks to its simplicity and its accurate localization results for WSNs. However, the DV-Hop presents some localization accuracy drawbacks. In this paper, we propose an improvement of the DV-Hop algorithm based on Tikhonov regularization method for wireless sensors networks. We verify the validity of the proposed method through experiments. Simulation results confirm that the proposed localization algorithm is better than the original DV-Hop algorithm and some of its improved algorithms with up to 60% in terms of localization accuracy.

Suggested Citation

  • Hend Liouane & Sana Messous & Omar Cheikhrouhou, 2022. "Regularized least square multi-hops localization algorithm based on DV-Hop for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(3), pages 349-358, July.
    • Handle: RePEc:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00897-z
    DOI: 10.1007/s11235-022-00897-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00897-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-022-00897-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sana Messous & Hend Liouane & Noureddine Liouane, 2020. "Improvement of DV-Hop localization algorithm for randomly deployed wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 73(1), pages 75-86, January.
    2. Gaurav Sharma & Ashok Kumar, 2018. "Improved DV-Hop localization algorithm using teaching learning based optimization for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(2), pages 163-178, February.
    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. Hilary I. Okagbue & Muminu O. Adamu & Timothy A. Anake & Ashiribo S. Wusu, 2019. "Nature inspired quantile estimates of the Nakagami distribution," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 72(4), pages 517-541, December.
    2. Shilpi & Arvind Kumar, 2023. "A localization algorithm using reliable anchor pair selection and Jaya algorithm for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(2), pages 277-289, February.
    3. Tapan Kumar Mohanta & Dushmanta Kumar Das, 2022. "Improved DV-Hop localization algorithm based on social learning class topper optimization for wireless sensor network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(4), pages 529-543, August.
    4. Soumya J. Bhat & K. V. Santhosh, 2022. "Localization of isotropic and anisotropic wireless sensor networks in 2D and 3D fields," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 79(2), pages 309-321, February.
    5. Haibin Sun & Dong Wang & Hongxing Li & Ziran Meng, 2023. "An improved DV-Hop algorithm based on PSO and Modified DE algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(3), pages 403-418, March.

    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:spr:telsys:v:80:y:2022:i:3:d:10.1007_s11235-022-00897-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.