An improved DV-Hop localization algorithm in wireless sensor networks

Yu Ning; Wan Jiangwen; Song Qing; Wu Yinfeng

doi:10.1109/ICIA.2006.305800

An improved DV-Hop localization algorithm in wireless sensor networks

Yu Ning^*
, Wan Jiangwen
, Song Qing
, Wu Yinfeng

^*Corresponding author for this work

Beijing University of Posts and Telecommunications

Research output: Contribution to conference › Paper › peer-review

19 Scopus citations

Abstract

A Limit DV-Hop (LDV-Hop) algorithm is put forward based on comprehensive analysis of DV-Hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDVHop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-Hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.

Original language	English
Pages	638-643
Number of pages	6
DOIs	https://doi.org/10.1109/ICIA.2006.305800
State	Published - 2006
Externally published	Yes
Event	2006 IEEE International Conference on Information Acquisition, ICIA 2006 - Weihai, Shandong, China Duration: 20 Aug 2006 → 23 Aug 2006

Conference

Conference	2006 IEEE International Conference on Information Acquisition, ICIA 2006
Country/Territory	China
City	Weihai, Shandong
Period	20/08/06 → 23/08/06

Keywords

LDV-Hop
Localization
Wireless sensor networks

Access to Document

10.1109/ICIA.2006.305800

Cite this

@conference{b2dfb27d62c145c0afacb6fc9c01adbe,

title = "An improved DV-Hop localization algorithm in wireless sensor networks",

abstract = "A Limit DV-Hop (LDV-Hop) algorithm is put forward based on comprehensive analysis of DV-Hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDVHop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-Hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.",

keywords = "LDV-Hop, Localization, Wireless sensor networks",

author = "Yu Ning and Wan Jiangwen and Song Qing and Wu Yinfeng",

year = "2006",

doi = "10.1109/ICIA.2006.305800",

language = "英语",

pages = "638--643",

note = "2006 IEEE International Conference on Information Acquisition, ICIA 2006 ; Conference date: 20-08-2006 Through 23-08-2006",

}

TY - CONF

T1 - An improved DV-Hop localization algorithm in wireless sensor networks

AU - Ning, Yu

AU - Jiangwen, Wan

AU - Qing, Song

AU - Yinfeng, Wu

PY - 2006

Y1 - 2006

N2 - A Limit DV-Hop (LDV-Hop) algorithm is put forward based on comprehensive analysis of DV-Hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDVHop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-Hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.

AB - A Limit DV-Hop (LDV-Hop) algorithm is put forward based on comprehensive analysis of DV-Hop localization algorithms, in order to satisfy the characters of low cost and low power in WSNs. The least hop number between nodes and landmarks is counted firstly and the distance in hops is then computed. Finally the coordinates of nodes are determined. LDVHop algorithm is simulated in network simulator (Ns-2) and the experimental results are presented. Comparison shows LDV-Hop algorithm is useful to improve the accuracy of localization and reduce the number of communication messages. Different node distributions are discussed to give the result that the algorithm is adaptive to irregular distribution shape of sensor nodes.

KW - LDV-Hop

KW - Localization

KW - Wireless sensor networks

UR - https://www.scopus.com/pages/publications/46249090532

U2 - 10.1109/ICIA.2006.305800

DO - 10.1109/ICIA.2006.305800

M3 - 论文

AN - SCOPUS:46249090532

SP - 638

EP - 643

T2 - 2006 IEEE International Conference on Information Acquisition, ICIA 2006

Y2 - 20 August 2006 through 23 August 2006

ER -

An improved DV-Hop localization algorithm in wireless sensor networks

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this