Cooperative Robust Geometric Positioning Algorithm in Wireless Networks

Abstract

International audienceIn this paper, we propose a geometric positioning technique for cooperative localization in Wireless Networks. The proposed technique is based on building geometric constraints from radio observables. These constraints are then merged to estimate the true position. In this paper we address situations where blind nodes, due to the lack of radio observables, cooperate to estimate their positions. Compared to other techniques, Monte Carlo simulations illustrate interesting performances in terms of positioning accuracy and computation complexity and runtime. © 2017 IEEE

Cooperative localization and tracking in wireless sensor networks

“…The blind nodes can furnish received power observation P . The blind nodes estimate their positions using these observations provided by the anchor nodes on the one hand and using the cooperation between themselves based on the proposed geometric technique on the other hand. This algorithm banks on: …”

“…We obtain the information about the location of each blind node provided by its related anchor nodes in order to approximate the region containing the true position. The first part of C‐RGPA algorithm is composed of the two following stages: Build the constraints: Figure illustrates the two types of radio constraints built from the radio observables as described in Hedhly et al which are the range and the received power constraints. We obtain two annulus for each blind node. (2)Box the constraints: In order to simplify the computational complexity, the constraints should be boxed as illustrated in Figure .…”

“…Build the constraints: Figure illustrates the two types of radio constraints built from the radio observables as described in Hedhly et al which are the range and the received power constraints. We obtain two annulus for each blind node.…”

“…Indeed, novel techniques for cooperative localization were proposed in references from Pedersen et al to Hedhly et al mainly the evolved VMP algorithm (E‐VMP) and the cooperative robust geometric positioning algorithm (C‐RGPA). Accordingly, the E‐VMP and C‐RGPA algorithms outperform other cooperative localization techniques in terms of positioning accuracy, complexity and cost.…”

“…In addition, the E‐VMP algorithm has totally resolved the problem of the alternation of the nodes position estimates which happened to be the main drawback of the old VMP algorithm versions. Furthermore, the C‐RGPA algorithm is based on a geometric approach whose advantage is to provide a set of intervals enclosing the true position and not a single position estimate like in the case of the classical algebraic approaches …”