二次栅格扫描与三角形质心迭代的定位算法  

A positioning algorithm with twice grid scanning and triangle centroid iteration

作　　者：宋海声[1] 周浩 朱长驹 吴佳欣[1] SONG Hai-sheng;ZHOU Hao;ZHU Chang-ju;WU Jia-xin(College of Physics and Electronic Engineering,Northwest Normal University,Lanzhou 730070,China)

机构地区：[1]西北师范大学物理与电子工程学院,甘肃兰州730070

出　　处：《计算机工程与科学》2019年第2期268-274,共7页Computer Engineering & Science

基　　金：甘肃省自然科学基金(1606RJZA065)

摘　　要：为了提高无线传感器网络的定位精度,在Grid-Scan算法的基础上提出一种改进的二次栅格扫描定位算法,再利用三角形质心迭代法进一步提升定位精度。首先通过比较未知节点的所有邻居锚节点到该未知节点的信号强度,找到最近邻居锚节点,利用最近邻居锚节点对可再定位的未知节点所在的估计区域进行二次栅格扫描,再利用PIT法则对定位区域进一步缩减,最后对质心三角形质心进行迭代计算得到最终定位点。仿真结果表明,在相同的网络环境下,与传统算法相比,改进算法明显提高了平均相对定位精度。In order to improve the positioning accuracy of wireless sensor networks,we improve a twice grid scanning positioning algorithm based on the Grid-Scan algorithm,and further improve the positioning accuracy by using the triangle centroid iteration localization algorithm(TCILA).Firstly,the nearest neighbor anchor node is found by comparing the signal strength of all the neighbor anchor nodes of the unknown node to the unknown node,and the nearest neighbor anchor node is used to scan the estimated area of the relocated unknown node two times.And then the PIT rule is used to further reduce the positioning area.Finally,the centroid of the centroid triangle is iteratively calculated to get the final location.Simulation results show that in the same network environment,the improved algorithm can significantly improve the average relative positioning accuracy in comparison with traditional algorithms.

关 键 词：无线传感器网络 Grid-Scan算法 二次栅格扫描 质心迭代 PIT法则 

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