IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v73y2020i1d10.1007_s11235-019-00592-6.html
   My bibliography  Save this article

Improvement of DV-Hop localization algorithm for randomly deployed wireless sensor networks

Author

Listed:
  • Sana Messous

    (University of Monastir)

  • Hend Liouane

    (University of Monastir)

  • Noureddine Liouane

    (University of Monastir)

Abstract

The Distance Vector-Hop (DV-Hop) algorithm is a well-known technique for wireless sensor networks node location due to its robustness, simplicity and cost effectiveness. Therefore scientists are still searching for its improvement. Aiming at optimizing the localization accuracy in traditional DV-Hop algorithm, we propose a novel improved recursive DV-Hop localization algorithm in this paper. Our research focuses on range-free localization algorithm in homogeneous multi-hop wireless sensor networks. The proposed algorithm is based on a recursive position calculation of unknown nodes. It also focuses on second and third step of DV-Hop algorithm. We aim to use an optimized formulation to calculate the average hop-size of anchor nodes aiming to minimize the localization error in the estimated distance between anchor and unknown node, thus achieving better localization accuracy. Simulation results prove the performance of our proposed algorithm comparing with DV-Hop algorithm and DV-Hop based algorithms in different deployment scenarios.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:telsys:v:73:y:2020:i:1:d:10.1007_s11235-019-00592-6
    DOI: 10.1007/s11235-019-00592-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-019-00592-6
    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-019-00592-6?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. Shrawan Kumar & D. K. Lobiyal, 2017. "Novel DV-Hop localization algorithm for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 64(3), pages 509-524, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.

    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. Gaurav Sharma & Ashok Kumar, 2018. "Fuzzy logic based 3D localization in wireless sensor networks using invasive weed and bacterial foraging optimization," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(2), pages 149-162, February.
    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.

    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:73:y:2020:i:1:d:10.1007_s11235-019-00592-6. 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.