A sparsity-based algorithm for power-efficient node localization

We devise a centralized node localization algorithm, which relies on linearization and employs the orthogonal matching pursuit algorithm at its core, albeit with modifications and additional steps in order to address the localisation problem. The main feature of the algorithm is that it can determine the position of more than one simultaneously transmitting unknown nodes. This renders it generic and efficient in terms of power consumption and use of time and frequency resources. Moreover, efficiency and computational complexity can be traded off for improved localization accuracy.