17,215 research outputs found
RF Localization in Indoor Environment
In this paper indoor localization system based on the RF power measurements of the Received Signal Strength (RSS) in WLAN environment is presented. Today, the most viable solution for localization is the RSS fingerprinting based approach, where in order to establish a relationship between RSS values and location, different machine learning approaches are used. The advantage of this approach based on WLAN technology is that it does not need new infrastructure (it reuses already and widely deployed equipment), and the RSS measurement is part of the normal operating mode of wireless equipment. We derive the Cramer-Rao Lower Bound (CRLB) of localization accuracy for RSS measurements. In analysis of the bound we give insight in localization performance and deployment issues of a localization system, which could help designing an efficient localization system. To compare different machine learning approaches we developed a localization system based on an artificial neural network, k-nearest neighbors, probabilistic method based on the Gaussian kernel and the histogram method. We tested the developed system in real world WLAN indoor environment, where realistic RSS measurements were collected. Experimental comparison of the results has been investigated and average location estimation error of around 2 meters was obtained
A survey of localization in wireless sensor network
Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network
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
Group-In: Group Inference from Wireless Traces of Mobile Devices
This paper proposes Group-In, a wireless scanning system to detect static or
mobile people groups in indoor or outdoor environments. Group-In collects only
wireless traces from the Bluetooth-enabled mobile devices for group inference.
The key problem addressed in this work is to detect not only static groups but
also moving groups with a multi-phased approach based only noisy wireless
Received Signal Strength Indicator (RSSIs) observed by multiple wireless
scanners without localization support. We propose new centralized and
decentralized schemes to process the sparse and noisy wireless data, and
leverage graph-based clustering techniques for group detection from short-term
and long-term aspects. Group-In provides two outcomes: 1) group detection in
short time intervals such as two minutes and 2) long-term linkages such as a
month. To verify the performance, we conduct two experimental studies. One
consists of 27 controlled scenarios in the lab environments. The other is a
real-world scenario where we place Bluetooth scanners in an office environment,
and employees carry beacons for more than one month. Both the controlled and
real-world experiments result in high accuracy group detection in short time
intervals and sampling liberties in terms of the Jaccard index and pairwise
similarity coefficient.Comment: This work has been funded by the EU Horizon 2020 Programme under
Grant Agreements No. 731993 AUTOPILOT and No.871249 LOCUS projects. The
content of this paper does not reflect the official opinion of the EU.
Responsibility for the information and views expressed therein lies entirely
with the authors. Proc. of ACM/IEEE IPSN'20, 202
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
- …