基于未知-信标迭代及圆环交汇的WSN定位算法

Localization Algorithm Based on Unknown-Beacon Iterative and Annulus Intersection in WSN

针对圆环交汇与网格扫描算法在定位时要求信标节点数量满足一定规模的缺陷,提出一种未知-信标迭代的基于圆环交汇与网格扫描改进算法.该算法通过将已定位的未知节点视为已知条件使用,引入信标节点迭代方法,解决了少量信标节点定位精度低的问题,增加了未知节点中已定位节点的循环利用.实验结果表明,改进算法提高了定位精度,并降低了对信标节点规模的依赖.

Aiming at the defect that the annulus intersection and grid scan algorithm required the number of beacon nodes to meet the size of a certain scale, the author proposed an improved algorithm based on annulus intersection and grid scan for unknown-beacon iterative. The algorithm took the localized unknown nodes as the known condition. The algorithm solved the problem of low localization precision of a small number of beacon nodes and increased the recycling utilization of the localized nodes in the unknown nodes by introducing the beacon node iterative method. Experimental results show that the improved algorithm can improve the localization precision and reduce the dependence on the scale of beacon nodes.