In the previous years, wireless sensor networks (WSNs) have attracted a lot of interest from the industrial and research community. In most of the WSN-based applications, the node’s location information is of much significance. Numerous localization algorithms have been reported in the literature to precisely locate nodes in wireless sensor networks. These algorithms are broadly classified into range-based and range-free techniques. Range-based schemes exploit exact computation measure (distance or angle) among nodes in the network. So, range-based schemes need some additional hardware for such computation, while range-free methods do not need any specific hardware. Range-free schemes use connectivity information among nodes in network. So, range-free methods are treated as cost-effective alternatives to range-based methods. In this paper, we propose PSO-based algorithms for localization in WSNs. We perform the analysis of our proposed algorithms with other existing algorithms of its category on the basis of localization error and accuracy. Simulation results confirm that the proposed algorithm outperforms the other existing algorithms of its category.
CITATION STYLE
Singh, S. P., & Sharma, S. C. (2019). Performance evaluation of improved localization algorithm for wireless sensor networks. In Advances in Intelligent Systems and Computing (Vol. 669, pp. 239–250). Springer Verlag. https://doi.org/10.1007/978-981-10-8968-8_21
Mendeley helps you to discover research relevant for your work.