iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S11277-018-6084-8
An Improved DV-Hop Scheme Based on Path Matching and Particle Swarm Optimization Algorithm | Wireless Personal Communications Skip to main content
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Belli, L., Cirani, S., Davoli, L., Ferrari, G., Melegari, L., & Picone, M. (2016). Applying security to a big stream cloud architecture for the internet of things. International Journal of Distributed Systems and Technologies, 7(1), 37–58.

    Article  Google Scholar 

  2. Shahra, E. Q., Sheltami, T. R., & Shakshuki, E. M. (2017). A comparative study of range-free and range-based localization protocols for wireless sensor network: Using COOJA simulator. International Journal of Distributed Systems and Technologies, 8(1), 1–16.

    Article  Google Scholar 

  3. Stanoev, A., Filiposka, S., In, V., & Kocarev, L. (2016). Cooperative method for wireless sensor network localization. Ad Hoc Networks, 40, 61–72.

    Article  Google Scholar 

  4. Singh, S. P., & Sharma, S. (2015). Range free localization techniques in wireless sensor networks: A review. Procedia Computer Science, 57, 7–16.

    Article  Google Scholar 

  5. Mao, G., Fidan, B., & Anderson, B. D. O. (2007). Wireless sensor network localization techniques. Computer Networks, 51(10), 2529–2553.

    Article  MATH  Google Scholar 

  6. Almuzaini, K. K., & Gulliver, A. (2010). Range-based localization in wireless networks using density-based outlier detection. Wireless Sensor Network, 2(11), 807–814.

    Article  Google Scholar 

  7. Li, M., & Liu, Y. H. (2010). Rendered path: Range-free localization in anisotropic sensor networks with holes. IEEE/ACM Transaction Networks., 18(1), 320–332.

    Article  Google Scholar 

  8. Bulusu, N., Heidemann, J., & Estrin, D. (2008). GPS-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, 7(5), 28–34.

    Article  Google Scholar 

  9. Niculescu, D., & Nath, B. (2003). DV based positioning in ad hoc networks. Telecommunication Systems, 22(1–4), 267–280.

    Article  Google Scholar 

  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).

  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 

  12. Kumar, S., & Lobiyal, D. K. (2014). Power efficient range-free localization algorithm for wireless sensor networks. Wireless Networks, 20(4), 681–694.

    Article  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).

  14. Zhang, W., Yang, X., & Song, Q. (2015). Improved dv-hop algorithm based on artificial bee colony. International Journal of Control & Automation, 8(11), 135–144.

    Article  Google Scholar 

  15. Yang, X., & Zhang, W. (2016). An improved dv-hop localization algorithm based on bat algorithm. Cybernetics & Information Technologies, 16(1), 89–98.

    Article  Google Scholar 

  16. Wang, Z., & Chen, X. (2015). Node localization of wireless sensor networks based on DV-Hop and Steffensen iterative method. International Journal of Future Generation Communication & Networking, 8(2), 1–8.

    Article  Google Scholar 

  17. Peng, B., & Li, L. (2015). An improved localization algorithm based on genetic algorithm in wireless sensor networks. Cognitive Neurodynamics, 9(2), 249–256.

    Article  MathSciNet  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).

  19. Tomic, S., & Mezei, I. (2016). Improvements of DV-Hop localization algorithm for wireless sensor networks. Telecommunication System, 61(1), 93–106.

    Article  Google Scholar 

  20. Hu, Y., & Li, X. (2013). An improvement of DV-Hop localization algorithm for wireless sensor networks. Telecommunication Systems, 53(1), 13–18.

    Article  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 

  22. Mehrabi, M., Taheril, H., & Taghdiri, P. (2017). An improved DV-Hop localization algorithm based on evolutionary algorithms. Telecommunication Systems, 64, 639–647.

    Article  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).

  25. Langendoen, K., & Reijers, N. (2003). Distributed localization in wireless sensor networks: A quantitative comparison. Computer Networks, 43, 499–518.

    Article  MATH  Google Scholar 

Download references

Acknowledgements

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).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qinqin Shi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shi, Q., Xu, Q. & Zhang, J. An Improved DV-Hop Scheme Based on Path Matching and Particle Swarm Optimization Algorithm. Wireless Pers Commun 104, 1301–1320 (2019). https://doi.org/10.1007/s11277-018-6084-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-018-6084-8

Keywords

Navigation