IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v82y2023i3d10.1007_s11235-023-00991-w.html
   My bibliography  Save this article

An improved DV-Hop algorithm based on PSO and Modified DE algorithm

Author

Listed:
  • Haibin Sun

    (Shandong University of Science and Technology)

  • Dong Wang

    (Shandong University of Science and Technology)

  • Hongxing Li

    (Shandong University of Science and Technology)

  • Ziran Meng

    (Shandong University of Science and Technology)

Abstract

Wireless sensor networks (WSN) have been used in many fields, and the localization technology is one of the core technologies of WSN. Distance Vector-Hop (DV-Hop) algorithm is one of the localization algorithms for WSN, which is widely used because of its simple principle and low cost. The traditional DV-Hop algorithm has high localization error, so the PMDDV-Hop algorithm is proposed in this paper. First, the average hop-size of anchor nodes is optimized by the Particle Swarm Optimization (PSO) algorithm to reduce the accumulation of errors. Then the coordinates of the unknown nodes are optimized using the Differential Evolutionary (DE) algorithm. To reduce the probability of falling into local optimum during evolution, the levy flight strategy is introduced into the DE algorithm to increase the diversity of the population. To further improve the performance of the PMDDV-Hop algorithm, the mutation factor and crossover factor in the DE algorithm are dynamically changed to make them adaptive to the degree of population evolution. Finally, extensive experimental simulations are conducted to evaluate the effectiveness of the PMDDV-Hop algorithm. Experimental results show that the PMDDV-Hop algorithm can effectively reduce the localization error.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:telsys:v:82:y:2023:i:3:d:10.1007_s11235-023-00991-w
    DOI: 10.1007/s11235-023-00991-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-023-00991-w
    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-023-00991-w?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. 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.
    2. Ash Mohammad Abbas, 2021. "Analysis of weighted centroid-based localization scheme for wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 78(4), pages 595-607, December.
    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. Xiuwu Yu & Yinhao Liu & Yong Liu, 2024. "Optimization of WSN localization algorithm based on improved multi-strategy seagull algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 86(3), pages 547-558, July.
    2. 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.
    3. 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.
    4. 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.
    5. 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.

    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:82:y:2023:i:3:d:10.1007_s11235-023-00991-w. 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.