Skip to Main Content
A limit DV-hop (LDV-hop) algorithm is put forward based on comprehensive analysis of DV-hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDV-hop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.