A high accurate localization algorithm with DV-Hop and differential evolution for wireless sensor network

被引:104
作者
Cui, Laizhong [1 ]
Xu, Chong [1 ]
Li, Genghui [1 ,2 ]
Ming, Zhong [1 ]
Feng, Yuhong [1 ]
Lu, Nan [1 ]
机构
[1] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China
[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Wireless sensor network (WSN); DV-Hop; Differential evolution (DE); Internet of things (IoT); SUBGRADIENT METHOD; OPTIMIZATION;
D O I
10.1016/j.asoc.2018.03.036
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Localization technology has been a core component for Internet of Things (IoT), especially for Wireless Sensor Network (WSN). Among all localization technologies, Distance Vector-Hop (DV-Hop) algorithm is a very frequently used algorithm for WSN. DV-Hop estimates the distance through the hop-count between nodes in which the value of hop-count is discrete, and thus there is a serious consequence that some nodes have the same estimated distance when their hop-count with respect to identical node is equal. In this paper, we ameliorate the value of hop-count by the number of common one-hop nodes between adjacent nodes. The discrete values of hop-count will be converted to more accurate continuous values by our proposed method. Therefore, the error caused by the estimated distance can be effectively reduced. Furthermore, we formulate the location estimation process to be a minimizing optimization problem based on the weighted squared errors of estimated distance. We apply Differential Evolution (DE) algorithm to acquire the global optimum solution which corresponds to the estimated location of unknown nodes. The proposed localization algorithm based on improved DV-Hop and DE is called DECHDV-Hop. We conduct substantial experiments to evaluate the effectiveness of DECHDV-Hop including the comparison with DV Hop, GADV-Hop and PSODV-Hop in four different network simulation situations. Experimental results demonstrate that DECHDV-Hop can achieve much higher localization accuracy than other algorithms in these network situations. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:39 / 52
页数:14
相关论文
共 47 条
[1]  
Ali WM, 2017, INT J MACH LEARN CYB, P1
[2]  
[Anonymous], 2017, INT J ANAL TECH
[3]  
Bao X. R., 2001, P INT C WIR COMM NET, P1
[4]   GPS-free Positioning in Mobile Ad Hoc Networks [J].
Srdjan Čapkun ;
Maher Hamdi ;
Jean-Pierre Hubaux .
Cluster Computing, 2002, 5 (2) :157-167
[5]   An artificial bee colony algorithm for data collection path planning in sparse wireless sensor networks [J].
Chang, Wei-Lun ;
Zeng, Deze ;
Chen, Rung-Ching ;
Guo, Song .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2015, 6 (03) :375-383
[6]  
Chehri A, 2008, INT J COMPUT SCI NET, V8, P145
[7]  
Chen X, 2012, INT J DISTRIB SENS N, V8, P1018, DOI DOI 10.3837/TIIS.2017.01.011
[8]   Improved DV-Hop Node Localization Algorithm in Wireless Sensor Networks [J].
Chen, Xiao ;
Zhang, Benliang .
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2012,
[9]  
Cui L. Z., 2017, SOFT COMPUT, DOI [10.1007/s00500-017-2485-v, DOI 10.1007/S00500-017-2485-V]
[10]   A novel differential evolution algorithm with a self-adaptation parameter control method by differential evolution [J].
Cui, Laizhong ;
Li, Genghui ;
Zhu, Zexuan ;
Wen, Zhenkun ;
Lu, Nan ;
Lu, Jian .
SOFT COMPUTING, 2018, 22 (18) :6171-6190