Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Robust localization in wireless networks from corrupted signals
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control.ORCID iD: 0000-0002-2294-004X
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control.ORCID iD: 0000-0002-6698-0166
Ericsson Res, Kista, Sweden..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Automatic control. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Systems and Control.ORCID iD: 0000-0002-7957-3711
2021 (English)In: EURASIP Journal on Advances in Signal Processing, ISSN 1687-6172, E-ISSN 1687-6180, Vol. 2021, no 1, article id 79Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
SPRINGER Springer, 2021. Vol. 2021, no 1, article id 79
Keywords [en]
Localization, Robustness, Wireless networks, Time-of-arrival, Time-difference-of-arrival
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:uu:diva-456481DOI: 10.1186/s13634-021-00786-8ISI: 000695828100001OAI: oai:DiVA.org:uu-456481DiVA, id: diva2:1604978
Funder
Swedish Research Council, 2016-06079Swedish Research Council, 2017-04610Swedish Research Council, 2018-05040Available from: 2021-10-21 Created: 2021-10-21 Last updated: 2024-01-15Bibliographically approved
In thesis
1. Robust machine learning methods
Open this publication in new window or tab >>Robust machine learning methods
2022 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

We are surrounded by data in our daily lives. The rent of our houses, the amount of electricity units consumed, the prices of different products at a supermarket, the daily temperature, our medicine prescriptions, our internet search history are all different forms of data. Data can be used in a wide range of applications. For example, one can use data to predict product prices in the future; to predict tomorrow's temperature; to recommend videos; or suggest better prescriptions. However in order to do the above, one is required to learn a model from data. A model is a mathematical description of how the phenomena we are interested in behaves e.g. how does the temperature vary? Is it periodic? What kinds of patterns does it have? Machine learning is about this process of learning models from data by building on disciplines such as statistics and optimization. 

Learning models comes with many different challenges. Some challenges are related to how flexible the model is, some are related to the size of data, some are related to computational efficiency etc. One of the challenges is that of data outliers. For instance, due to war in a country exports could stop and there could be a sudden spike in prices of different products. This sudden jump in prices is an outlier or corruption to the normal situation and must be accounted for when learning the model. Another challenge could be that data is collected in one situation but the model is to be used in another situation. For example, one might have data on vaccine trials where the participants were mostly old people. But one might want to make a decision on whether to use the vaccine or not for the whole population that contains people of all age groups. So one must also account for this difference when learning models because the conclusion drawn may not be valid for the young people in the population. Yet another challenge  could arise when data is collected from different sources or contexts. For example, a shopkeeper might have data on sales of paracetamol when there was flu and when there was no flu and she might want to decide how much paracetamol to stock for the next month. In this situation, it is difficult to know whether there will be a flu next month or not and so deciding on how much to stock is a challenge. This thesis tries to address these and other similar challenges.

In paper I, we address the challenge of data corruption i.e., learning models in a robust way when some fraction of the data is corrupted. In paper II, we apply the methodology of paper I to the problem of localization in wireless networks. Paper III addresses the challenge of estimating causal effect between an exposure and an outcome variable from spatially collected data (e.g. whether increasing number of police personnel in an area reduces number of crimes there). Paper IV addresses the challenge of learning improved decision policies e.g. which treatment to assign to which patient given past data on treatment assignments. In paper V, we look at the challenge of learning models when data is acquired from different contexts and the future context is unknown. In paper VI, we address the challenge of predicting count data across space e.g. number of crimes in an area and quantify its uncertainty. In paper VII, we address the challenge of learning models when data points arrive in a streaming fashion i.e., point by point. The proposed method enables online training and also yields some robustness properties.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2022. p. 50
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 2147
Keywords
artificial intelligence, machine learning, risk minimization, data corruption, decision policy, conformal methods, data from contexts, online learning, spice, robust, causal inference, point process, localization, distribution uncertainty, treatment rules, quantile treatment, predicting count data
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Signal Processing Probability Theory and Statistics
Research subject
Electrical Engineering with specialization in Signal Processing
Identifiers
urn:nbn:se:uu:diva-472453 (URN)978-91-513-1492-1 (ISBN)
Public defence
2022-06-09, 101195, Ångström, Lägerhyddsvägen 1, Uppsala, 13:00 (English)
Opponent
Supervisors
Available from: 2022-05-12 Created: 2022-04-11 Last updated: 2022-06-15

Open Access in DiVA

fulltext(2457 kB)291 downloads
File information
File name FULLTEXT01.pdfFile size 2457 kBChecksum SHA-512
b3741bcf42fe5cf6fded3eb7572879442f974f339a13c2c40fa2ca6155bf9226a29528f4045f241b76d6d2a4afd077acba1b1547c8166555e27c20b3ef640e85
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Osama, MuhammadZachariah, DaveStoica, Petre

Search in DiVA

By author/editor
Osama, MuhammadZachariah, DaveStoica, Petre
By organisation
Division of Systems and ControlAutomatic control
In the same journal
EURASIP Journal on Advances in Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 293 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 254 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf