A Comparison of Parametric and Sample-Based Message Representation in Cooperative Localization

• Published in: International journal of navigation and observation Vol. 2012; no. 2012; pp. 1 - 10
• Main Authors: Lien, Jaime, Wymeersch, Henk, Srichavengsup, Warakorn, Win, Moe Z., Ferner, Ulric J.
• Format: Journal Article
• Language: English
• Published: Cairo, Egypt Hindawi Puplishing Corporation 2012; Hindawi Publishing Corporation; Hindawi Limited
• Subjects: Accuracy; Algorithms; Categories (Mathematics); Complexity; Computer engineering; Infrastructure; Localization theory; Messages; Methods; Networks; Position (location); Propagation; Random variables; Representations; Studies; Wireless communication systems; Wireless networks; الجبر التماثلي; الجبر الشامل; نظرية الزمر
• ISSN: 1687-5990; 1687-6008; 1687-6008
• DOI: 10.1155/2012/281592

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.