一种改进的加权质心自定位算法  

An improved weighted-centroid self-localization algorithm

作　　者：王洪元[1,2] 蒋燕蓉[1,2] 焦筱悛 杨小英[1] 吴冲[1] 

机构地区：[1]常州大学信息科学与工程学院,江苏常州213164 [2]常州市过程感知与互联技术重点实验室,江苏常州213164

出　　处：《计算机与应用化学》2014年第3期263-267,共5页Computers and Applied Chemistry

基　　金：国家自然科学基金项目(61070121;60973094);江苏省产学研前瞻性联合研究项目:基于物联网的数字油田关键技术及其应用研究(BY2012097)

摘　　要：针对加权质心算法无法改善所需锚节点比例较高的缺点,本文提出了一种将已定位节点升级为锚节点以及利用多跳距离外的锚节点进行定位的改进算法。为克服定位误差随着迭代次数的增加而不断累加问题,根据具体情况设计门限值ξ_(th)和改变已知节点的权值来对已定位的节点进行约束。仿真结果表明:与加权质心算法相比,本算法在锚节点比例很低的情况下就能实现较低的平均定位误差和较高的网络覆盖率,仅需较少的通信和简单的计算即可实现较高的定位精度,因此改进后的算法非常适用于功耗小,锚节点比例比较低的场合。According to the weighted centroid algorithm cannot improve the required anchor node proportion is higher, an improved algorithm is proposed by making the located nodes as anchor nodes and using the anchor node multi-hop distance. In order to overcome the localization error with the increase in the number of iterations and constantly accumulating problems, according to the specific situation of design threshold value Sth and change the known node weights to constrain the node has been for positioning. Computer simulation show that, compared with the weighted centroid algorithm, this algorithm can achieve the average positioning error of low and high coverage rate in the condition of the low anchor node proportion, only a few communication and simple calculation can achieve high positioning accuracy, so the improved algorithm is very suitable for small power consumption, relatively low proportion of anchor node occasion.

关 键 词：加权质心算法 锚节点 多跳距离 自定位算法 

分 类 号：TQ015.9[化学工程] TP391.9[自动化与计算机技术—计算机应用技术]