基于网格扫描的WSN节点定位算法  

WSN Node LocalizationAlgorithm Based on Grid Scanning

作　　者：闫中江[1] 龚红焱[2] 沈中[1] 常义林[1] 

机构地区：[1]西安电子科技大学ISN国家重点实验室,西安710071 [2]中国电子科技集团公司第三十二研究所,上海200233

出　　处：《计算机工程》2011年第21期68-70,73,共4页Computer Engineering

摘　　要：现有的非测距定位算法无法准确获取未知节点的估计区域。针对该问题,提出一种基于网格扫描的分布式无线传感器网络(WSN)节点定位算法。计算每个被定位节点的初步估计区域,将该区域划分成网格阵列,通过逐个扫描得到有效网格,并将该有效网格区域的质心作为节点的估计位置。实验结果表明,在不同锚节点比率和不同节点总数的情况下,该算法的定位精度比DLE算法提高20%以上。The estimative region of unknown node cannot be obtained accurately in existing range-free localization algorithms.To address this problem,a new distributed grid scanning localization algorithm is proposed for Wireless Sensor Network（WSN）.The initial estimative region of each unknown node is calculated,and the initial region is divided into a grid array,where the validity of each grid is judged.The centroid of the field of validity grids is regarded as the estimated position of the unknown node.Simulation results show that,comparing with the Distributed Localization Estimating（DLE） algorithm,the accuracy of the proposed algorithm is improved more than 20%.

关 键 词：无线传感器网络 定位算法 网格扫描 估计区域 质心 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]