2013•Telecommunication SystemsOpen access

An improvement of DV-Hop localization algorithm for wireless sensor networks

Yu Hen Hu, Xuemei Li

Open full text 84 citations

Abstract

An improved DV-HOP localization algorithm is proposed based on the traditional DV-HOP localization algorithm in the paper. There will be a big error that using the nearest anchor node’s average hop distance instead of the average hop distance of all the anchor nodes that involved in the localizing in the traditional DV-HOP localization algorithm. Therefore, the improved algorithm introduces threshold M , it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the new localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm in the wireless sensor networks.

Open-access reader

About this research paper

What this paper is about

An improved DV-HOP localization algorithm is proposed based on the traditional DV-HOP localization algorithm in the paper. There will be a big error that using the nearest anchor node’s average hop distance instead of the average hop distance of all the anchor nodes that involved in the localizing in the traditional DV-HOP localization algorithm. Therefore, the improved algorithm introduces threshold M , it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the new localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm in the wireless sensor networks.

Why it matters

OpenAlex reports 84 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

An improved DV-HOP localization algorithm is proposed based on the traditional DV-HOP localization algorithm in the paper. There will be a big error that using the nearest anchor node’s average hop distance instead of the average hop distance of all the anchor nodes that involved in the localizing in the traditional DV-HOP localization algorithm. Therefore, the improved algorithm introduces threshold M , it uses the weighted average hop distances of anchor nodes within M hops to calculate the average hop distance of unknown nodes. In addition, the positioning results are corrected in the improved algorithm. The simulation results show that the new localization algorithm effectively improves the positioning accuracy compared with the traditional DV-HOP localization algorithm, it is an effective localization algorithm in the wireless sensor networks.

Key concepts: Hop (telecommunications), Computer science, Wireless sensor network, Algorithm, Wireless, Computer network, Telecommunications

Related papers

Back to paper searchBrowse research topicsOriginal source
An improvement of DV-Hop localization algorithm for wireless sensor networks — Research Paper | ScholarLens