基于Voronoi图的WSN阶次序列定位算法

Rank Sequence Localization Algorithm in WSN Based on Voronoi Diagram

针对现有阶次序列定位算法复杂度高的问题,提出一种基于Voronoi图的无线传感器网络阶次序列定位算法。根据Voronoi图对定位空间进行划分,将多边形顶点和边界交汇点作为虚拟信标节点,建立虚拟信标节点到信标节点的阶次序列表。计算未知节点序列与最优序列的Kendall阶次相关系数,通过对系数的归一化处理实现未知节点位置的加权估计。仿真结果表明,与现有序列定位算法相比,该算法在保证较高定位精度的前提下降低了算法复杂度,并且未产生额外的网络成本与能耗。

Aiming at the high complexity of sequence-based localization algorithm, this paper proposes a Rank Sequence Localization Algorithm Based on Voronoi（RSLV） in Wireless Sensor Network（WSN）. The proposed algorithm uses Voronoi diagram for spatial division, takes the polygon vertexes and the boundary intersection nodes as virtual beacon nodes. It constructs the rank sequence table of virtual beacon nodes. Then it computes Kendall coefficients of the optimal rank sequence and that of the unknown node, and realizes the weighted estimate of the unknown node by normalization processing of Kendall coefficients. Simulation results prove that the proposed algorithm can improve the localization accuracy and reduce complexity compared with the traditional sequence localization algorithm, and it does not generate additional network cost and energy consumption.