By Topic

Sequential Particle-Based Sum-Product Algorithm for Distributed Inference in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Li ; Key Lab. of Broadband Wireless Commun. & Sensor Network Technol., Nanjing Univ. of Posts & Telecommun., Nanjing, China ; Zhen Yang ; Haifeng Hu

Graphical models have been widely applied in solving distributed inference problems in wireless sensor networks (WSNs). In this paper, the factor graph (FG) is employed to model a distributed inference problem. Using particle filtering methods, a sequential particle-based sum-product algorithm (SPSPA) is proposed for distributed inference in FGs with continuous variables and nonlinear local functions. Importance sampling methods are used to sample from message products, and the computational complexity of SPSPA is thus linear in the number of particles. The SPSPA is applied to a distributed tracking problem, and its performance is evaluated based on the number of particles and the measurement noise.

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:62 ,  Issue: 1 )