A Node Deployment-Aided Intelligent Optimization Estimation for WSNs Positioning Refinement

The popularity of next-generation networks has brought ubiquitous location-based demands. This article proposes a node deployment-aided intelligent optimization estimation (NDIOE) for target positioning in terms of node deployment, wireless ranging, calibration errors, and the algorithm itself. Sinc...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on instrumentation and measurement 2024, Vol.73, p.1-15
Main Authors: Luo, Chengming, Yang, Xudong, Wang, Luxue, Xin, Gaifang, Ge, Xiyun, Kong, Fantong, Wang, Biao
Format: Article
Language:English
Subjects:
Accuracy evaluation
Algorithms
Cramer–Rao lower bound (CRLB)
Distance measurement
distributed positioning
Estimation
Extreme values
intelligent optimization
Lower bounds
Mobile nodes
node deployment
Nodes
Optimization
Particle swarm optimization
target localization
uncertainties
Uncertainty
Upper bounds
Wireless communication
Wireless sensor networks
wireless sensor networks (WSNs)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The popularity of next-generation networks has brought ubiquitous location-based demands. This article proposes a node deployment-aided intelligent optimization estimation (NDIOE) for target positioning in terms of node deployment, wireless ranging, calibration errors, and the algorithm itself. Since the optimized deployment of anchor nodes is the basis of high-accuracy positioning, we derive the characteristic matrix closely related to the upper bound of positioning error and map the signal domain to the location domain for a preliminary result solved by unconstrained optimization estimation. On this basis, the preliminary locations as the initial search values can be further refined for more accurate locations with the use of improved local particle swarm optimization in a narrowed searching area, whose adaptive fitness function, inertia weight factor, and mutation operation are designed to avoid falling into the local optimal. Aside from that, considering the high computational cost of solving extreme values through node traversal, we theoretically derive the theoretical minimum expression of any point based on Cramer-Rao lower bound (CRLB) as a benchmark, whose theoretical minimum value is 0.2^{2} in the fully connected network. Compared with the existing related algorithms, the proposed NDIOE algorithm is effectively validated under simulation and experimental platforms, as well as in complex environments with obstacles.
ISSN:0018-9456
1557-9662
DOI:10.1109/TIM.2023.3330360