RSS-based localization of a moving node in homogeneous environments

Bandiera, Francesco; Carlino, Luca; Coluccia, Angelo; Ricci, Giuseppe

doi:10.1109/camsap.2015.7383783

Cited by 2 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Centralized algorithms, e.g. [10,11,12,13,14], require a data fusion center that carries out the computation after collecting information from the nodes, while distributed algorithms, such as [15,16], rely on self-localization and the computation is spread throughout the network. Centralized algorithms are likely to provide more accurate estimates, but they suffer from scalability problems, especially for large-scale WSNs, while distributed algorithms have the advantage of being scalable and more robust to node failures [17].…”

Section: Introductionmentioning

confidence: 99%

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

Carlino

Jin

Muma

et al. 2019

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

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.

show abstract