Distance vector hop localisation algorithm based on the limitation by the probability to hops Online publication date: Fri, 22-Jun-2018
by Xin Shi; Yanping Li; Sen Zhang; Li Tian
International Journal of Sensor Networks (IJSNET), Vol. 27, No. 2, 2018
Abstract: Distance vector hop (DV-HOP) localisation algorithm, using flooding routing broadcast anchor node information, is confronted with the problem of communication consumption. Cumulative error will be produced when using the jump distance correction value and the minimum number of hops to represent the distance between the nodes. Using maximum likelihood estimation method to determine the unknown nodes, it suffers from the excessive computational consumption. In this paper, a new algorithm has been presented based on the probability property of random distribution of wireless sensor network. Using the limits hops between nodes will reduce the network communication consumption and minimise the cumulative error in distance calculation. Moreover, trilateral positioning method or the extended MIN-MAX algorithm, which is employed to calculate the unknown node coordinates, can decrease the computational consumption. Performance analysis and simulation results show that the proposed algorithm can achieve multi-objective optimisation with higher precision and lower cost.
Online publication date: Fri, 22-Jun-2018
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 Sensor Networks (IJSNET):
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 email@example.com