SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization

SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
复制标题

DOI：
10.1137/040621600
复制
发表时间：
2006-12
期刊：
SIAM J. Optim.
影响因子：
--
通讯作者：
M. W. Carter;Holly H. Jin;M. Saunders;Y. Ye
M. W. Carter;Holly H. Jin;M. Saunders;Y. Ye
中科院分区：
其他
文献类型：
--
作者：
M. W. Carter;Holly H. Jin;M. Saunders;Y. Ye

文献摘要

被引文献

相似文献

提出了一种基于规则的自适应定位算法SpaseLoc。一个大的问题被解决为一系列非常小的子问题，每个子问题都是通过几何优化模型的半定规划松弛来解决的。根据一组传感器/锚选择规则生成子问题。计算结果与现有的方法相比，SpaseLoc算法扩展性好，并提供了良好的定位精度。
An adaptive rule-based algorithm, SpaseLoc, is described to solve localization problems for ad hoc wireless sensor networks. A large problem is solved as a sequence of very small subproblems, each of which is solved by semidefinite programming relaxation of a geometric optimization model. The subproblems are generated according to a set of sensor/anchor selection rules. Computational results compared with existing approaches show that the SpaseLoc algorithm scales well and provides excellent localization accuracy.