One major bottleneck in the practical implementation of received signal strength (RSS) based indoor localization systems is the extensive deployment efforts required to construct the radio maps through fingerprinting. In this paper, we aim to design an indoor localization scheme that can be directly employed without building a full fingerprinted radio map of the indoor environment. By accumulating the information of localized RSSs, this scheme can also simultaneously construct the radio map with limited calibration. To design this scheme, we employ a source data set that possesses the same spatial correlation of the RSSs in the indoor environment under study. The knowledge of this data set is then transferred to a limited number of calibration fingerprints and one or several RSS observations with unknown locations, in order to perform direct localization of these observations using manifold alignment. We test two different source data sets, namely a simulated radio propagation map and the environments plan coordinates. For moving users, we exploit the correlation of their observations to improve the localization accuracy. The online testing in two indoor environments shows that the plan coordinates achieve better results than the simulated radio maps, and a negligible degradation with 70-85 reduction in calibration load.
In @cite_9 @cite_2 , LANDMARK and LEASE proposed an adaptive offset of the RSS variations using deployed reference sniffers. This approach adapts the radio map to environmental dynamics using real-time samples, but still requires an initial map to start with. Moreover, it has been shown to be successful only with densely distributed reference sniffers. @cite_3 proposed LEMT that learns the functional relationship between the initial map and real-time readings (again from deployed sniffers) using nonlinear regression analysis and model trees, then applies nearest neighbor based method to find locations. LEMT requires less reference sniffers than LANDMARK and LEASE and can achieve a more effective accommodation of RSS variation. However, LEMT requires extensive processing after each RSS sniffing period by building a huge number of trees in each of them.
@cite_9 @cite_3 @cite_2
2112805769 2158350802 2964209717 2901105864
With the technical advances in ubiquitous comput- ing and wireless networking, there has been an increasing need to capture the context information (such as the location) and to figure it into applications. In this paper, we establish the theoreti- cal base and develop a localization algorithm for building a zero- configuration and robust indoor localization and tracking system to support location-based network services and management. The localization algorithm takes as input the on-line measurements of received signal strengths (RSSs) between 802.11 APs and between a client and its neighboring APs, and estimates the location of the client. The on-line RSS measurements among 802.11 APs are used to capture (in real-time) the effects of RF multi-path fading, temperature and humidity variations, opening and closing of doors, furniture relocation, and human mobility on the RSS measurements, and to create, based on the truncated singular value decomposition (SVD) technique, a mapping between the RSS measure and the actual geographical distance. The proposed system requires zero-configuration because the on-line calibration of the effect of wireless physical characteristics on RSS measurement is automated and no on-site survey or initial training is required to bootstrap the system. It is also quite responsive to environmental dynamics, as the impacts of physical characteristics changes have been explicitly figured in the mapping between the RSS measures and the actual geographical distances. We have implemented the proposed system with inexpensive off-the-shelf Wi-Fi hardware and sensory functions of IEEE 802.11, and carried out a detailed empirical study in our division building. The empirical results show the proposed system is quite robust and gives accurate localization results (i.e., with the localization error within 3 meters). 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. Since convolutional neural network (CNN) lacks an inherent mechanism to handle large scale variations, we always need to compute feature maps multiple times for multiscale object detection, which has the bottleneck of computational cost in practice. To address this, we devise a recurrent scale approximation (RSA) to compute feature map once only, and only through this map can we approximate the rest maps on other levels. At the core of RSA is the recursive rolling out mechanism: given an initial map on a particular scale, it generates the prediction on a smaller scale that is half the size of input. To further increase efficiency and accuracy, we (a): design a scale-forecast network to globally predict potential scales in the image since there is no need to compute maps on all levels of the pyramid. (b): propose a landmark retracing network (LRN) to retrace back locations of the regressed landmarks and generate a confidence score for each landmark; LRN can effectively alleviate false positives due to the accumulated error in RSA. The whole system could be trained end-to-end in a unified CNN framework. Experiments demonstrate that our proposed algorithm is superior against state-of-the-arts on face detection benchmarks and achieves comparable results for generic proposal generation. The source code of our system is available. This paper experimentally compares the positioning accuracy of TDoA-based and RSS-based localization in a public outdoor LoRa network in the Netherlands. The performance of different Received Signal Strength (RSS)-based approaches (proximity, centroid, map matching,…) is compared with Time-Difference-of-Arrival (TDoA) performance. The number of RSS and TDoA location updates and the positioning accuracy per spreading factor (SF) is assessed, allowing to select the optimal SF choice for the network. A road mapping filter is applied to the raw location estimates for the best algorithms and SFs. RSS-based approaches have median and maximal errors that are limited to 1000 m and 2000 m respectively, using a road mapping filter. Using the same filter, TDoA-based approaches deliver median and maximal errors in the order of 150 m and 350 m respectively. However, the number of location updates per time unit using SF7 is around 10 times higher for RSS algorithms than for the TDoA algorithm.