Publication:
Accurate and Scalable DV-Hop WSN Localization With Parameter-Free Fire Hawk Optimizer

dc.authorscopusid57188582201
dc.authorwosidYıldız, Doğan/Aai-5509-2020
dc.contributor.authorYildiz, Dogan
dc.date.accessioned2025-12-11T00:41:55Z
dc.date.issued2025
dc.departmentOndokuz Mayıs Üniversitesien_US
dc.department-temp[Yildiz, Dogan] Ondokuz Mayis Univ, Fac Engn, Dept Elect & Elect Engn, TR-55139 Atakum, Samsun, Turkiyeen_US
dc.description.abstractWireless Sensor Networks (WSNs) have emerged as a foundational technology for monitoring and data collection in diverse domains such as environmental sensing, smart agriculture, and industrial automation. Precise node localization plays a vital role in WSNs, enabling effective data interpretation, reliable routing, and spatial context awareness. The challenge intensifies in range-free settings, where a lack of direct distance data demands efficient indirect estimation methods, particularly in large-scale, energy-constrained deployments. This work proposes a hybrid localization framework that integrates the distance vector-hop (DV-Hop) range-free localization algorithm with the Fire Hawk Optimizer (FHO), a nature-inspired metaheuristic method inspired by the predatory behavior of fire hawks. The proposed FHODV-Hop method enhances location estimation accuracy while maintaining low computational overhead by inserting the FHO into the third stage of the DV-Hop algorithm. Extensive simulations are conducted on multiple topologies, including random, circular, square-grid, and S-shaped, under various network parameters such as node densities, anchor rates, population sizes, and communication ranges. The results show that the proposed FHODV-Hop model achieves competitive performance in Average Localization Error (ALE), localization ratio, convergence behavior, computational, and runtime efficiency. Specifically, FHODV-Hop reduces the ALE by up to 35% in random deployments, 25% in circular networks, and nearly 45% in structured square-grid layouts compared to the classical DV-Hop. Even under highly irregular S-shaped conditions, the algorithm achieves around 20% improvement. Furthermore, convergence speed is accelerated by approximately 25%, and computational time is reduced by nearly 18%, demonstrating its scalability and practical applicability. Therefore, these results demonstrate that the proposed model offers a promising balance between accuracy and practicality for real-world WSN deployments.en_US
dc.description.woscitationindexScience Citation Index Expanded
dc.identifier.doi10.3390/math13203246
dc.identifier.issn2227-7390
dc.identifier.issue20en_US
dc.identifier.scopus2-s2.0-105020041497
dc.identifier.scopusqualityQ2
dc.identifier.urihttps://doi.org/10.3390/math13203246
dc.identifier.urihttps://hdl.handle.net/20.500.12712/38535
dc.identifier.volume13en_US
dc.identifier.wosWOS:001601942200001
dc.identifier.wosqualityQ1
dc.institutionauthorYildiz, Dogan
dc.language.isoenen_US
dc.publisherMDPIen_US
dc.relation.ispartofMathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectWireless Sensor Networks (WSNs)en_US
dc.subjectNode Localizationen_US
dc.subjectDV-Hop Algorithmen_US
dc.subjectMetaheuristicsen_US
dc.subjectFire Hawk Optimizer (FHO)en_US
dc.titleAccurate and Scalable DV-Hop WSN Localization With Parameter-Free Fire Hawk Optimizeren_US
dc.typeArticleen_US
dspace.entity.typePublication

Files