移动节点路径规划和几何限制的无线传感器网络定位算法  

Localization Algorithm Based on Mobile Node Path Planning and Geometric Constraint for Wireless Sensor Network

作　　者：梁涛[1] 陈雄[1] 孔庆生[1] 

机构地区：[1]复旦大学信息科学与工程学院电子工程系,上海200433

出　　处：《信息与控制》2011年第5期577-582,共6页Information and Control

摘　　要：提出一种利用移动节点的无需测距的无线传感器网络定位算法.该算法中,移动节点以垂直路径两次穿过未知节点通信半径范围,从而获得通信区域边界附近多个航标位置;航标点连线的中垂线形成几何限制区域,该区域中心即为未知节点的估计位置.与其它基于几何限制区域的算法相比,本算法计算复杂度低、定位精度高.仿真实验结果显示本算法相比于其它算法,定位精度提高10%～40%不等.A range-free localization algorithm using mobile nodes for wireless sensor network（WSN） is proposed.In this algorithm,a mobile node travels across the communication range of the unknown node in two vertical paths,and gets some beacon localizations near the border of communication range.A geometric constraint area is formed by the perpendicular bisector of the segments connecting beacon points.The center of the area is the estimated location of the unknown node. Comparing with other methods based on geometric constraint,the proposed method provides lower computation complexity and higher localization accuracy.Simulation experiment results show that the proposed method outperforms other methods by 10%to 40%in localization accuracy.

关 键 词：定位 无需测距 移动节点 路径规划 无线传感器网络 

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