摘要
定位技术是无线传感器网络的关键技术之一,为了提高无线传感器网络的定位精度,在Convex算法基础上提出了Convex-PIT算法.Convex-PIT算法通过引入锚节点构成的三角形进一步滤掉节点不可能存在的区域,缩小节点可能存在范围,提高定位精度.Convex-PIT算法增加了判断未知节点是否在锚节点组成的三角形内的计算量,但不需要增加节点的硬件条件和额外的功能.仿真结果表明,和Convex算法相比,Convex-PIT可以明显的提高定位精度,在锚节点的比例从10%增加到30%的过程中,定位精度提高幅度平均约15%.
Localization is one of the key technologies in wireless sensor network. In order to improve the localization accuracy, Convex-PIT algorithm which is based on Convex algorithm is proposed for wireless sensor network. As an improvement to Convex, it can improve localization accuracy effectively. Convex-PIT uses the triangular areas enclosed by anchors to exclude areas in which nodes do not exist , it will narrow the range to some extend and then improve the localization accuracy. The Convex-PIT algorithm will bring some computing increases that which judge whether the nodes are in the triangles consisting of anchors. However, it do not need additional improvement in hardware or functions of nodes. Simulation experiments prove that Convex-PIT algorithm can obviously improve the localization accuracy compared to Convex. If the proportion of anchors increases from 10 % to 30 %, the improvement in localization accuracy is about 15%.
出处
《传感技术学报》
CAS
CSCD
北大核心
2007年第5期1129-1133,共5页
Chinese Journal of Sensors and Actuators
