极限分割估计矩形的Bounding-Box定位算法  

Bounding-Box localization algorithm based on limit partition of estimated rectangle

作　　者：朱长驹 吴佳欣[1] 宋海声[1] 杨鸿武[1] ZHU Changju;WU Jiaxin;SONG Haisheng;YANG Hongwu(College of Physics and Electronic Engineering, Northwest Normal University, Lanzhou 730070, China)

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

出　　处：《计算机工程与应用》2017年第18期84-88,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.11664036);甘肃省自然科学基金(No.1606RJZA065)

摘　　要：针对无线传感器网络中Bounding-Box算法定位精度低的问题,在Bounding-Box算法的基础上提出一种极限分割估计矩形的方法来改进定位算法,分割后的估计矩形产生一个待选质心,当满足分割条件时,对估计矩形继续分割,并不断产生待选质心,当满足终止分割条件时,将上一次分割得到的待选质心坐标作为未知节点的最终位置,通过极限分割的方法可以修正未知节点的定位误差。仿真结果表明,在无需增加额外通信开销的情况下,改进的算法在一定程度上降低了算法的平均相对定位误差。Aiming to the problem of low positioning accuracy,in Wireless Sensor Network(WSN),for traditional Bounding-Box algorithm,the method of limit partition is proposed on the basis of Bounding-Box algorithm to improve the localizationalgorithm.The estimated rectangle produces a desired centroid after partition.While satisfying the conditions of partition,continue partitioning and producing a new desired centroid.If the termination condition is satisfied,the centroid coordinatesof the last partition are chosen as the final position of the unknown node.The simulation results suggest that,incase of no additional communication overhead,the improved algorithm reduces the average relative positioning error ofthe algorithm to a certain extent.

关 键 词：无线传感器网络 Bounding-Box算法 极限分割 估计矩形 待选质心 

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