一种多跳Convex和APIT的改进定位:HCAPIT  

Optimized localization algorithm based on multi-hop Convex and APIT:HCAPIT

作　　者：李伟群[1] 廖鹰[1,2] 齐欢[1] 袁帅[1] 

机构地区：[1]华中科技大学控制科学与工程系,武汉430074 [2]解放军信息工程大学,郑州450001

出　　处：《计算机工程与应用》2012年第5期63-65,共3页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60774036);湖北省自然科学基金重点项目(No.2008CDA063);中央高校基本科研业务费专项资金资助(No.C2009Z025Y)

摘　　要：针对定位算法中信标节点密度低带来的定位精度低以及定位覆盖率低的问题,提出一种基于多跳凸规划和PIT的定位算法HCAPIT。该算法利用未知节点的K跳邻居信标节点信息,采用最佳三角形内点测试法PIT估计未知节点可能存在区域,通过多跳Convex对区域缩小,对节点进行定位。仿真结果表明改进的定位算法更适合信标节点密度低的网络。Aiming at the problems of the low localization accuracy and low localization rate of coverage in Wireless Sensor Networks（WSNs）where the density of anchors is low,an improved algorithm called HCAPIT based on multi-hop Convex positioning algorithm and APIT is proposed.The algorithm makes use of the K-hop neighbors information of the unknown node beacon node,adopts the perfect point-in-triangulation test to estimate the probable area and reduces the area through multi-hop Convex.Simulation experimental results show that the improved algorithm is more suitable for the WSNs where the density of anchors is low.

关 键 词：无线传感器网络 定位 凸规划 近似三角形内点测试法(APIT) 

分 类 号：TN915.04[电子电信—通信与信息系统]