A quadratic centroid algorithm for wireless sensor network localization
Lin Yao, Zheng Dai, Sizhi Yang, Haojie Ding · 2017
With the rapid development of economy and the increase of cars, the car theft deterrent is more and more of concern. The localization technique is important in car theft deterrent. In order to obtain more accurate information through the wireless sensor network, the correct node location is particularly important. However, due to the large-scale, self-organizing and dynamic nature of wireless sensor networks, correct node location is also a problem. This paper presents a new wireless sensor network location algorithm - the quadratic centroid algorithm. The basic idea of this method is to find the coordinates of the intersection of all the circles representing the distance between the beacon and the unknown node, and then calculate the distance between the intersection and the rough position obtained before with the rough position as the core, to estimate the final set of unknown nodes. The simulation results show that the proposed algorithm has a significant improvement in the weighted centroid localization algorithm based on trilateral measurement, which is about 9% higher than that of the trilateration method.