移动锚节点凸规划定位算法研究及改进

Research and Improvement of Mobile Anchor Node Localization Algorithm Based on Convex Programming

为了提高无线传感器网络的节点定位精度,对相关文献进行了研究,提出了一种改进的移动锚节点凸规划定位算法。该算法对原算法作了以下改进:利用正半定松弛方法扩大求解问题的可行域,以降低求解优化问题的计算复杂度;采用局部梯度下降法进行迭代优化来逼近最优估计,以提高优化问题的求解精度。实验结果表明,改进算法比原算法具有更高的定位精度,并可以更好地适应不同的网络规模。

In order to enhance the node localization accuracy in wireless sensor networks,this article had studied the related references,and proposed an improved convex programming localization algorithm of mobile anchor node. The algorithm made some improvements on the original algorithm to reduce the computational complexity of solving opti￣mization problems,positive semidefinite relaxation method was utilized for enlarging the feasible region of solving problems to improve the accuracy of solving optimization problems and local gradient descent method was used to approximate the optimal estimate. The experimental results show that the algorithm has higher positioning accuracy than the original algorithm,and can better adapt to the different network scale.