التفاصيل البيبلوغرافية
| العنوان: |
Wi-Fi RTT Ranging Performance Characterization and Positioning System Design. |
| المؤلفون: |
Ma, Chengqi, Wu, Bang, Poslad, Stefan, Selviah, David R. |
| المصدر: |
IEEE Transactions on Mobile Computing; Feb2022, Vol. 21 Issue 2, p740-756, 17p |
| مصطلحات موضوعية: |
SYSTEMS design, INDOOR positioning systems, WIRELESS Internet, TRAJECTORY optimization, TRANSMITTERS (Communication), KALMAN filtering |
| مستخلص: |
The aim of this research is to implement a precise Wi-Fi indoor positioning system (IPS) or localization system based upon the IEEE 802.11mc fine-timing measurement (FTM) scheme also known as the Wi-Fi round trip time (RTT) ranging technique, where ranging refers to a sub-process of positioning that determines the distance between a transmitter and receiver. Our system and its algorithms were implemented using a COTS (Commercial-Off-The-Shelf) smartphone and Wi-Fi access points. Experiments were conducted in several real-life indoor environments. This paper presents the detailed Wi-Fi RTT ranging performance of these devices in different system configurations and characterizes the systematic biases and noise model to improve the ranging accuracy. A novel three-step-positioning method is proposed to overcome the issues of no or multiple intersect points in trilateration due to ranging errors to improve positioning accuracy. This consists of the following: 1) systematic bias determination and removal; 2) clustering-based trilateration (CbT) supported by weighted concentric circle generation (WCCG), namely CbT & WCCG; 3) positioning result and trajectory optimization using a Kalman filter. As a result, the evaluation experiments gave a position accuracy of ±1.2 m in 2D static positioning and ±1.3 m for dynamic motion tracking. Also, our CbT & WCCG method demonstrate good tolerance against ranging errors. Moreover, the computational cost and positioning accuracy of CbT & WCCG methods are compared with least square (LS) and recursive least square (RLS) methods and the accuracy standard deviation of our algorithm is the closest to the Cramer–Rao bound (CRB). [ABSTRACT FROM AUTHOR] |
|
Copyright of IEEE Transactions on Mobile Computing is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
