Title: Distance vector hop localisation algorithm based on the limitation by the probability to hops

Authors: Xin Shi; Yanping Li; Sen Zhang; Li Tian

Addresses: Department of Automation, University of Chongqing, Chongqing, 400044, China ' Department of Automation, University of Chongqing, Chongqing, 400044, China ' Department of Automation, University of Chongqing, Chongqing, 400044, China ' Department of Automation, University of Chongqing, Chongqing, 400044, China

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.

Keywords: DV-HOP; DV-HOP; probability distribution; limited number of hops; angle threshold; extended MIN-MAX.

DOI: 10.1504/IJSNET.2018.092630

International Journal of Sensor Networks, 2018 Vol.27 No.2, pp.128 - 135

Accepted: 15 Sep 2017
Published online: 22 Jun 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article