arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.0201math.OCcs.ITcs.NImath.IT
收藏

基于二次Optimization的无线传感器网络定位算法

Localization in Wireless Sensor Networks Using Quadratic Optimization

Pouya Mollaebrahim Ghari, Reza Shahbazian, Seyed Ali Ghorashi

摘要:

无线传感器网络中的定位问题是利用已知的一些节点(称为锚点)的位置和相应的噪声距离测量来确定传感器节点的协调。有各种不同的方法来解决这个问题,如半定规划(SDP)的基础上,平方和二阶锥规划,其中,基于SDP的方法表现出良好的性能。近年来,主要的SDP方法已被研究,并提出了各种方法,以提高其性能。在SDP方法中,近似给定距离的误差作为目标函数被最小化。希望这些问题中的误差分布是δ分布,这实际上是不可能的。因此,我们可以用方差很小的高斯分布来近似δ分布。在本文中,我们定义了一个新的目标函数,使误差分布尽可能类似于一个高斯分布具有很小的方差。仿真结果表明,与传统的SDP方法和其他常用的目标函数(如最小二乘法)相比,该方法具有更高的精度。我们的方法也比其他流行的方法,试图提高精度的主要SDP方法更快。

英文摘要:

The localization problem in a wireless sensor network is to determine the coordination of sensor nodes using the known positions of some nodes (called anchors) and corresponding noisy distance measurements. There is a variety of different approaches to solve this problem such as semi-definite programming (SDP) based, sum of squares and second order cone programming, and between them, SDP-based approaches have shown good performance. In recent years, the primary SDP approach has been investigated and a variety of approaches are proposed in order to enhance its performance. In SDP approaches, errors in approximating the given distances are minimized as an objective function. It is desirable that the distribution of error in these problems would be a delta distribution, which is practically impossible. Therefore, we may approximate delta distribution by Gaussian distribution with very small variance. In this paper, we define a new objective function which makes the error distribution as similar as possible to a Gaussian distribution with a very small variance. Simulation results show that our proposed method has higher accuracy compared to the traditional SDP approach and other prevalent objective functions which are used such as least squares. Our method is also faster than other popular approaches which try to improve the accuracy of the primary SDP approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑