无线传感器网络节点的三维序列内心定位算法  

3D Sequences and Incenters Localization Algorithm for Nodes in WSN

作　　者：陈嘉兴[1] 刘志华[2] 

机构地区：[1]河北师范大学研究生学院,河北石家庄050016 [2]河北师范大学信息技术学院,河北石家庄050016

出　　处：《南京理工大学学报》2011年第3期371-375,共5页Journal of Nanjing University of Science and Technology

基　　金：国家自然科学基金（61071128）; 河北省自然科学基金（F2009000319）; 河北省科技攻关基金（10213512D）

摘　　要：为实现传感器节点的自定位,该文以二维序列定位算法为基础,拓展得到三维序列内心定位算法。利用锚节点两两之间的垂直平分面将定位空间分为边、面和体三类区域,进一步判断排列顺序相关系数的大小,找到前四个大值,求出离未知节点＂最近＂的四个区域的重心构成的四面体的内心作为未知节点的估计位置,并滤除节点不可能存在的区域。仿真结果表明,该算法不需要增加硬件设施来实现特殊功能,当锚节点数为30~35时,定位误差相对三维序列算法减少约7%。To realize the self-localization of sensor nodes,a 3D sequences and incenters localization algorithm is obtained based on a 2D sequences localization algorithm.The localization space is divided into distinct regions such as edge,face and body by the perpendicular faces of anchors＇ pairs.The values of rank order correlation coefficients are judged to find the four maximal values,and the incenter of the tetrahedron constructed by the four centroids of the four nearest areas to the unknown node is represented as the location estimate.The area in which the node is impossible to exist is excluded.The simulation results prove that if the proportion of anchors is 30~35,the localization error decreases 7% approximately without additional hardware.

关 键 词：无线传感器网络 节点自定位 三维序列内心定位 

分 类 号：TN915[电子电信—通信与信息系统]