Please use this identifier to cite or link to this item: https://rfos.fon.bg.ac.rs/handle/123456789/1937
Full metadata record
DC FieldValueLanguage
dc.creatorStrumberger, Ivana
dc.creatorMinović, Miroslav
dc.creatorTuba, Milan
dc.creatorBačanin, Nebojša
dc.date.accessioned2023-05-12T11:21:43Z-
dc.date.available2023-05-12T11:21:43Z-
dc.date.issued2019
dc.identifier.issn1424-8220
dc.identifier.urihttps://rfos.fon.bg.ac.rs/handle/123456789/1937-
dc.description.abstractWireless sensor networks, as an emerging paradigm of networking and computing, have applications in diverse fields such as medicine, military, environmental control, climate forecasting, surveillance, etc. For successfully tackling the node localization problem, as one of the most significant challenges in this domain, many algorithms and metaheuristics have been proposed. By analyzing available modern literature sources, it can be seen that the swarm intelligence metaheuristics have obtained significant results in this domain. Research that is presented in this paper is aimed towards achieving further improvements in solving the wireless sensor networks localization problem by employing swarm intelligence. To accomplish this goal, we have improved basic versions of the tree growth algorithm and the elephant herding optimization swarm intelligence metaheuristics and applied them to solve the wireless sensor networks localization problem. In order to determine whether the improvements are accomplished, we have conducted empirical experiments on different sizes of sensor networks ranging from 25 to 150 target nodes, for which distance measurements are corrupted by Gaussian noise. Comparative analysis with other state-of-the-art swarm intelligence algorithms that have been already tested on the same problem instance, the butterfly optimization algorithm, the particle swarm optimization algorithm, and the firefly algorithm, is conducted. Simulation results indicate that our proposed algorithms can obtain more consistent and accurate locations of the unknown target nodes in wireless sensor networks topology than other approaches that have been proposed in the literature.en
dc.publisherMDPI, Basel
dc.relationinfo:eu-repo/grantAgreement/MESTD/Integrated and Interdisciplinary Research (IIR or III)/44006/RS//
dc.rightsopenAccess
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.sourceSensors
dc.subjectwireless sensor networksen
dc.subjecttree growth algorithmen
dc.subjectswarm intelligenceen
dc.subjectNP hardnessen
dc.subjectnode localizationen
dc.subjectelephant herding optimizationen
dc.titlePerformance of Elephant Herding Optimization and Tree Growth Algorithm Adapted for Node Localization in Wireless Sensor Networksen
dc.typearticle
dc.rights.licenseBY
dc.citation.issue11
dc.citation.other19(11): -
dc.citation.rankM21
dc.citation.volume19
dc.identifier.doi10.3390/s19112515
dc.identifier.fulltexthttp://prototype2.rcub.bg.ac.rs/bitstream/id/573/1933.pdf
dc.identifier.pmid31159373
dc.identifier.rcubconv_2196
dc.identifier.scopus2-s2.0-85067210916
dc.identifier.wos000472133300093
dc.type.versionpublishedVersion
item.cerifentitytypePublications-
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Radovi istraživača / Researchers’ publications
Files in This Item:
File Description SizeFormat 
1933.pdf1.44 MBAdobe PDFThumbnail
View/Open
Show simple item record

SCOPUSTM   
Citations

108
checked on Nov 17, 2025

Google ScholarTM

Check

Altmetric


This item is licensed under a Creative Commons License Creative Commons