A Low Complexity Gaussian Parametric Message Passing Based Cooperative Localization Algorithm

2018 ◽  
pp. 551-563
Author(s):  
Yangyang Liu ◽  
Baowang Lian
Keyword(s):  
Message Passing ◽  
Low Complexity ◽  
Cooperative Localization ◽  
Localization Algorithm

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

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Jaime Lien ◽  
Ulric J. Ferner ◽  
Warakorn Srichavengsup ◽  
Henk Wymeersch ◽  
Moe Z. Win
Keyword(s):  
Message Passing ◽  
Ad Hoc ◽  
Computational Cost ◽  
Low Complexity ◽  
Ultra Wideband ◽  
Cooperative Localization ◽  
Location Awareness ◽  
Excellent Performance ◽  
Hoc Networks ◽  
High Computational Cost

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.

Localization of WSN using Distributed Particle Swarm Optimization algorithm with precise references

2016 ◽  
Vol 7 ◽  
pp. 1
Author(s):  
Ravichander Janapati ◽  
Ch. Balaswamy ◽  
K. Soundararajan
Keyword(s):  
Particle Swarm Optimization ◽  
Search Algorithm ◽  
Particle Swarm ◽  
Search Space ◽  
Research Area ◽  
Population Based ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Localization Algorithm ◽  
Swarm Optimization

Localization is the key research area in wireless sensor networks. Finding the exact position of the node is known as localization. Different algorithms have been proposed. Here we consider a cooperative localization algorithm with censoring schemes using Crammer Rao bound (CRB). This censoring scheme  can improve the positioning accuracy and reduces computation complexity, traffic and latency. Particle swarm optimization (PSO) is a population based search algorithm based on the swarm intelligence like social behavior of birds, bees or a school of fishes. To improve the algorithm efficiency and localization precision, this paper presents an objective function based on the normal distribution of ranging error and a method of obtaining the search space of particles. In this paper  Distributed localization of wireless sensor networksis proposed using PSO with best censoring technique using CRB. Proposed method shows better results in terms of position accuracy, latency and complexity.  

scholarly journals Cooperative Localization for Mobile Networks: A Distributed Belief Propagation–Mean Field Message Passing Algorithm

2016 ◽  
Vol 23 (6) ◽  
pp. 828-832 ◽  
Author(s):  
Burak Cakmak ◽  
Daniel N. Urup ◽  
Florian Meyer ◽  
Troels Pedersen ◽  
Bernard H. Fleury ◽  
...  
Keyword(s):  
Mobile Networks ◽  
Message Passing ◽  
Belief Propagation ◽  
Mean Field ◽  
Cooperative Localization ◽  
Message Passing Algorithm
Sign in / Sign up

Export Citation Format

Share Document