3,395 research outputs found
Belief Consensus Algorithms for Fast Distributed Target Tracking in Wireless Sensor Networks
In distributed target tracking for wireless sensor networks, agreement on the
target state can be achieved by the construction and maintenance of a
communication path, in order to exchange information regarding local likelihood
functions. Such an approach lacks robustness to failures and is not easily
applicable to ad-hoc networks. To address this, several methods have been
proposed that allow agreement on the global likelihood through fully
distributed belief consensus (BC) algorithms, operating on local likelihoods in
distributed particle filtering (DPF). However, a unified comparison of the
convergence speed and communication cost has not been performed. In this paper,
we provide such a comparison and propose a novel BC algorithm based on belief
propagation (BP). According to our study, DPF based on metropolis belief
consensus (MBC) is the fastest in loopy graphs, while DPF based on BP consensus
is the fastest in tree graphs. Moreover, we found that BC-based DPF methods
have lower communication overhead than data flooding when the network is
sufficiently sparse
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
An objective based classification of aggregation techniques for wireless sensor networks
Wireless Sensor Networks have gained immense popularity in recent years due to their ever increasing capabilities and wide range of critical applications. A huge body of research efforts has been dedicated to find ways to utilize limited resources of these sensor nodes in an efficient manner. One of the common ways to minimize energy consumption has been aggregation of input data. We note that every aggregation technique has an improvement objective to achieve with respect to the output it produces. Each technique is designed to achieve some target e.g. reduce data size, minimize transmission energy, enhance accuracy etc. This paper presents a comprehensive survey of aggregation techniques that can be used in distributed manner to improve lifetime and energy conservation of wireless sensor networks. Main contribution of this work is proposal of a novel classification of such techniques based on the type of improvement they offer when applied to WSNs. Due to the existence of a myriad of definitions of aggregation, we first review the meaning of term aggregation that can be applied to WSN. The concept is then associated with the proposed classes. Each class of techniques is divided into a number of subclasses and a brief literature review of related work in WSN for each of these is also presented
Distributed Estimation with Information-Seeking Control in Agent Network
We introduce a distributed, cooperative framework and method for Bayesian
estimation and control in decentralized agent networks. Our framework combines
joint estimation of time-varying global and local states with
information-seeking control optimizing the behavior of the agents. It is suited
to nonlinear and non-Gaussian problems and, in particular, to location-aware
networks. For cooperative estimation, a combination of belief propagation
message passing and consensus is used. For cooperative control, the negative
posterior joint entropy of all states is maximized via a gradient ascent. The
estimation layer provides the control layer with probabilistic information in
the form of sample representations of probability distributions. Simulation
results demonstrate intelligent behavior of the agents and excellent estimation
performance for a simultaneous self-localization and target tracking problem.
In a cooperative localization scenario with only one anchor, mobile agents can
localize themselves after a short time with an accuracy that is higher than the
accuracy of the performed distance measurements.Comment: 17 pages, 10 figure
Bibliographic Review on Distributed Kalman Filtering
In recent years, a compelling need has arisen to understand the effects of distributed information structures on estimation and filtering. In this paper, a bibliographical review on distributed Kalman filtering (DKF) is provided.\ud
The paper contains a classification of different approaches and methods involved to DKF. The applications of DKF are also discussed and explained separately. A comparison of different approaches is briefly carried out. Focuses on the contemporary research are also addressed with emphasis on the practical applications of the techniques. An exhaustive list of publications, linked directly or indirectly to DKF in the open literature, is compiled to provide an overall picture of different developing aspects of this area
- …