Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (5): 63-65.

• 网络、通信、安全 • Previous Articles     Next Articles

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

LI Weiqun1, LIAO Ying1,2, QI Huan1, YUAN Shuai1   

  1. 1.Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
    2.PLA Information Engineering University, Zhengzhou 450001, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2012-02-11 Published:2012-02-11

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

李伟群1,廖 鹰1,2,齐 欢1,袁 帅1   

  1. 1.华中科技大学 控制科学与工程系,武汉 430074
    2.解放军信息工程大学,郑州 450001

Abstract: 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.

Key words: Wireless Sensor Networks(WSNs), location, Convex, Approximate Point-In-Triangulation Test(APIT)

摘要: 针对定位算法中信标节点密度低带来的定位精度低以及定位覆盖率低的问题, 提出一种基于多跳凸规划和PIT的定位算法HCAPIT。该算法利用未知节点的K跳邻居信标节点信息,采用最佳三角形内点测试法PIT估计未知节点可能存在区域,通过多跳Convex对区域缩小,对节点进行定位。仿真结果表明改进的定位算法更适合信标节点密度低的网络。

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