An Improved DV-Hop Scheme Based on Path Matching and Particle Swarm Optimization Algorithm
- 45 Downloads
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 an unknown 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 comparisons are made 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 node localization accuracy.
KeywordsDV-Hop Node localization Path matching Trilateration Particle swarm optimization algorithm
This work was financially supported by National Nature Science Foundation of China (No. 61103180) and The Collaborative Innovation Foundation of Shanghai Institute of Technology (No. XTCX2018-15).
- 10.Nagpal, R., Shrobe, H., & J. Bachrach. (2003). Organizing a global coordinate system from local information on an ad hoc sensor network. In Proceedings of the 2nd international workshop on information processing in sensor networks (IPSN ‘03). Palo Alto, CA, United States, April 2003 (pp. 1–16).Google Scholar
- 11.Ma, Z., Liu, Y., & Shen, B. (2008). Distributed locating algorithm for wireless sensor networks-MDS-MAP(D). Journal on Communications, 29(6), 58–62.Google Scholar
- 13.Zhang, Y. J., Wang, K., Yuan, S. F., Yang, H., Chen, Z. X., & Ge, L. S. (2012). Research of WSN node localization algorithm based on weighted DV-HOP. In Proceedings of the Chinese control and decision conference (CCDC’2012), Taiyuan, China, May 2012 (pp. 3826–3829).Google Scholar
- 18.Kaur, A., Kumar, P., & Gupta, G. (2016). A novel DV-Hop algorithm based on Gauss–Newton method. In Proceedings of the 4th international conference on parallel, distributed and grid computing (PDGC’2016), Waknilshat, Solan-173234, Himachal Pradesh, India, December 2016 (pp. 625–629).Google Scholar
- 21.Liu, Y., Chen, J., & Xu, Z. (2017). Improved DV-Hop localization algorithm based on bat algorithm in wireless sensor networks. KSII Transactions on Internet and Information Systems, 11(1), 215–236.Google Scholar
- 23.Eslami, M., Shareef, H., Khajehzadeh, M., & Mohamed, A. (2012). A survey of the state of the art in particle swarm optimization. Research Journal of Applied Sciences, Engineering and Technology, 4(9), 1181–1197.Google Scholar
- 24.Dharavath, R., & Dharavath, R. (2016). Entity resolution-based Jaccard similarity coefficient for heterogeneous distributed database. In Proceedings of the 2nd international conference on computer and communication technologies (IC3T ’2015), Hyderabad, India, July 2015 (pp. 497–507).Google Scholar