2,472 research outputs found
Sensing motion using spectral and spatial analysis of WLAN RSSI
In this paper we present how motion sensing can be obtained just by observing the WLAN radio signal strength and its fluctuations. The temporal, spectral and spatial characteristics of WLAN signal are analyzed. Our analysis
confirms our claim that ’signal strength from access points appear to jump around more vigorously when the device is moving compared to when it is still and the number of detectable access points vary considerably while the user is on the move’. Using this observation, we present a novel motion detection algorithm, Spectrally Spread Motion Detection (SpecSMD) based on the spectral analysis of
WLAN signal’s RSSI. To benchmark the proposed algorithm, we used Spatially Spread Motion Detection (SpatSMD), which is inspired by the recent work of Sohn et al. Both algorithms were evaluated by carrying out extensive measurements
in a diverse set of conditions (indoors in different buildings and outdoors - city center, parking lot, university campus etc.,) and tested against the same
data sets. The 94% average classification accuracy of the proposed SpecSMD is outperforming the accuracy of SpatSMD (accuracy 87%). The motion detection algorithms presented in this paper provide ubiquitous methods for deriving the
state of the user. The algorithms can be implemented and run on a commodity device with WLAN capability without the need of any additional hardware support
RSSI-Based Self-Localization with Perturbed Anchor Positions
We consider the problem of self-localization by a resource-constrained mobile
node given perturbed anchor position information and distance estimates from
the anchor nodes. We consider normally-distributed noise in anchor position
information. The distance estimates are based on the log-normal shadowing
path-loss model for the RSSI measurements. The available solutions to this
problem are based on complex and iterative optimization techniques such as
semidefinite programming or second-order cone programming, which are not
suitable for resource-constrained environments. In this paper, we propose a
closed-form weighted least-squares solution. We calculate the weights by taking
into account the statistical properties of the perturbations in both RSSI and
anchor position information. We also estimate the bias of the proposed solution
and subtract it from the proposed solution. We evaluate the performance of the
proposed algorithm considering a set of arbitrary network topologies in
comparison to an existing algorithm that is based on a similar approach but
only accounts for perturbations in the RSSI measurements. We also compare the
results with the corresponding Cramer-Rao lower bound. Our experimental
evaluation shows that the proposed algorithm can substantially improve the
localization performance in terms of both root mean square error and bias.Comment: Accepted for publication in 28th Annual IEEE International Symposium
on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC 2017
Dead Reckoning Localization Technique for Mobile Wireless Sensor Networks
Localization in wireless sensor networks not only provides a node with its
geographical location but also a basic requirement for other applications such
as geographical routing. Although a rich literature is available for
localization in static WSN, not enough work is done for mobile WSNs, owing to
the complexity due to node mobility. Most of the existing techniques for
localization in mobile WSNs uses Monte-Carlo localization, which is not only
time-consuming but also memory intensive. They, consider either the unknown
nodes or anchor nodes to be static. In this paper, we propose a technique
called Dead Reckoning Localization for mobile WSNs. In the proposed technique
all nodes (unknown nodes as well as anchor nodes) are mobile. Localization in
DRLMSN is done at discrete time intervals called checkpoints. Unknown nodes are
localized for the first time using three anchor nodes. For their subsequent
localizations, only two anchor nodes are used. The proposed technique estimates
two possible locations of a node Using Bezouts theorem. A dead reckoning
approach is used to select one of the two estimated locations. We have
evaluated DRLMSN through simulation using Castalia simulator, and is compared
with a similar technique called RSS-MCL proposed by Wang and Zhu .Comment: Journal Paper, IET Wireless Sensor Systems, 201
Recurrent Neural Networks For Accurate RSSI Indoor Localization
This paper proposes recurrent neuron networks (RNNs) for a fingerprinting
indoor localization using WiFi. Instead of locating user's position one at a
time as in the cases of conventional algorithms, our RNN solution aims at
trajectory positioning and takes into account the relation among the received
signal strength indicator (RSSI) measurements in a trajectory. Furthermore, a
weighted average filter is proposed for both input RSSI data and sequential
output locations to enhance the accuracy among the temporal fluctuations of
RSSI. The results using different types of RNN including vanilla RNN, long
short-term memory (LSTM), gated recurrent unit (GRU) and bidirectional LSTM
(BiLSTM) are presented. On-site experiments demonstrate that the proposed
structure achieves an average localization error of m with of the
errors under m, which outperforms the conventional KNN algorithms and
probabilistic algorithms by approximately under the same test
environment.Comment: Received signal strength indicator (RSSI), WiFi indoor localization,
recurrent neuron network (RNN), long shortterm memory (LSTM),
fingerprint-based localizatio
- …