Range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks

Abstract

This paper presents a range-free selective anchor node center of the smallest communication overlap polygon localization algorithm in wireless networks. The algorithm is range-free which does not require ranging devices. To estimate the location of unknown (location unaware) nodes it uses node connectivity based on selected anchor (location aware) nodes. The algorithm first selects appropriate anchor nodes. Then, the True Intersection Points (TIPs) constituting the vertices of the smallest communication overlap polygon (SCOP) of these selected anchor nodes' communication ranges are found. Finally, the location of the unknown node is estimated at the center of the SCOP which is formed from these TIPs. The algorithm performance is evaluated using MatLab simulation and compares favorably to state-of-the-art algorithms: Centroid, improved version of CPE, Mid-perpendicular and CSCOP localization algorithms. The results show the proposed algorithm outperforms other state-of-the-art algorithms in location accuracy and it has reasonable computational complexity.