Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

Savic, Vladimir and Zazo Bello, Santiago (2013). Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks. "Eurasip Journal on Advances in Signal Processing", v. 2013 (n. 16); pp. 1-15. ISSN 1687-6180. https://doi.org/10.1186/1687-6180-2013-16.

Description

Title: Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks
Author/s:
  • Savic, Vladimir
  • Zazo Bello, Santiago
Item Type: Article
Título de Revista/Publicación: Eurasip Journal on Advances in Signal Processing
Date: 2013
ISSN: 1687-6180
Volume: 2013
Subjects:
Faculty: E.T.S.I. Telecomunicación (UPM)
Department: Señales, Sistemas y Radiocomunicaciones
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (922kB)

Abstract

Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks.

More information

Item ID: 28868
DC Identifier: http://oa.upm.es/28868/
OAI Identifier: oai:oa.upm.es:28868
DOI: 10.1186/1687-6180-2013-16
Official URL: http://asp.eurasipjournals.com/content/2013/1/16
Deposited by: Memoria Investigacion
Deposited on: 07 Jun 2014 12:46
Last Modified: 22 Sep 2014 11:43
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM