A Comparison of Parametric and Sample-Based Message Representation in Cooperative Localization
Journal article, 2012

Location awareness is a key enabling feature and fundamental challenge in present and future wireless networks. Most existing localization methods rely on existing infrastructure and thus lack the flexibility and robustness necessary for large ad hoc networks. In this paper, we build upon SPAWN (sum-product algorithm over a wireless network), which determines node locations through iterative message passing, but does so at a high computational cost. We compare different message representations for SPAWN in terms of performance and complexity and investigate several types of cooperation based on censoring. Our results, based on experimental data with ultra-wideband (UWB) nodes, indicate that parametric message representation combined with simple censoring can give excellent performance at relatively low complexity.


J. Lien

Stanford University

U.J. Ferner

Massachusetts Institute of Technology (MIT)

W. Srichavengsup

Thai-Nichi Institute of Technology

Henk Wymeersch

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Moe Win

Massachusetts Institute of Technology (MIT)

International Journal of Navigation and Observation

1687-5990 (ISSN) 1687-6008 (eISSN)

Vol. 2012 Art. ID. 281592- 281592

Subject Categories

Electrical Engineering, Electronic Engineering, Information Engineering



More information

Latest update