Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2009, Vol. 35 ›› Issue (3): 145-147,. doi: 10.3969/j.issn.1000-3428.2009.03.050

• Networks and Communications • Previous Articles     Next Articles

Hop-based Refinement Algorithm for Localization in Wireless Sensor Networks

GUO Yong-hong1, WAN Jiang-wen2, YU Ning1, FENG Ren-jian2   

  1. (1. Automation School, Beijing University of Posts and Telecommunications, Beijing 100876; 2. School of Instrument Science & Opto-electronics Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-02-05 Published:2009-02-05

基于跳数的无线传感器网络定位求精算法

郭永红1,万江文2,于 宁1,冯仁剑2   

  1. (1. 北京邮电大学自动化学院,北京 100876;2. 北京航空航天大学仪器科学与光电工程学院,北京 100083)

Abstract: Accumulation of node localization error and distance measurement(or calculation) error between nodes restrict the benefit of iterative refinement of node localization in Wireless Sensor Networks(WSN). In order to improve the precision of node localization effectively, this paper proposes a hop-refinement and relative confidence based on Weight Least Square(WLS) algorithm. Hop-refinement increases redundancy for node location. Relative confidence declines accumulation of error. Application of hop-refinement in robust positioning algorithm brings forward RP-Hop algorithm. Simulation results show that localization precision increases by 10% compared with Robust Positioning algorithm.

Key words: Wireless Sensor Network(WSN), node localization, iterative refinement, Weight Least Squares(WLS)

摘要: 节点本身的定位误差和节点间距离测量(或计算)误差的积累限制了无线传感器网络节点定位循环求精的功效。为有效提高定位精度,在继承加权最小二乘法优点的基础上,提出基于跳数的求精和与其相对应的节点相对置信度方法。增加节点定位计算的冗余度,可有效减小误差积累。将该方法应用于Robust Positioning定位算法中,构成一种新的RP-Hop定位算法。仿真实验结果表明,节点的定位精度可提高约10%。

关键词: 无线传感器网络, 节点定位, 循环求精, 加权最小二乘法

CLC Number: