Open AccessAmended DV‐hop scheme based on N‐gram model and weighed LM algorithm
Author(s) -
Shi Qinqin,
Xu Qiang,
Zhang Jianping
Publication year - 2020
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2019.2957
Subject(s) - hop (telecommunications) , beacon , scalability , wireless sensor network , algorithm , adaptability , computer science , topology (electrical circuits) , mathematics , real time computing , computer network , ecology , combinatorics , database , biology
Distance vector‐hop (DV‐hop) is a classical node localisation method for wireless sensor networks. Its main advantages are ease of use and excellent scalability, but its shortcomings are also very prominent for the high requirements on the network topology and low localisation accuracy in practical applications. An amended DV‐hop strategy is provided to improve the shortcomings of the classical DV‐hop including two aspects: one is that an N‐gram model is adopted to amend the distances between unknown nodes and beacons and the other is that a weighed Levenberg–Marquardt method is adopted to optimise the unknown nodes’ initial positions. Simulation results show that compared with the original DV‐hop method and the other two typical improved methods, our proposed strategy improves the adaptability of the DV‐hop class methods to network topology changes, and the localisation accuracy is significantly enhanced.