ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2019, Vol. 56 ›› Issue (3): 585-593.doi: 10.7544/issn1000-1239.2019.20170841

• 信息安全 • 上一篇    下一篇

基于校正矢量的分布式DV-Hop求精算法

林维维,姚英彪,邹柯,冯维,严军荣   

  1. (杭州电子科技大学通信工程学院 杭州 310018) (lsy001h@126.com)
  • 出版日期: 2019-03-01
  • 基金资助: 
    国家自然科学基金项目(61671192);中国博士后科学基金项目(2017M621796);杭州电子科技大学2017年研究生科研基金项目(CXJJ2017030)

Correction Vector Based Distributed DV-Hop Localization Refinement Algorithm

Lin Weiwei, Yao Yingbiao, Zou Ke, Feng Wei, Yan Junrong   

  1. (School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018)
  • Online: 2019-03-01

摘要: 节点定位技术是当前无线传感器网络研究的热点之一.基于跳距估计的DV-Hop(distance vector hop)定位算法是无需测距定位算法的典型代表,它具有算法简单、易实现等优点,但也存在定位模糊、定位精度不高的缺点.针对DV-Hop算法的定位模糊问题,提出一种基于校正矢量的分布式迭代求精算法(correction vector based distributed localization refinement algorithm, CVLR).在DV-Hop定位完成后,CVLR利用节点与其邻居节点间的伪测距距离和定位距离构建位置校正矢量,然后将求精过程建模为使这2个距离的差值的平方和在校正矢量方向上的最小化问题,最后用一种简单的迭代搜索算法求解该最小化问题.CVLR实现过程中,分为仅利用1跳邻居节点信息的CVLR1和同时利用1跳和2跳邻居节点信息的CVLR2.仿真结果表明:与DV-Hop,DV-RND (an improved DV-Hop localization algorithm based on regulated neighborhood distance),DV-EA (an improved DV-Hop localization algorithm based on evolutionary algorithm)相比,CVLR1的定位精度平均提高30%,25%,20%,CVLR2的定位精度平均提高45%,42%,40%.

关键词: 无线传感器网络, DV-Hop, 校正矢量, 迭代求精, 搜索方法

Abstract: Node location technology is one of the hot topics in current wireless sensor networks(WSNs). The DV-Hop (distance vector hop) localization algorithm, based on the hop distance estimation, is a typical representation of range-free localization algorithm. The advantages of DV-Hop is simple and easy implementation, and its disadvantage is low positioning accuracy which is resulting from the hop-distance ambiguity problem. Focusing on the hop-distance ambiguity problem of the traditional DV-Hop localization algorithm, this paper proposes a correction vector based distributed localization refinement algorithm (CVLR). Firstly, based on the localization results of DV-Hop, CVLR constructs the position correction vector using the pseudo ranging distance and the positioning distance between neighbors and unknown nodes. Secondly, the refinement process is modeled to minimize the square sum of the difference between the two distances in the direction of correction vector. Finally, a simple iterative search method is proposed to solve above minimization problem. In practice, CVLR consists of CVLR1 and CVLR2. CVLR1 can make full use of the information of 1-hop neighbors, and CVLR2 can make full use of the information of 1-hop and 2-hop neighbors. The simulation results show that, compared with DV-Hop, DV-RND (an improved DV-Hop localization algorithm based on regulated neighborhood distance), and DV-EA (an improved DV-Hop localization algorithm based on evolutionary algorithm), CVLR1 improves the positioning accuracy by about 30%, 25%, and 20%, and CVLR2 improves the positioning accuracy by about 45%, 42%, and 40%, on average.

Key words: wireless sensor networks, DV-Hop, correction vector, iterative refinement, search method

中图分类号: