基于线性规划的无线传感器网络定位算法  

Location algorithm for wireless sensor networks using linear programming

作　　者：诸燕平[1] 黄大庆[2] 

机构地区：[1]南京航空航天大学信息科学与技术学院 [2]南京航空航天大学无人机研究院,江苏南京210016

出　　处：《华中科技大学学报（自然科学版）》2009年第12期29-32,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：总装备部"十五"国防科学技术预研项目

摘　　要：提出了一种基于信号到达角信息的无线传感器网络节点自身定位算法.本算法在所有节点的坐标轴方向都是未知的假定下,将信号到达角测量值用于计算信号到达差分角信息.将所有节点之间的角度关系表述为一组线性约束条件,并采用极小极大估计将定位问题转化为一个线性规划问题.最后,进行了若干仿真实验,实验中大量未知节点和少量锚节点随机分布于网络中.仿真结果表明,当信号到达角测量误差8°时,本算法仍可取得满意的定位精度.A location algorithm using angle of arrival （AOA） information in wireless sensor networks is proposed. Assuming that all the sensor nodes＇ axial orientations are randomly deployed and unknown, all the AOA measurements are employed to calculate the angle differences of two nodes with respect to the third one. A set of linear constraints using these angle differences are constructed. By adopting minimax estimation criterion, the location problem can be regarded as a linear programming （LP） problem. In order to demonstrate the effectiveness of the proposed method, several simulation examples are also presented, in which a large number of unknown nodes and a very small number of anchors are randomly distributed within an area. Simulations results show that with an additive angle error up to 8°, the proposed method can still achieve good localization accuracy.

关 键 词：无线传感器网络 线性规划 定位 信号到达角 极小极大估计 

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