An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm

Authors

  • Xiaoying Yang
  • Wanli Zhang
  • Qixiang Song

DOI:

https://doi.org/10.3991/ijoe.v11i9.5059

Keywords:

wireless sensor network, DV-Hop algorithm, shuffled frog leaping algorithm, positioning error

Abstract


According to that node localization accuracy is not high in the DV Hop localization algorithm, shuffled frog leaping algorithm with many advantages such as the convergence speed is fast, easy to realize and excellent performance of global optimization and so on is introduced into the design of DV-Hop algorithm. A new DV-Hop algorithm based on shuffled frog leaping algorithm (Shuffled Frog Leaping DV-Hop Algorithm, SF LA DV-Hop) is proposed in this paper. Based on traditional DV-Hop algorithm, the new algorithm used distance of nodes and position information of anchor nodes to establish objective optimization function and realize the estimation of unknown node coordinate in the final stage of DV-Hop algorithm. The simulation results showed that compared with the traditional DV-Hop algorithm, based on not increasing the sensor node hardware overhead, the improved algorithm can effectively reduce the positioning error.

Downloads

Published

2015-10-29

How to Cite

Yang, X., Zhang, W., & Song, Q. (2015). An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm. International Journal of Online and Biomedical Engineering (iJOE), 11(9), pp. 17–21. https://doi.org/10.3991/ijoe.v11i9.5059