基于稀疏傅里叶变换和RSSI测距的低复杂度RSSI定位算法  

A sparse fourier algorithm and RSSI ranging based lowcomplexity RSSI positioning algorithm

作　　者：王宇鹏 代玉 王乐宁 WANG Yu-peng;DAI Yu;WANG Le-ning(College of Electronic and Information Engineering,Shenyang Aerospace University,Shenyang 110136,China;Inspection Department,Flight Inspection Center of CAAC,Beijing 100000,China)

机构地区：[1]沈阳航空航天大学电子信息工程学院,沈阳110136 [2]中国民用航空飞行校验中心校验部,北京100000

出　　处：《沈阳航空航天大学学报》2020年第3期55-61,共7页Journal of Shenyang Aerospace University

基　　金：辽宁省教育厅重点攻关项目(项目编号:JYT19008);辽宁省自然科学基金(项目编号:2019-ZD-0220);中国民用航空局2019年度民航安全监管能力建设项目。

摘　　要：无线定位技术因价格低廉、覆盖面广、资源利用率高且不需要额外添加设备等优点被广泛应用于军事、医疗、救灾等多个领域。针对降低无线定位算法复杂度问题,提出一种基于稀疏傅里叶变换的低复杂度接收信号强度差(Received Signal Strength Indicator,RSSI)定位算法。通过加入稀疏傅里叶变换采样锚节点的方法来解决现有RSSI定位算法涉及锚节点数量多、复杂度高等问题。仿真实验表明,该算法有效地降低了传统RSSI定位算法的复杂度,实现了复杂度与定位精度之间的有效折衷。Wireless positioning technology has been widely used in military,medical,disaster relief,and other fields due to its advanced natures including low price,wide coverage,high resource utilization,and easy-deployed. In order to reduce the complexity of wireless positioning algorithm,by involving sparse Fourier transform,this paper proposes a low-complexity Received Signal Strength Indicator( RSSI) localization algorithm. By adding the sparse Fourier transform sampling anchor node,we would like to solve the problem of existing RSSI positioning algorithmswhich suffer fromlarge number of anchor nodes and high complexity. Simulation experiments demonstratethat the proposed algorithm canreduce the complexity of the traditional RSSI positioning algorithm effectively and achieve an effective compromise between complexity and positioning accuracy.

关 键 词：无线定位技术 低复杂度 RSSI 稀疏傅里叶变换 定位算法 

分 类 号：TN98[电子电信—信息与通信工程]