Journal of Software Engineering1819-43112152-0941Asian Network for Scientific Information10.3923/jse.2015.631.640ZhangWanliYangXiaoyingSongQixiang3201593In this study, the evolutionary programming algorithm with high stability, fast convergence and excellent performance on solving global optimization problem is introduced into DV-Hop localization algorithm and an improved DV-Hop localization algorithm based on evolutionary programming resample (EPRDV-Hop) is proposed to solve the error problem, which is brought by DV-Hop localization algorithm using trilateration or maximum likelihood estimation method to calculate the coordinates of the unknown node. After obtaining the estimated distances between the unknown nodes and anchor nodes, the initial position estimation is achieved based on the sampling. Then, the evolutionary programming based position resample is carried out. Finally, the final estimated position of the unknown node is obtained through an iterative manner. Simulation results show that EPRDV-Hop algorithm effectively improves the positioning accuracy of the node without additional hardware.]]>Sun, L., J. Li and Y. Chen,2005Niculescu, D. and B. Nath,2003Zhang, A., X. Ye, H. Hu and X. Ding,2012Wen, J., X. Fan and X. Wu,2014Xiao, L. and X. Liu,2012Feng, J., Q. Zhu and C.C. Wu,2012Wang, Y. and H.Y. Shi,2012Wang, X.S., Y.J. Zhao and H.T. Li,2011Lu, Q., M. Bai, W. Zhang and E. Lian,2011Li, W. and W. Zhou,2011Li, M., W. Xiong and L. Guo,2013Fogel, D.B. and L.J. Fogel,1996