基于凸半定规划的接收信号强度测距的合作式定位方案  

Convex Semidefinite Programming Based RSS Ranging Cooperative Localization Scheme

作　　者：黎慧[1] 唐友刚[2] 

机构地区：[1]桂林航天工业学院计算机科学与工程系,桂林541004 [2]桂林航天工业学院计算机科学与数理部,桂林541004

出　　处：《科学技术与工程》2016年第19期264-269,共6页Science Technology and Engineering

基　　金：广西自然科学基金(2014GXNSFBA118286)资助

摘　　要：无线传感网中的多类应用均需要准确的定位算法。为了降低定位成本,减少能量消耗,常采用基于接收信号强度RSS（received signal strength）测距;再利用最大似然ML（maximum likelihood）估计法求解节点的位置。然而,ML估计为非线性、非凸性,难以获取全局最优解;为此,提出凸半定规划SDP（semidefinite programming）的合作式定位方案,利用凸半定规划策略将ML估计转换成凸优问题;同时,该方案考虑两类场景：源节点发射功率已知、未知。针对第一类场景,利用半凸松弛策略,并结合最小化最小二乘法,建立凸优表达式,最后利用CVX求解。针对第二类场景,先建立联合ML估计函数,再利用SDP估计,并结合起来简单的三步骤方案进行位置估计。仿真结果表明,提出的SDP算法的定位精度比SD/SOCP-1、SDPRSS平均提高了近15%~20%。此外,提出的SDP算法在所有场景的误差小于3 m的出现概率占0.8,而SD/SOCP-1、SDPRSS算法小于0.5。In the wireless sensor networks,location based applications require an accurate localization algorithm.To locate sensors at a low cost,the received signal strength（ RSS） based ML（maximum likelihood） estimator is used to localization.However,the difficulties in the ML problem are overcome by transforming the original nonconvex and nonlinear problem into a convex one,which is difficult to solve the globally optimal solution.Therefore,the convex semidefinite programming（SDP） localization scheme is proposed for both cases of known and unknown source transmit power.For the first case,applying semidefinite relaxation address the nonconvex problem,following least squares（LS） minimization,and form the SDP problem,which can be readily solved by CVX.For the second case,propose a simple three-step procedure to localization.For all the scenarios presented in this work,the new approach outperforms the state-of-the-art approaches with an increase in the accuracy between 15% ~ 20%on average.Furthermore,the simulation results show that our approach achieves ME less than 3 m in 80% of the cases,while the existing ones accomplish the same accuracy in less than 50% of the cases.

关 键 词：接收信号强度 半定规划 凸松弛 合作式定位 无线传感网 

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