Journal
SIGNAL PROCESSING
Volume 95, Issue -, Pages 149-160Publisher
ELSEVIER
DOI: 10.1016/j.sigpro.2013.09.005
Keywords
Belief consensus; Belief propagation; Distributed target tracking; Particle filtering; Wireless sensor networks
Categories
Funding
- Swedish Foundation for Strategic Research (SSF)
- ELLIIT
- Swedish Research Council (VR) [2010-5889]
- European Research Council [258418, CSD2008-00010 COMONSENS]
- European Commission [FP7-ICT-2009-4-248894-WHERE-2]
- Spanish Ministry of Science and Innovation
Ask authors/readers for more resources
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. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available