无线网络中基于到达时间和的球面相交定位算法  

The TSOA based spherical intersection localization algorithm in wireless Networks

作　　者：华惊宇[1,2] 郑志龙[1] 任宏亮[1] 孟利民[1] 江彬[2] 

机构地区：[1]浙江工业大学通信网应用技术研究省重点实验室,浙江杭州310023 [2]东南大学移动通信国家重点实验室,江苏南京210096

出　　处：《浙江工业大学学报》2013年第5期552-557,共6页Journal of Zhejiang University of Technology

基　　金：浙江省科技厅基金资助项目(2012R1011-12);东南大学移动通信国家重点实验室开放课题(2010D06)的资助

摘　　要：低复杂度的可靠无线定位算法是未来物联网的重要应用技术,获得了持续的关注.其中基于到达时间差(TDOA)的两次最大似然算法性能可靠但复杂度较高,因此这里研究了一种新的无线定位算法以解决这一矛盾.该算法采用球面相交(SX)原理,基于到达时间和(TSOA)展开推导,所获得的定位方法具有较低复杂度并可提供可靠的位置估计.算法验证采用门特卡罗仿真,结果表明:笔者所提出算法在不同移动台位置处均具有较高估计精度,且性能逼近甚至超越复杂度较高的TDOA最大似然算法.The reliable and low-complexity location estimation is an important technique for the future wireless network, which has attracted much attention for a long time. Generally, the two stage maximum likelihood （TSML） method based on the time difference of arrival （TDOA） presents a reliable estimation but a large complexity. Thus, this paper puts forward a novel method to account for the above contradiction, where it exploits the spherical intersection （SX） principle and the time sum of arrival （TSOA）, resulting in a reliable localization algorithm with lower computations. The proposed method is tested by the Monte Carlo simulation, and the result shows that the proposed algorithm yields good performance for different mobile station （MS） locations. Moreover, this performance is also comparable with that of the TDOA ML method.

关 键 词：无线定位 到达时间和 球面相交算法 无线网络 

分 类 号：TN929.533[电子电信—通信与信息系统]