PSLDV-Hop: a robust localization algorithm for WSN using PSO and refinement process

Bhupinder Kaur, Deepak Prashar, Arfat Ahmad Khan, Seifedine Kadry, Jungeun KimPeerJ Comput. Sci 2025 · DOI

TL;DR

This paper introduces PSLDV-Hop, a novel localization algorithm for Wireless Sensor Networks (WSNs) that combines Particle Swarm Optimization (PSO) with a refinement process to significantly improve accuracy and reduce errors compared to existing methods like DV-Hop. By using fractional hop counts and iterative refinement, PSLDV-Hop offers a more robust and efficient solution for precise node positioning in dynamic WSN environments.

What Problem Does This Paper Address?

Wireless Sensor Networks (WSNs) are crucial for various applications like surveillance, environmental monitoring, and healthcare. A fundamental challenge in WSNs is accurately determining the location of sensor nodes. While GPS can provide precise locations, it's too costly and energy-intensive for large-scale WSN deployments. Existing localization algorithms, such as DV-Hop, often suffer from significant localization errors due to their reliance on estimated average hop sizes, which can be inaccurate in real-world scenarios with varying network conditions. This paper aims to address this gap by proposing a more robust and accurate localization algorithm that overcomes the limitations of traditional methods.

Methods

The proposed PSLDV-Hop algorithm builds upon the DV-Hop localization technique by integrating two key enhancements:

  • Refinement Process: This involves using connectivity data and corrected distance measurements to iteratively refine sensor node positions. This process aims to improve the precision of node locations by accounting for dynamic changes in the network.
  • Particle Swarm Optimization (PSO): PSO, a nature-inspired optimization algorithm, is employed to further enhance node localization accuracy. It iteratively optimizes node positions by mimicking the social behavior of particles, searching for the best solution within the solution space.

Additionally, the algorithm incorporates a Correctional Average Size of a Hop. Unlike DV-Hop, which uses a single average hop size, PSLDV-Hop corrects estimated distances by using precise anchor sensor node coordinates and fractional hop count data. This approach aims to reduce localization errors by determining distances more accurately.

The overall PSLDV-Hop algorithm proceeds in three stages:

  1. PSO Localization: Integrates PSO with DV-Hop to refine preliminary node locations.
  2. Initialization: Sets up initial node positions and parameters for the simulation.
  3. PSO Optimization Loop: Iteratively refines node positions using PSO, checking for convergence based on a prescribed tolerance or maximum number of iterations.

Datasets

Not discussed in the paper. The authors conducted simulations using MATLAB to evaluate their proposed algorithm.

Key Insights and Ideas

  • Fractional Hop Counts are Key: The paper highlights that relying on a single "average hop size" is a major source of error in DV-Hop. Using fractional hop counts and precise anchor coordinates significantly improves distance estimation.
  • Iterative Refinement Pays Off: The iterative nature of the refinement process, combined with PSO, allows the algorithm to continuously improve node positions and adapt to dynamic network conditions, leading to higher accuracy.
  • PSO's Role in Fine-Tuning: PSO is not just used for initial placement but for fine-tuning the positions derived from DV-Hop, effectively mitigating errors and improving the overall localization outcome.
  • Robustness in Diverse Scenarios: The PSLDV-Hop algorithm demonstrates consistent performance across various node densities, anchor node placements, and communication ranges, suggesting its adaptability to real-world WSN challenges.

Key Results

The paper presents several key quantitative results:

  • Reduced Localization Error: PSLDV-Hop consistently shows lower localization errors compared to DV-Hop, Average DV-Hop, GA-DV-Hop, and PSO-DV-Hop across various communication ranges and node counts. For example, at a range of 20 units, the proposed method achieved an error of 33.53 m, significantly lower than DV-Hop (47.24 m) and other enhanced methods.
  • High Success Rate: The proposed algorithm achieved a 95% success rate, outperforming DV-Hop (85%) and other algorithms.
  • Faster Convergence: PSLDV-Hop converges to optimal solutions in fewer iterations compared to other algorithms, indicating its efficiency.
  • Scalability and Adaptability: The algorithm's performance remains strong even with increasing numbers of nodes and communication ranges, demonstrating its scalability and adaptability.

Limitations and Future Work

  • Limitations:
    • The paper acknowledges that DV-Hop's assumption of a constant hop size might not hold true in real-world situations, leading to inaccurate distance estimates. While PSLDV-Hop addresses this, the inherent complexities of WSNs (node mobility, signal propagation) can still introduce variations.
  • The experimental setup involved simulations, and real-world deployment might present additional challenges.
  • Future Work:
    • The authors suggest that PSLDV-Hop is a promising solution for domains requiring precise spatial data, such as healthcare, environmental monitoring, and surveillance. Further research could explore its application in these specific domains.
  • The study makes a substantial contribution by introducing a resilient algorithm that optimizes and refines node localization methods. Future work could focus on further enhancing its precision and dependability.

Summary updated

BibTeX
@article{kaur2025psldv,
  author = {Bhupinder Kaur and Deepak Prashar and Arfat Ahmad Khan and Seifedine Kadry and Jungeun Kim},
  title = {{PSLDV-Hop: a robust localization algorithm for WSN using PSO and refinement process}},
  journal = {PeerJ Comput. Sci.},
  year = {2025},
  doi = {10.7717/peerj-cs.2770},
}
Figure