中文摘要：

针对阶次序列定位算法的复杂度高和定位精度低的问题，提出了一种新的无线传感器网络阶次序列加权定位算法，给出了该算法的基本原理与实现方法。该算法首先采用Voronoi图对定位空间进行划分，将多边形的点、面的重心及其和边界交汇点作为虚拟信标节点，然后建立虚拟信标节点到信标节点的阶次序列表。最终，该算法计算未知节点序列与构建的最优序列表中各序列的Kendall阶次相关系数，通过对系数的归一化处理实现未知节点位置的加权估计。仿真结果表明，新算法在降低算法复杂度的同时降低了边缘节点定位误差，定位精度也有所改善。

英文摘要：

Aiming at the high complexity and low accuracy of sequence-based localization algorithm, this paper propo-ses a new rank sequence localization algorithm based on Voronoi in Wireless Sensor Network .Its principles and reali-zation methods are also studied.Firstly, the proposed algorithm uses Voronoi for spatial division, takes the polygon vertexes, the vertexes’ gravities and the boundary intersection nodes as virtual beacon nodes.Then, the rank se-quence table of virtual beacon nodes is constructed .Finally, it computes Kendall coefficients of the ranks in the opti-mal rank sequence table and that of the unknown node , realizes the weighted estimate of the unknown node by nor-malization processing Kendall coefficients .The simulation experiments prove that the proposed algorithm can improve the localization accuracy and complexity compared to the traditional sequence-based algorithm.