An Efficient Localization Algorithm Using Sparse Anchors for the Internet of Things

Localization is crucial for the Internet of Things (IoT). Most of IoT components are characterized by low capabilities in terms of both energy and computing resources and thus, they cannot implement complex algorithms supporting localization. Besides, existing algorithms fail to provide efficient localization supports. In order to address this issue, we design an efficient localization algorithm using sparse anchors, LASA, by modeling IoT into mass-spring system. Compared with previous algorithms, LASA has a lower computational complexity. Theoretical analysis shows that the algorithm has a good feature of convergence and the computational complexity by O(N), where N is the maximum number of nodes´ neighbors in IoT. We evaluate the performance of this algorithm through some simulations. The results show that LASA is robust to anchors´ position and better for convergence.