A range-free localisation algorithm based on connectivity in wireless sensor networks
by Liping Liu; Chunliang Chu; Feng Xia
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 23, No. 1/2, 2016

Abstract: Sensor nodes' position is very important in many wireless sensor networks (WSNs) applications. In this paper, a novel range-free localisation algorithm based on connectivity (LAC) is proposed. By exploiting the probabilistic regulation in cluster-based deployment, the theoretical number of a sensor's neighbours from certain cluster is determined by distance between the sensor and the corresponding cluster head. So distances between sensors and cluster heads can be derived by minimising the deviation between the theoretical number of neighbour sensors and the measurement. Using the optimal distance to each cluster head, the position of each sensor can be estimated with maximum likelihood (ML) multilateration. Compared with some existing range-free algorithms, LAC performs better in terms of localisation accuracy, especially in beacon-less scenarios and reduces communication overhead and computation complexity to some extent. Extensive simulations are performed and the results are observed to be in good consistence with theoretical analysis.

Online publication date: Mon, 22-Aug-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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