A range‐free localization algorithm for IoT networks

Internet of things (IoT) is a ubiquitous network that helps the system to monitor and organize the world through processing, collecting, and analyzing the data produced by IoT objects. The accurate localization of IoT objects is indispensable for most IoT applications, especially healthcare monitori...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of intelligent systems Jg. 37; H. 12; S. 10336 - 10379
Hauptverfasser: Barshandeh, Saeid, Masdari, Mohammad, Dhiman, Gaurav, Hosseini, Vahid, Singh, Krishna K.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York John Wiley & Sons, Inc 01.12.2022
Schlagworte:
Algorithms
DV‐Hop
Heuristic methods
hybrid optimization
Intelligent systems
Internet of Things
Localization
localization error
Oceans
Optimization
ISSN:0884-8173, 1098-111X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Internet of things (IoT) is a ubiquitous network that helps the system to monitor and organize the world through processing, collecting, and analyzing the data produced by IoT objects. The accurate localization of IoT objects is indispensable for most IoT applications, especially healthcare monitoring. Utilizing GPS as the positioning system is not cost‐efficient and does not apply to some environments (e.g., deep forests, oceans, inside the buildings, etc.). Hereupon, copious position estimation approaches are developed in the literature. Among range‐free approaches, distance vector‐Hop (DV‐Hop) is the widely used algorithm due to its straightforward applicability and can estimate the position of unknown objects that are far‐off the anchors. Due to its low accuracy, various techniques were proposed to increase the accuracy of basic DV‐Hop. In the most recent approach, meta‐heuristic algorithms were used, the results of which were promising. In the present paper, Tunicate Swarm Algorithm and Harris hawk optimization were initially hybridized. Afterthought, the resulting hybrid algorithm was enhanced by appending a new phase. Then, the proposed hybrid algorithm was intermingled with the DV‐Hop algorithm. In the first set of experiments, the proposed hybrid algorithm was evaluated on 50 test functions using average, SD, box plot, and p‐value criteria. In the second part, the proposed localization algorithm's efficiency was investigated in twenty‐eight different manners using node localization error, average localization error, and localization error variance metrics. The effectiveness of the contributions was evident from the experimental results.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0884-8173
1098-111X
DOI:10.1002/int.22524