History based multi-node collaborative localisation in mobile wireless ad hoc networks Online publication date: Mon, 04-Feb-2019
by Defang Liu; Songtao Guo; Wenyuan Chen; Fei Wang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 30, No. 2, 2019
Abstract: In most existing localisation algorithms, increasing the density of anchor nodes is one of the main strategies to improve the localisation accuracy in dense ad hoc wireless networks. In this paper, based on the number of reference nodes, we propose a distributed localisation algorithm, i.e., history based multi-node collaborative localisation algorithm (HMCL), in sparse ad hoc wireless networks. In the proposed HMCL algorithm, we exploit a new motion model to filter the imprecise estimation based on the historical position information of nodes, which can improve the localisation accuracy. Moreover, we utilise different strategies to achieve the localisation of nodes with different priorities measured by the distance between neighbour nodes. We verify through experiment that the proposed algorithm provides higher localisation precision and less energy consumption. Besides, we also analyse the effect of the number of neighbour nodes, node density and moving speed of nodes on localisation precision.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
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