By Topic

Pseudo-junction tree method for cooperative localization 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
$33 $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

2 Author(s)
Vladimir Savic ; Signal Processing Applications Group, Polytechnic University of Madrid, Avda. Complutense 30, 28040 Madrid, Spain ; Santiago Zazo

Nonparametric belief propagation (NBP) is well-known probabilistic method for cooperative localization in sensor networks. However, due to the double counting problem, NBP convergence is not guaranteed in the networks with loops or even if NBP converges, it could provide us less accurate estimates. The well-known solution for this problem is nonparametric generalized belief propagation based on junction tree (NGBP-JT). However, there are two problems: how to efficiently form the junction tree in an arbitrary network, and how to decrease the number of particles while keeping the good performance. Therefore, in this paper, we propose the formation of pseudo-junction tree (PJT), which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of particles, we use a set of very strong constraints. The resulting localization method, NGBP based on PJT (NGBP-PJT), overperforms NBP in terms of accuracy and communication cost in any arbitrary network.

Published in:

Information Fusion (FUSION), 2010 13th Conference on

Date of Conference:

26-29 July 2010