A survey of node localisation algorithms in wireless sensor networks Online publication date: Mon, 07-Feb-2022
by Amanpreet Kaur; Govind P. Gupta; Sangeeta Mittal
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 17, No. 1, 2021
Abstract: Wireless sensor networks (WSN) detect and monitor various physical attributes from the environment, convert the observation into information and send it wirelessly to base station/sink. In most of applications of WSNs, localisation, that is, finding location of nodes sending information, is also required to be done for better inferencing. In this paper, we present a review of existing literature related to WSN node localisation problem. Firstly, an introduction on wireless sensor networks and its challenges are mentioned. Then, issues of localisation algorithms are discussed. The paper also discusses different localisation algorithms and their categorisation based on precision/hardware requirement, localisation algorithms can be categorised into two groups such as range-based and range-free algorithms. Various range-based and range-free algorithms with their merits and demerits are summarised and a list of research gaps is discussed.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook