The emerging technologies related to mobile data especially CDR data has great potential for mobility and transportation applications. However, it presents some challenges due to its spatio-temporal characteristics and sparseness. Therefore, in this article, we introduced a new model to refine the positioning accuracy of mobile devices using only CDR data and coverage areas locations. The adopted method has three steps: first, we discovered which model of movement (Move, Stay) is associated with the coverage areas where the mobile device was connected using a Kalman filter. Then, simultaneously we estimated the location or the position of the device. Finally, we applied map-matching to bring the positioning to the right road segment. The results are very encouraging; nevertheless, there is some enhancement that can be done at the level of movement models and map matching. For example by introducing more sophisticated movement model based on data-driven modeling and a map matching that uses the movement model type detected by matching "Stay" location to buildings and "Move" model to roads.
In the same category, we a have the same method Sequential Monte Carlo (SMC) used in a different manner presented in @cite_6 , where the authors tried to enhance the application of SMC by making it robust regarding the localization estimation even if the range measurement error is high and unpredictable. The testing of the algorithm was done using a simulation and the results showed that the approach is capable of improving the localization range from 12 Regarding the methods based on propagation time and signal strength @cite_24 . Signal strength approaches are focused on received signal strength indicators, which reflect the attenuation measurement of the signal in the assumed free space propagation of radio signals. However, the reality might be described as a free space propagation; therefore, it affects the triangulation method for localization.
@cite_24 @cite_6
2103519107 2158350802 1608899808 1989307896
We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the spl lscr sub 1 -norm. A number of recent theoretical results on sparsifying properties of spl lscr sub 1 penalties justify this choice. Explicitly enforcing the sparsity of the representation is motivated by a desire to obtain a sharp estimate of the spatial spectrum that exhibits super-resolution. We propose to use the singular value decomposition (SVD) of the data matrix to summarize multiple time or frequency samples. Our formulation leads to an optimization problem, which we solve efficiently in a second-order cone (SOC) programming framework by an interior point implementation. We propose a grid refinement method to mitigate the effects of limiting estimates to a grid of spatial locations and introduce an automatic selection criterion for the regularization parameter involved in our approach. We demonstrate the effectiveness of the method on simulated data by plots of spatial spectra and by comparing the estimator variance to the Crame spl acute r-Rao bound (CRB). We observe that our approach has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources, as well as not requiring an accurate initialization. Among the various ranging techniques, Radio Signal Strength (RSS) based approaches attract intensive research interests because of its low cost and wide applicability. RSS-based ranging is apt to be affected by the multipath phenomenon which allows the radio signals to reach the destination through multiple propagation paths. To address this issue, previous works try to profile the environment and refer this profile in run-time. In practical dynamic environments, however, the profile frequently changes and the painful retraining is needed. Rather than such static ways of profiling the environments, in this paper, we try to accommodate the environmental dynamics automatically in real-time. The key observation is that given a pair of nodes, the RSS at different spectrum channels will be different. This difference carries the valuable phase information of the radio signals. By analyzing these RSS values, we are able to identify the amplitude of signals solely from the Line-of-Sight (LOS) path. This LOS amplitude is a simple function of the path length (the physical distance). We find that the analysis is a typical non-linear curvature fitting problem that has no general routing algorithms. We prove this problem format is ill-conditioned which has no stable and trustable solutions. To deal with this issue, we further explore the practical considerations for the problem and reform it to a greatly improved conditioning shape. We solve the problem by numerical iterations and implement these ideas in a real-time indoor tracking system called MuD. MuD employs only three TelosB nodes as anchors. The experiment results show that in a dynamic environment where five people move around, the averaged localization error is 1 meter. Compared with the traditional RSS-based approaches in dynamic environment, the accuracy improves up to 10 times. Localization schemes for wireless sensor networks can be classified as range-based or range-free. They differ in the information used for localization. Range-based methods use range measurements, while range-free techniques only use the content of the messages. None of the existing algorithms evaluate both types of information. Most of the localization schemes do not consider mobility. In this paper, a Sequential Monte Carlo Localization Method is introduced that uses both types of information as well as mobility to obtain accurate position estimations, even when high range measurement errors are present in the network and unpredictable movements of the nodes occur. We test our algorithm in various environmental settings and compare it to other known localization algorithms. The simulations show that our algorithm outperforms these known range-oriented and range-free algorithms for both static and dynamic networks. Localization improvements range from 12 to 49 in a wide range of conditions. In this paper we propose a general framework for the uncertainty quantification of quantities of interest for high-contrast single-phase flow problems. It is based on the generalized multiscale finite element method (GMsFEM) and multilevel Monte Carlo (MLMC) methods. The former provides a hierarchy of approximations of different resolution, whereas the latter gives an efficient way to estimate quantities of interest using samples on different levels. The number of basis functions in the online GMsFEM stage can be varied to determine the solution resolution and the computational cost, and to efficiently generate samples at different levels. In particular, it is cheap to generate samples on coarse grids but with low resolution, and it is expensive to generate samples on fine grids with high accuracy. By suitably choosing the number of samples at different levels, one can leverage the expensive computation in larger fine-grid spaces toward smaller coarse-grid spaces, while retaining the accuracy of the final Monte Carlo estimate. Further, we describe a multilevel Markov chain Monte Carlo method, which sequentially screens the proposal with different levels of approximations and reduces the number of evaluations required on fine grids, while combining the samples at different levels to arrive at an accurate estimate. The framework seamlessly integrates the multiscale features of the GMsFEM with the multilevel feature of the MLMC methods following the work in [26], and our numerical experiments illustrate its efficiency and accuracy in comparison with standard Monte Carlo estimates.