A new weighted centroid localization algorithm in wireless sensor networks

Nodes in a sensor network are often randomly distributed. To assign measurements to locations, each node has to determine its own position. Algorithms for positioning in wireless sensor networks are classified into two groups: approximate and exact. In this paper, we propose a range-based approximate positioning approach which is almost the combination of WCL and EBTB. Then, compare it with two other approximate positioning approaches (WCL with time complexity of O(n)) and EBTB with time complexity of O(n*n) and an exact positioning approach (QR Factorization with time complexity of O(n*n*n)). Finally, it will be shown that EWCL (with time complexity of O(n*n)) is the best localization algorithm with respect to the three other localization algorithms when the noise is high and its accuracy is close to the accuracy of QR when the noise is medium.