H-V scan and diagonal trajectory: accurate and low power localization algorithms in WSNs

Obtaining the accurate location of the sensor nodes, which is known as the localization algorithm, is considered a significant issue in various applications of wireless sensor networks (WSNs). The present study introduced two anchor-based localization algorithms, namely, H-V scan and diagonal localization. These two algorithms are based on the received signal strength indicator (RSSI) and connectivity information, respectively. In addition, the diagonal algorithm relies on a diagonal trajectory in which the accuracy is improved while the consumed energy and localization time are decreased. Further, the H-V scan method benefits from collinearity and thus the location of the nodes is determined by the collinear position packets. Therefore, RWP, circle, LMAT, Z-curve, and H-curve methods, along with the proposed methods by Inet package of Omnetpp simulator were implemented for a fair comparison. The results indicated that in diagonal method accuracy improves about 1.2 times and consumed energy and localization time decrease about 65% compare to the best results of all the related studies. Furthermore, the results confirmed that the H-V scan which uses from collinearity concept, increases the accuracy about eight times.