A power adjusting anchors with improved localization algorithm for mobile wireless sensor networks

• Published in: International journal of computer mathematics. Computer systems theory 2016-10, Vol.1 (3-4), p.129-140
• Main Authors: Chelouah, L., Semchedine, F., Bouallouche-Medjkoune, L.
• Format: Article
• Language: English
• Subjects: bounding-box; localization; Mobile Wireless sensor networks (MWSNs); power adjusting anchors; precision
• ISSN: 2379-9927; 2379-9935
• DOI: 10.1080/23799927.2017.1284902

In Mobile Wireless Sensor Networks (MWSNs), localization is one of the key technologies since it plays a critical role for many location-aware protocols and applications. Existing range-free localization algorithms for MWSNs are usually based on the Sequential Monte Carlo localization algorithm. They suffer from low sampling efficiency, high communication computation cost or require high beacon density to achieve high localization accuracy. In this paper, we propose a novel algorithm called 'Power Adjusting Anchors' that outperforms in terms of accuracy. In this algorithm, mobile sensor node localizes its position based on the received power levels transmitted by the neighbouring anchors and by constructing a refined prediction area with the hop-distance estimations between elected anchor nodes. This area will be divided into square grids, and sensor node selects all the grids which owns the highest elections, and then, computes the centroid of such grids. The calculated centroid is considered as the estimated location of the sensor node. In addition, the algorithm addresses the information state provided by the radio communication between sensor nodes and anchor nodes to the success of the localization. Simulation results show that the algorithm is very competitive by achieving high localization accuracy with better localization success.