Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2012, Vol. 35 ›› Issue (6): 44-49.doi: 10.13190/jbupt.201206.44.zhengjp

• Papers • Previous Articles     Next Articles

A Novel DV-Hop Localization Algorithm Based on the Connectivity Differences of Sensor Nodes

ZHENG Ji-ping, ZHANG Yong-ping, ZHAO Guo-an, ZHANG Hui   

  1. 1. College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China
  • Received:2012-07-17 Revised:2012-09-03 Online:2012-12-28 Published:2013-01-07
  • Contact: ZHANG yongping E-mail:zhangyongping@nuaa.edu.cn

Abstract:

A new localization algorithm named connectivity differences distance vector-hop algorithm (CDA DV-Hop) is proposed based on connectivity differences of sensor nodes. First, by estimating the reversing positions of the anchor nodes, the average hop of distance of anchor nodes is refined and the accumulated errors are reduced. Then, according to the characteristic of the similar connectivity in proximate position, limitations of the maximum and minimum of different locations are given under the same unknown node, thus limiting those positions that are beyond the sensing area and calculating the connectivity differences. Finally, the ultimate estimated position is chosen from the candidate positions in which the connectivity difference value is the smallest. Experiments show that, under the same conditions, the proposed CDA DV-Hop algorithm achieves a better precision compared with existing distance vector-hop (DV-Hop) algorithms.

Key words: sensor networks, localization, reversed position estimation, accumulated errors, connectivity differences

CLC Number: