%0 Journal Article %A ZHU Changju %A WU Jiaxin %A SONG Haisheng %A YANG Hongwu %T Bounding-Box localization algorithm based on limit partition of estimated rectangle %D 2017 %R 10.3778/j.issn.1002-8331.1703-0539 %J Computer Engineering and Applications %P 84-88 %V 53 %N 18 %X 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 localization algorithm. 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 coordinates of the last partition are chosen as the final position of the unknown node. The simulation results suggest that, in case of no additional communication overhead, the improved algorithm reduces the average relative positioning error of the algorithm to a certain extent. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1703-0539