基于到达时间差的半定松弛规划优化的定位算法

王其华,郭 戈

大连海事大学学报 ›› 2013, Vol. 39 ›› Issue (4) : 59-62.

PDF(520 KB)
PDF(520 KB)
大连海事大学学报 ›› 2013, Vol. 39 ›› Issue (4) : 59-62.
论著

基于到达时间差的半定松弛规划优化的定位算法

  • 王其华1,2,郭 戈1
作者信息 +

Semi-definite relaxation programming  optimization of localization algorithm

  • WANG Qi-hua1,2, GUO Ge1
Author information +
文章历史 +

摘要

针对无线传感器网络中节点定位存在误差较大和不稳定性问题,提出一种半定松弛规划求解定位问题的优化方法.首先,考虑噪音干扰和测距误差,在时间到达差测量模型下,根据最小最大原理建立定位估计优化函数;然后,通过松弛约束把非凸问题优化等价转化为凸问题优化,运用凸优化理论中的半定松弛规划方法求解节点的位置.仿真实验结果表明,该方法可以有效降低定位误差.

Abstract

In order to solve the problems of location positioning errors and unstabitily in wireless sensor network, an effective semidefinite relaxation programming method is proposed. Taking into account measurement noise and errors, this paper addresses the source location optimal estimating function based on minimummaximum theory for the arrival time difference, and then adopts semidefinite programming relaxation principle to solve the localization problem by converting the optimization of nonconvex problem into a convex optimization problem. Simulation results show that the proposed method can effectively reduce the positioning error.

关键词

源定位 / 到达时间差 / 半定规划 / 极大似然估计 / 无线传感网络

Key words

source localization / arrival time difference / semidefinite programming / maximum likelihood estimate / wireless sensor network

引用本文

导出引用
王其华,郭 戈. 基于到达时间差的半定松弛规划优化的定位算法[J]. 大连海事大学学报. 2013, 39(4): 59-62
WANG Qi-hua, GUO Ge. Semi-definite relaxation programming  optimization of localization algorithm[J]. Journal of Dalian Maritime University. 2013, 39(4): 59-62

参考文献

[1]CHEUNG K W, SO H C, MA W K, et al. Least squares algorithms for timeofarrivalbased mobile location[J]. IEEE Transactions on Signal Processing, 2004, 52(4): 1121-1130. [2]BAGGIO A, LANGENDOEN K. Monte Carlo localization for mobile wireless sensor networks[J]. Ad Hoc Networks, 2008, 6(5):718-733. [3]张士庚,曾英佩,陈力军,等.移动传感器网络中定位算法的性能测评[J].软件学报, 2011, 22(7): 1597-1611.  ZHANG Shi-geng, ZENG Ying-pei, CHEN Li-jun, et al. Performance evaluation of localization algorithms for mobile sensor networks[J]. Journal of Software. 2011, 22(7): 1597-1611.( in Chinese) [4]ZHANG Shi-geng,CAO Jian-nong,CHEN Li-jun,et al. Accurate and energyefficient rangefree localization for mobile sensor networks[J]. IEEE Transactions on Mobile Computing, 2010, 9(6): 897-910. [5] MAO Guo-qiang, FIDAN B, ANDERSON B. Wireless sensor networks localization techniques[J]. Computer Networks, 2007, 51(10): 2529-2553. [6] SSU K F, OU C H, JIAU H C.Localization with mobile anchor points in wireless sensor networks[J]. IEEE Transactions on Vehicular Technology, 2005, 54(3): 1187-1197. [7] YANG Ke-hu, WANG Gang, LUO Zhi-quan. Efficient convex relaxation methods for robust target localization by a sensor network using time differences of arrivals[J]. IEEE Transactions on Signal Processing, 2009, 57(7): 2775-2784. [8] QI Yi-hong, KOBAYASHI H, SUDA H. Analysis of wireless geolocationin a nonlineofsight environment[J]. IEEE Transactions on Wireless Communications, 2006, 5(3): 672-681. [9]XIE Sheng-dong,WANG Jin, HU Aiqun,et al.Localization algorithm based on positive semidefinite programming in wireless sensor networks[J]. International Journal of Signal Processing, 2013, 6(1):1-12. [10]XU En-yang, DING Zhi, DASGUPTA S. Target tracking mobile sensor navigation in wireless sensor networks[J]. IEEE Transactions on Mobile Computing, 2013, 12(1): 177-186. [11]KARGER D, MOTWANI R, SUDAN M. Approximate graph coloring by semidefinite programming[J]. Journal of ACM, 1998, 45(2): 246-265. [12]FUENTES L R,QUINTANA V H. Mediumterm hydrothermal coordination by semidefinite programming[J].IEEE Transactions on Power Systems,2003,18(4):1515-1522.

基金

国家自然科学基金资助项目(61273107;61174060);大连市领军人才支持计划项目(2012Z0036);中央高校基本研究项目(3132013334).

PDF(520 KB)

Accesses

Citation

Detail

段落导航
相关文章

/