2015•International Journal of Online and Biomedical Engineering (iJOE)Open access

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

Xiaoying Yang, Wanli Zhang, Qixiang Song

Open full text 10 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Hop (telecommunications), Algorithm, Computer science, Optimization algorithm, Node (physics), Mathematics, Mathematical optimization, Engineering

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved DV-Hop Algorithm Based on Shuffled Frog Leaping Algorithm — Research Paper | ScholarLens