Convex Optimization
Data Fusion of Power and Time Measurements for Mobile Terminal Location
IEEE Transactions on Mobile Computing
Second-Order Cone Programming Relaxation of Sensor Network Localization
SIAM Journal on Optimization
Least squares algorithms for time-of-arrival-based mobile location
IEEE Transactions on Signal Processing
A tutorial on particle filters for online nonlinear/non-GaussianBayesian tracking
IEEE Transactions on Signal Processing
Robust Mobile Location Estimator with NLOS Mitigation using Interacting Multiple Model Algorithm
IEEE Transactions on Wireless Communications
Overview of radiolocation in CDMA cellular systems
IEEE Communications Magazine
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
IEEE Transactions on Signal Processing
Time difference localization in the presence of outliers
Signal Processing
The effects of location personalization on individuals' intention to use mobile services
Decision Support Systems
Hi-index | 0.01 |
In this study, we propose a combined scheme for mobile location estimation in urban areas. First, the proposed scheme employs particle filters to estimate the unobstructed distances traveled by light between base stations (BSs) and the mobile station (MS). Next, according to those estimations of unobstructed distances, which are usually non-Euclidean due to Non-Line of Sight (NLOS) radio propagations, the locating problem is formulated as a non-convex and unconstrained optimization problem with the proposed mixed Manhattan/Euclidean norm. The solution to such a non-convex and unconstrained optimization problem serves as a more accurate estimation of the location of MS. The advantage of the proposed mobile location estimation method is that this method can be applied to both LOS and NLOS propagations and there is no need to reconstruct the Euclidean distances between BSs and the MS from mostly non-Euclidean distances so that the reconstruction error can be avoided and a more accurate mobile location estimation can be achieved. Finally, a convex and constrained optimization problem is introduced to approximate the non-convex and unconstrained optimization problem since the convex optimization problems can be solved very efficiently nowadays.