15,284 research outputs found
Simultaneous Distributed Sensor Self-Localization and Target Tracking Using Belief Propagation and Likelihood Consensus
We introduce the framework of cooperative simultaneous localization and
tracking (CoSLAT), which provides a consistent combination of cooperative
self-localization (CSL) and distributed target tracking (DTT) in sensor
networks without a fusion center. CoSLAT extends simultaneous localization and
tracking (SLAT) in that it uses also intersensor measurements. Starting from a
factor graph formulation of the CoSLAT problem, we develop a particle-based,
distributed message passing algorithm for CoSLAT that combines nonparametric
belief propagation with the likelihood consensus scheme. The proposed CoSLAT
algorithm improves on state-of-the-art CSL and DTT algorithms by exchanging
probabilistic information between CSL and DTT. Simulation results demonstrate
substantial improvements in both self-localization and tracking performance.Comment: 10 pages, 5 figure
Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications
Wireless sensor networks monitor dynamic environments that change rapidly
over time. This dynamic behavior is either caused by external factors or
initiated by the system designers themselves. To adapt to such conditions,
sensor networks often adopt machine learning techniques to eliminate the need
for unnecessary redesign. Machine learning also inspires many practical
solutions that maximize resource utilization and prolong the lifespan of the
network. In this paper, we present an extensive literature review over the
period 2002-2013 of machine learning methods that were used to address common
issues in wireless sensor networks (WSNs). The advantages and disadvantages of
each proposed algorithm are evaluated against the corresponding problem. We
also provide a comparative guide to aid WSN designers in developing suitable
machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial
Opportunistic Localization Scheme Based on Linear Matrix Inequality
Enabling self-localization of mobile nodes is an important problem that has been widely studied in the literature.
The general conclusions is that an accurate localization
requires either sophisticated hardware (GPS, UWB, ultrasounds transceiver) or a dedicated infrastructure (GSM, WLAN). In this paper we tackle the problem from a different and rather new perspective: we investigate how localization performance can be improved by means of a cooperative and opportunistic data exchange among the nodes. We consider a target node, completely unaware of its own position, and a number of mobile nodes with some self-localization capabilities. When the opportunity occurs, the target node can exchange data with in-range mobile nodes. This opportunistic data exchange is then used by the target node to refine its position estimate by using a technique based on Linear Matrix Inequalities and barycentric algorithm. To investigate the performance of such an opportunistic localization algorithm, we define a simple mathematical model that describes the opportunistic interactions and, then, we run several computer simulations for analyzing the effect of the nodes duty-cycle and of the native self-localization error modeling considered. The results show that the opportunistic interactions can actually improve the self-localization accuracy of a strayed node in many different scenarios
Non Parametric Distributed Inference in Sensor Networks Using Box Particles Messages
This paper deals with the problem of inference in distributed systems where the probability model is stored in a distributed fashion. Graphical models provide powerful tools for modeling this kind of problems. Inspired by the box particle filter which combines interval analysis with particle filtering to solve temporal inference problems, this paper introduces a belief propagation-like message-passing algorithm that uses bounded error methods to solve the inference problem defined on an arbitrary graphical model. We show the theoretic derivation of the novel algorithm and we test its performance on the problem of calibration in wireless sensor networks. That is the positioning of a number of randomly deployed sensors, according to some reference defined by a set of anchor nodes for which the positions are known a priori. The new algorithm, while achieving a better or similar performance, offers impressive reduction of the information circulating in the network and the needed computation times
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
- …