An Improved DV-Hop Scheme Based on Path Matching and Particle Swarm Optimization Algorithm

作     者：Shi, Qinqin Xu, Qiang Zhang, Jianping 

作者机构：Shanghai Inst Technol Sch Comp Sci & Informat Engn Shanghai 201418 Peoples R China Suzhou Zhongke Adv Technol Res Inst Co Ltd Suzhou 215123 Peoples R China Sino Parking Tech Co Ltd Shanghai 200127 Peoples R China 

出 版 物：《WIRELESS PERSONAL COMMUNICATIONS》 (无线个人通信)

年 卷 期：2019年第104卷第4期

页      面：1301-1320页

核心收录：

学科分类：0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

基　　金：National Nature Science Foundation of China Collaborative Innovation Foundation of Shanghai Institute of Technology [XTCX2018-15] 

主　　题：DV-Hop Node localization Path matching Trilateration Particle swarm optimization algorithm 

摘      要：Distance vector hop (DV-Hop) is a frequently-used localization technology for wireless sensor networks. The traditional DV-Hop scheme estimates the node-anchor distance depending on the hop-count between the network nodes. It is the advantage of the scheme because no costive direct range finding is needed, but it still is the disadvantage of the scheme because the heterogeneity of network topology will make the node-anchor distance estimation precision poor and the localization precision unstable. Since the heterogeneity of network topology is very common due to random node deployment in real applications, the effectiveness of DV-Hop scheme in these applications becomes difficult to confirm and the algorithm needs applicability improvement. Focusing on above problem of the traditional DV-Hop, improved strategies are provided.A path matching algorithm is presented to find out the optimal anchor-anchor shortest path, which is used to determine the average hop distance between anunknown node and its target anchor independently, aiming at making the estimated node-anchor distance as close as possible to the real distance;furtherly, a modified particle swarm optimization algorithm is presented to optimize the initial position of each unknown node, aiming at improving the whole node localization accuracy of the network. Simulations are carried out on different network topologies both in square area and in C-shaped area, and comparisonsaremade for our scheme with the traditional DV-Hop and the other three existed representative improved schemes. Results show that our scheme has better performance both on distance estimation accuracy and on average nodelocalization accuracy.