一种基于连通度的无线传感器网络节点定位算法  

A Node Localization Algorithm Based on Connectivity in Wireless Sensor Networks

作　　者：向满天[1] 史浩山[1] 李立宏[2] 

机构地区：[1]西北工业大学电子信息学院,西安710072 [2]南昌大学软件学院,南昌330029

出　　处：《传感技术学报》2007年第10期2308-2312,共5页Chinese Journal of Sensors and Actuators

基　　金：教育部博士点基金项目资助(20050699037);中国下一代互联网示范工程(CNGI)移动奥运项目资助(CNGI-04-17-2A)

摘　　要：无线传感器网络的节点定位算法中,LCO算法将节点间具有连通度的通信连接视为对节点位置的约束,并由此确定节点的位置估计.提出了一种改进的分布式节点定位算法LAI(Localization with All Nodes and Iteration),结合不具有连通度的节点位置关系进行定位.仿真实验结果表明,改进算法相对于LCO算法,提高了定位估计的准确性,减小了对于锚节点的依赖程度.Among the algorithms for localization in Wireless Sensor Networks, LCO(Localization with Convex Optimization) algorithm is based on connectivity-induced constraints and relies on neighborhood relationships to estimate unknown node positions. An improved distributed algorithm named LAI(Localization with All Nodes and Iteration) by incorporating non-neighbor constraints on the node positions has been proposed. Empirical evaluation of the algorithm for several numerical examples is also included. The simulation result indicates one can substantially improve the accuracy of location estimation and reduce the number of anchor nodes as compared to only utilizing neighbor relationships with connectivity.

关 键 词：无线传感器网络 连通度 LCO LAI 分布式节点定位 

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