Abstract

Mobile location technologies have drawn much attention to cope with the mass demands of wireless communication services. Although clustering spatial data is viewed as an effective way to access the objects located in a physical space, little has been done in estimating mobile location. In wireless communication, one of the main problems with accurate location is nonline of sight (NLoS) propagation. To solve the problem, we present a new location algorithm with clustering technique by utilizing the geometrical feature of cell layout, time of arrival range measurements, and three base stations. The mobile location is estimated by solving the optimal solution of the objective function based on the high density cluster. Furthermore, our proposed algorithm only needs three range measurements and does not distinguish between NLoS and LoS environments. Simulations study was conducted to evaluate the performance of the algorithm for different NLoS error distributions and various upper bound of NLoS error. The results of our experiments demonstrate that the proposed algorithm is significantly more effective in location accuracy than range scaling algorithm, linear lines of position algorithm, and Taylor series algorithm, and also satisfies the location accuracy demand of E-911.

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