Regularized Least Square Multi-hops Localization Algorithm for wireless sensor networks
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract Multi-hop localization is a an important technique for Wireless Sensor Networks. Location awareness is very crucial for almost existing sensor network applications. However, using Global Positioning System (GPS) receivers to every node is very expensive. Therefore, the Distance Vector-Hop algorithm (DV-Hop) is proposed and very famous for its simplicity and localization accuracy for Wireless Sensor Networks. The cited algorithm uses a small number of anchor nodes, which are equipped with GPS, thus their locations are known, while other nodes estimate their location from the network connectivity information. However, DV-Hop presents some deficiencies and drawbacks in terms of localization accuracy. Therefore, we propose in this paper an improvement of DV-Hop algorithm, called Regularized Least Square DV-Hop Localization Algorithm for multihop wireless sensors networks. The proposed solution improves the location accuracy of sensor nodes within their sensing field in both isotropic and anisotropic networks. Simulation results prove that the proposed algorithm outperforms the original DV-Hop algorithm with up to 60%, as well as other related works, in terms of localization accuracy.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0