Abstract

Least squares estimation is a widely-used technique for range-based source localization, which obtains the most probable position of mobile station. These methods cannot provide desirable accuracy in the case with a non line of sight (NLOS) path between mobile station and base stations. To circumvent this drawback, many algorithms have been proposed to identify and mitigate this error; however, they have a large run-time overhead. On the other hand, new positioning systems utilize a large set of base stations, and a practical algorithm should be fast enough to deal with them. In this paper, we propose a novel algorithm based on subspace method to identify and eliminate the NLOS error. Simulation studies show that our algorithm is faster and more accurate compared with other conventional methods, especially in the large-scale cases.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call