Vladimir Savic

TL;DR: A unified comparison of the convergence speed and communication cost is provided and a novel BC algorithm based on belief propagation (BP) is proposed that is the fastest in loopy graphs and tree graphs, and it is found that BC-based DPF methods have lower communication overhead than data flooding when the network is sufficiently sparse.

TL;DR: This article proposes more flexible and efficient variants of NBP for cooperative localization in mobile networks, and provides an optional 1-lag smoothing done almost in real-time, a novel low-cost communication protocol based on package approximation and censoring, and a higher robustness of the standard mixture importance sampling (MIS) technique.

TL;DR: Novel ranging methods based on kernel principal component analysis (kPCA) are proposed, in which the selected channel parameters are projected onto a nonlinear orthogonal high-dimensional space, and a subset of these projections is then used as an input for ranging.

TL;DR: This paper organized a measurement campaign in a basement tunnel of Linköping university, in which ultra-wideband (UWB) complex impulse responses for line-of-sight (LOS), and three non-LOS (NLOS) scenarios were obtained, and the results indicated the rise-time and maximum excess delay should be used for NLOS identification and error mitigation respectively.