.png){kind=icon}
.png){kind=icon}
Return
Optimized localization of target nodes using single mobile anchor node in wireless sensor network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.aeue.2018.04.024.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In Wireless Sensor Networks (WSNs), main challenges which restrict the performance are data computation, lifetime, routing, task scheduling, security, organization and localization. Recently, numerous Computational Intelligence (CI) based potential solutions for above mentioned challenges have been proposed to fulfill the desired level of performance in WSNs. Use of CI gives autonomous and strong solutions to ascertain precise node location (2D/3D) with least hardware necessity (position finding device, i.e., GPS empowered gadget). Localization of target nodes in static scenario can be done more precisely. However, in case of mobility, determining accurate position of each node in network is a challenging problem. In this paper, a novel idea of localizing target nodes with moving single anchor node is proposed using CI based application of Particle Swarm Optimization (PSO) and H-Best Particle Swarm Optimization (HPSO). The moving anchor node is following the Hilbert trajectory. Proposed algorithms are actualized for range-based, distributed, non-collaborative and isotropic WSNs. Only single moving anchor node is used as a reference node to localize the target nodes in the entire network. In proposed algorithms, problem of Line of Sight (LoS) is minimized due to projection of virtual anchor nodes.
Keywords:
Wireless Sensor Networks (WSNs)
Localization
Particle Swarm Optimization (PSO)
H-Best Particle Swarm Optimization (HPSO)
Hilbert space filling curve
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.6K
Citations:
8.3K