Robust localization in wireless networks from corrupted signals
| Autor: | Petre Stoica, Satyam Dwivedi, Muhammad Osama, Dave Zachariah |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Signal Processing (eess.SP)
FOS: Computer and information sciences Schedule Computer Science - Machine Learning Time-difference-of-arrival TK7800-8360 Computer science Computer Science - Information Theory Signalbehandling TK5101-6720 Upper and lower bounds Statistics - Applications Machine Learning (cs.LG) Time of arrival Time-of-arrival Robustness (computer science) FOS: Electrical engineering electronic engineering information engineering Applications (stat.AP) Electrical Engineering and Systems Science - Signal Processing Robustness Wireless networks Signal processing Wireless network Information Theory (cs.IT) Multilateration Noise Localization Signal Processing Telecommunication Electronics Algorithm |
| Zdroj: | EURASIP Journal on Advances in Signal Processing, Vol 2021, Iss 1, Pp 1-18 (2021) |
| Popis: | We address the problem of timing-based localization in wireless networks, when an unknown fraction of data is corrupted by non-ideal propagation conditions. While timing-based techniques can enable accurate localization, they are sensitive to corrupted data. We develop a robust method that is applicable to a range of localization techniques, including time-of-arrival, time-difference-of-arrival and time-difference in schedule-based transmissions. The method is distribution-free, is computationally efficient and requires only an upper bound on the fraction of corrupted data, thus obviating distributional assumptions on the corrupting noise. The robustness of the method is demonstrated in numerical experiments. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|