.png){kind=icon}
.png){kind=icon}
Return
A Range-Free Node Localization Method Based on MinMax Error Criterion for Sparse Anchors Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2024.3351877.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Current range-free node localization method experiences low localization accuracy in sparse anchors wireless sensor networks (WSN). To this end, a novel range-free node localization model based on minimize maximum error criterion is proposed in this letter. Moreover, an iterative localization algorithm called MinMax-DV-hop is proposed to tackle the nonconvex and non-differentiable objective function of proposed model too. Specifically, auxiliary variable is introduced to recast the minimum-maximum optimization into one with a linear object function, convex constraints and nonconvex constraints. And then, nonconvex constraints are tightened to linear inequality constraints by using its first-order Taylor expansions, thus a successive convex approximation method can be designed to iteratively solve the optimization problem finally. Simulations show that the MinMax-DV-hop experiences higher localization accuracy in sparse anchors WSN than those of the comparisons algorithm.
Keywords:
Location awareness
Wireless sensor networks
Computational modeling
Computational complexity
Approximation algorithms
Taylor series
Cost function
Localization
optimization
range-free
sparse anchors
wireless sensor networks (WSN)
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W