结合共线性因素的无线传感器网络DV-Hop定位算法  

DV-Hop Localization Algorithm with Collinearity in Wireless Sensor Network

作　　者：张云洲[1] 项姝 付文艳[1] 贾子熙[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110819

出　　处：《东北大学学报（自然科学版）》2014年第10期1378-1381,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(61273078);中国博士后科学基金资助项目(2012M511164;2014T70263);中央高校基本科研业务费专项资金资助项目(N130404023)

摘　　要：无线传感器网络的锚节点近似位于同一条直线上时,构成共线性现象,造成定位数据失真和精度下降.针对大规模无线传感器网络的非测距定位,结合共线性因素提出了一种DV-Hop定位算法,引入Voronoi图将网络划分成若干区域,依据共线性进行锚节点组的选取和提纯.根据跳数阈值的限制,利用每块区域的锚节点信息和符合共线性原理条件的锚节点信息对未知节点进行定位.仿真实验表明,与传统的DV-Hop和共线性算法相比,所提算法能够提高节点定位精度、减少定位误差;对于分布不均匀的网络,能够实现高精度节点定位,并适用于较复杂的环境.When anchor nodes form collinearity, which means that the anchor nodes locate in almost the same straight line, negative effect will be caused upon positioning accuracy, and therefore the precision will be declined. Considering the collinearity features, a DV-Hop strategy was proposed for the large-scale range-free localization in wireless sensor network. Voronoi diagram was used to divide the network into several regions. Then anchor nodes were selected and purified by coUinearity. According to the hop limit threshold, the information of anchor nodes in each region and conform collinearity condition were utilized to localize the unknown node. Simulation results showed that the proposed strategy, compared with the traditional DV-Hop and collinearity algorithm, could effectively decrease the computational complexity, improve the node positioning accuracy and reduce the localization error. For the asymmetrical networks, the strategy could achieve higher precision node positioning and be suitable for complex environment.

关 键 词：无线传感器网络 节点定位 DV-HOP算法 共线性 锚节点组 

分 类 号：TP274[自动化与计算机技术—检测技术与自动化装置]