Passive localization and synchronization in the presence of affine clocks

Etzlinger, Bernhard; Pimminger, Christoph; Fischereder, Stefan; Springer, Andreas

doi:10.1109/acssc.2015.7421429

Cited by 5 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We first compare the computational complexity of the centralized algorithms 8 , which is shown in Table II in terms of the number of multiplications. To distinguish the NLOS/LOS links, a complexity of R N/L is required.…”

Section: Computational Complexity and Communications Overhead Analmentioning

confidence: 99%

See 1 more Smart Citation

Expectation–Maximization-Based Passive Localization Relying on Asynchronous Receivers: Centralized Versus Distributed Implementations

Yuan

Etzlinger

et al. 2019

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

This paper considers a passive localization scenario relying on a single transmitter, several receivers and multiple moving targets to be located. The so-called "passive" targets equipped with RFID reflectors are capable of reflecting the signals from the transmitter to the receivers. Existing approaches assume that the transmitter and receivers are synchronous or quasi-synchronous, which is not always realistic in practical scenarios. Hence, an asynchronous wireless network is considered, where different clock offsets are assumed at different receivers. We propose a centralized expectation maximizationbased passive localization method for asynchronous receivers (EMpLaR) by treating the clock offsets as hidden variables. Thereby, the proposed algorithm makes use of Taylor expansions to arrive at a closed-form maximization. Furthermore, to improve the robustness to link failures and to reduce the energy consumption, we propose a distributed localization approach based on average consensus formulation to locate the target at each receiver. By applying a quadratic polynomial approximation of the function on which consensus has to be reached, both the computational complexity and the communications overhead are significantly reduced. The Cramér-Rao bound of the target location is derived as a benchmark of our proposed algorithms. Our simulation results show that the proposed centralized and distributed EMpLaR algorithms match the Cramér-Rao bound and significantly improve the localization performance compared to the conventional methods.

show abstract

Section: Computational Complexity and Communications Overhead Analmentioning

confidence: 99%

“…A different scenario where the target is non-cooperative but emits arbitrary signals is also termed "passive"[8],[9]. That scenario is not considered in this work.…”

mentioning

confidence: 99%