基于代数重建法的DV-Hop定位算法  

DV-Hop Localization Algorithm Based on Algebraic Reconstruction Technique

作　　者：杨智锋[1] 裴腾达[2] 裴炳南[1] 陈微微[1] 

机构地区：[1]大连大学信息工程学院,大连116622 [2]吉林大学莱姆顿学院,长春130012

出　　处：《计算机工程》2010年第15期117-119,共3页Computer Engineering

基　　金：大连市信息产业局IT专项基金资助项目"工业以太网的外包模式与应用"

摘　　要：针对运用最小二乘法求解DV-Hop定位算法带来的节点定位误差较大的问题,提出基于代数重建法的DV-Hop定位算法,运用一种由图象重建问题而引入的逐次迭代算法——代数重建法。仿真结果表明,改进算法能降低无线传感器网络中节点的平均定位误差。In the field of wireless sensor network self-localization,positioning accuracy of sensor node is directly related to the collection of data availability.Concerning the weak point of node average localization error,based on DV-Hop localization algorithm of the least square method principle,method of algebra reconstruction techniques is introduced.Core idea of the algorithm is used as successive iterative algorithm from the problem of image reconstruction,algebra reconstruction.Simulation result proves that the improved algorithm a obviously reduces the average localization error of the node in the Wireless Sensor Network（WSN）.

关 键 词：无线传感器网络 DV-HOP算法 代数重建法 最小二乘法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]