TU Darmstadt / ULB / TUprints

Robust distributed cooperative RSS-based localization for directed graphs in mixed LoS/NLoS environments

Carlino, Luca ; Jin, Di ; Muma, Michael ; Zoubir, Abdelhak M. (2019)
Robust distributed cooperative RSS-based localization for directed graphs in mixed LoS/NLoS environments.
In: EURASIP Journal on Wireless Communications and Networking, 2019, 19
Article, Secondary publication, Publisher's Version

[img]
Preview
Text
Jin-Di.pdf
Copyright Information: CC BY 4.0 International - Creative Commons, Attribution.

Download (1MB) | Preview
Item Type: Article
Type of entry: Secondary publication
Title: Robust distributed cooperative RSS-based localization for directed graphs in mixed LoS/NLoS environments
Language: English
Date: 2019
Place of Publication: Darmstadt
Year of primary publication: 2019
Publisher: SpringerOpen
Journal or Publication Title: EURASIP Journal on Wireless Communications and Networking
Volume of the journal: 19
Corresponding Links:
Origin: Secondary publication via sponsored Golden Open Access
Abstract:

The accurate and low-cost localization of sensors using a wireless sensor network is critically required in a wide range of today’s applications. We propose a novel, robust maximum likelihood-type method for distributed cooperative received signal strength-based localization in wireless sensor networks. To cope with mixed LoS/NLoS conditions, we model the measurements using a two-component Gaussian mixture model. The relevant channel parameters, including the reference path loss, the path loss exponent, and the variance of the measurement error, for both LoS and NLoS conditions, are assumed to be unknown deterministic parameters and are adaptively estimated. Unlike existing algorithms, the proposed method naturally takes into account the (possible) asymmetry of links between nodes. The proposed approach has a communication overhead upper-bounded by a quadratic function of the number of nodes and computational complexity scaling linearly with it. The convergence of the proposed method is guaranteed for compatible network graphs, and compatibility can be tested a priori by restating the problem as a graph coloring problem. Simulation results, carried out in comparison to a centralized benchmark algorithm, demonstrate the good overall performance and high robustness in mixed LoS/NLoS environments.

Status: Publisher's Version
URN: urn:nbn:de:tuda-tuprints-88583
Classification DDC: 600 Technology, medicine, applied sciences > 600 Technology
Divisions: 18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications > Robust Data Science
18 Department of Electrical Engineering and Information Technology > Institute for Telecommunications > Signal Processing
Date Deposited: 12 Jul 2019 12:32
Last Modified: 24 May 2023 09:40
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/8858
PPN:
Export:
Actions (login required)
View Item View Item