基于扰动锚点位置和RSSI测量的WLS自定位
WLS-Based Self-Localization Using Perturbed Anchor Positions and RSSI Measurements
摘要:
我们考虑的问题,由一个资源受限的节点在网络内的无线电信号强度指示符(RSSI)测量从一组锚节点的RSSI测量以及锚的位置信息受到扰动。为了实现一个计算效率的估计未知的位置,我们最小化加权平方和距离误差成本函数的迭代方式,利用梯度下降法。我们通过考虑RSSI测量和锚节点位置信息中的扰动来计算成本函数中的权重,同时假设锚节点位置信息中的扰动为正态分布,RSSI引起的距离估计为对数正态分布。后一种假设是由于考虑对数距离路径损耗模型与正态分布的扰动的RSSI测量在对数尺度。我们还推导出与所考虑的位置估计问题相关联的Cramer-Rao下界。我们评估所提出的算法的性能,考虑各种任意的网络拓扑结构,并将其与现有的算法,是基于一个类似的方法,但只占在RSSI测量的扰动。实验结果表明,该算法在保持计算效率的前提下,定位性能明显优于现有算法。这使得所提出的算法适用于现实世界中的应用,其中锚节点的位置的信息往往遭受不确定性,由于观测噪声或误差和移动节点的计算和能量资源是有限的,禁止使用更复杂的技术,如那些基于半定或二阶锥规划。
英文摘要:
We consider the problem of self-localization by a resource-constrained node within a network given radio signal strength indicator (RSSI) measurements from a set of anchor nodes where the RSSI measurements as well as the anchor position information are subject to perturbation. In order to achieve a computationally efficient estimate for the unknown position, we minimize a weighted sum-square-distance-error cost function in an iterative fashion utilizing the gradient-descent method. We calculate the weights in the cost function by taking into account perturbations in both RSSI measurements and anchor node position information while assuming normal distribution for the perturbations in the anchor node position information and log-normal distribution for the RSSI-induced distance estimates. The latter assumption is due to considering the log-distance path-loss model with normally-distributed perturbations for the RSSI measurements in the logarithmic scale. We also derive the Cramer-Rao lower bound associated with the considered position estimation problem. We evaluate the performance of the proposed algorithm considering various arbitrary network topologies and compare it with an existing algorithm that is based on a similar approach but only accounts for perturbations in the RSSI measurements. The experimental results show that the proposed algorithm yields significant improvement in localization performance over the existing algorithm while maintaining its computational efficiency. This makes the proposed algorithm suitable for real-world applications where the information available about the positions of anchor nodes often suffer from uncertainty due to observational noise or error and the computational and energy resources of mobile nodes are limited, prohibiting the use of more sophisticated techniques such as those based on semidefinite or second-order cone programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。