833 research outputs found
K-Means Fingerprint Clustering for Low-Complexity Floor Estimation in Indoor Mobile Localization
Indoor localization in multi-floor buildings is an important research
problem. Finding the correct floor, in a fast and efficient manner, in a
shopping mall or an unknown university building can save the users' search time
and can enable a myriad of Location Based Services in the future. One of the
most widely spread techniques for floor estimation in multi-floor buildings is
the fingerprinting-based localization using Received Signal Strength (RSS)
measurements coming from indoor networks, such as WLAN and BLE. The clear
advantage of RSS-based floor estimation is its ease of implementation on a
multitude of mobile devices at the Application Programming Interface (API)
level, because RSS values are directly accessible through API interface.
However, the downside of a fingerprinting approach, especially for large-scale
floor estimation and positioning solutions, is their need to store and transmit
a huge amount of fingerprinting data. The problem becomes more severe when the
localization is intended to be done on mobile devices which have limited
memory, power, and computational resources. An alternative floor estimation
method, which has lower complexity and is faster than the fingerprinting is the
Weighted Centroid Localization (WCL) method. The trade-off is however paid in
terms of a lower accuracy than the one obtained with traditional fingerprinting
with Nearest Neighbour (NN) estimates. In this paper a novel K-means-based
method for floor estimation via fingerprint clustering of WiFi and various
other positioning sensor outputs is introduced. Our method achieves a floor
estimation accuracy close to the one with NN fingerprinting, while
significantly improves the complexity and the speed of the floor detection
algorithm. The decrease in the database size is achieved through storing and
transmitting only the cluster heads (CH's) and their corresponding floor
labels.Comment: Accepted to IEEE Globecom 2015, Workshop on Localization and
Tracking: Indoors, Outdoors and Emerging Network
Distributed and adaptive location identification system for mobile devices
Indoor location identification and navigation need to be as simple, seamless,
and ubiquitous as its outdoor GPS-based counterpart is. It would be of great
convenience to the mobile user to be able to continue navigating seamlessly as
he or she moves from a GPS-clear outdoor environment into an indoor environment
or a GPS-obstructed outdoor environment such as a tunnel or forest. Existing
infrastructure-based indoor localization systems lack such capability, on top
of potentially facing several critical technical challenges such as increased
cost of installation, centralization, lack of reliability, poor localization
accuracy, poor adaptation to the dynamics of the surrounding environment,
latency, system-level and computational complexities, repetitive
labor-intensive parameter tuning, and user privacy. To this end, this paper
presents a novel mechanism with the potential to overcome most (if not all) of
the abovementioned challenges. The proposed mechanism is simple, distributed,
adaptive, collaborative, and cost-effective. Based on the proposed algorithm, a
mobile blind device can potentially utilize, as GPS-like reference nodes,
either in-range location-aware compatible mobile devices or preinstalled
low-cost infrastructure-less location-aware beacon nodes. The proposed approach
is model-based and calibration-free that uses the received signal strength to
periodically and collaboratively measure and update the radio frequency
characteristics of the operating environment to estimate the distances to the
reference nodes. Trilateration is then used by the blind device to identify its
own location, similar to that used in the GPS-based system. Simulation and
empirical testing ascertained that the proposed approach can potentially be the
core of future indoor and GPS-obstructed environments
Performance comparison of RSS algorithms for indoor localization in large open environments
We develop and benchmark four RSS localisation algorithms where different a priori knowledge is required. The selection of the best algorithm depends on the availability of additional information on path loss exponent and/or transmit power. We compare our algorithms with centroid localization and show that the algorithms provide better results for shadowing on the values not exceeding 6dB. We perform experiments and simulations with Bluetooth Low Energy and LoRaWAN technologies and select the best technology and algorithm for localisation in large open industrial environments
A New RSSI-based Centroid Localization Algorithm by Use of Virtual Reference Tags
A good design of node location is critical for efficient
and effective wireless communications. This paper presents an
improved algorithm, in order to solve the low localization
accuracy caused by traditional centroid algorithm. The
improved algorithm combined with VIRE system and
traditional centroid algorithm. The VIRE algorithm is
introduced and the signal propagation model is utilized to
construct virtual reference tags in the location area. Simulation shows that this further developed algorithm has further improved the accuracy of positioning up to 35.12% compared
to the traditional centroid algorithm. It is concluded that this algorithm can further improve the locating accuracy in comparison with the original centroid algorithm
Evaluating indoor positioning systems in a shopping mall : the lessons learned from the IPIN 2018 competition
The Indoor Positioning and Indoor Navigation (IPIN) conference holds an annual competition in which indoor localization systems from different research groups worldwide are evaluated empirically. The objective of this competition is to establish a systematic evaluation methodology with rigorous metrics both for real-time (on-site) and post-processing (off-site) situations, in a realistic environment unfamiliar to the prototype developers. For the IPIN 2018 conference, this competition was held on September 22nd, 2018, in Atlantis, a large shopping mall in Nantes (France). Four competition tracks (two on-site and two off-site) were designed. They consisted of several 1 km routes traversing several floors of the mall. Along these paths, 180 points were topographically surveyed with a 10 cm accuracy, to serve as ground truth landmarks, combining theodolite measurements, differential global navigation satellite system (GNSS) and 3D scanner systems. 34 teams effectively competed. The accuracy score corresponds to the third quartile (75th percentile) of an error metric that combines the horizontal positioning error and the floor detection. The best results for the on-site tracks showed an accuracy score of 11.70 m (Track 1) and 5.50 m (Track 2), while the best results for the off-site tracks showed an accuracy score of 0.90 m (Track 3) and 1.30 m (Track 4). These results showed that it is possible to obtain high accuracy indoor positioning solutions in large, realistic environments using wearable light-weight sensors without deploying any beacon. This paper describes the organization work of the tracks, analyzes the methodology used to quantify the results, reviews the lessons learned from the competition and discusses its future
Experimental study on RSS based indoor positioning algorithms
This work compares the performance of indoor positioning systems suitable for
low power wireless sensor networks. The research goal is to study positioning
techniques that are compatible with real-time positioning in wireless sensor
networks, having low-power and low complexity as requirements. Map matching,
approximate positioning (weighted centroid) and exact positioning algorithms
(least squares) were tested and compared in a small predefined indoor
environment. We found that, for our test scenario, weighted centroid algorithms
provide better results than map matching. Least squares proved to be completely
unreliable when using distances obtained by the one-slope propagation model.
Major improvements in the positioning error were found when body influence
was removed from the test scenario. The results show that the positioning error
can be improved if the body effect in received signal strength is accounted for in
the algorithms.Helder D. Silva is supported by the Portuguese Foundation for Science
and Technology under the grant SFRBD/78018/2011.info:eu-repo/semantics/publishedVersio
Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks
Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-M&N schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust
- …