检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:石欣[1] 李艳萍[1] 高鹏[1] 柏荡[1] 谢思佳[1]
出 处:《仪器仪表学报》2012年第11期2615-2621,共7页Chinese Journal of Scientific Instrument
基 金:国家工信部2011年物联网发展专项资金;国家科技重大专项(2011BAJ03B13)资助项目
摘 要:DV-HOP(distance vector-hop)定位算法中,未知节点与锚节点之间的距离计算存在误差,引起计算坐标与实际位置偏离,影响定位精度。针对这一问题,提出一种基于隶属度的二次求精矢量跳距定位算法,采用对应的锚节点跳距校正值计算节点间距离,减小计算误差;运用自动控制理论中反馈控制原理,将未知节点与锚节点的距离范围信息作为输入量,未知节点的估计坐标信息作为输出量,通过隶属度函数进行偏差分析,二次求精校正未知节点位置。通过仿真对算法性能进行对比分析,结果表明该算法具有较高的定位精度;并通过应用环境测试,验证了算法的可行性。In DV-HOP(distance vector-hop)localization algorithm, errors exist in the calculation of the distance between unknown nodes and anchor nodes, which cause the calculated coordinates to deviate from the actual location and decrease the positioning accuracy. To solve the problem, a twice-refinement DV-HOP localization algorithm based on membership is proposed. Corresponding anchor node hop distance correction value is adopted to calculate the distance between the nodes, and the calculation error is reduced. According to the feedback control principle in automatic control theory, taking the distance range information between unknown node and anchor nodes as input, and the estimated coordinate information of the unknown node as output, deviation analysis is carried out using membership function; finally the position of the unknown node is corrected through twice-refinement to meet the requirement of localization precision. Comparison and analysis of the algorithm performance were carried out with simulation; and simulation results show that the proposed algorithm achieves high positioning accuracy. The proposed localization algorithm was tested in real environment, and test results verify the feasibility of the algorithm.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175