PhD Thesis Defence
- Tuesday, 24 October 2017
- Aula Senaatszaal
Signal Strength Based Localization and Path-Loss Exponent Self-Estimation in Wireless NetworksYongchang Hu
In wireless communications, received signal strength (SS) measurements are easy and convenient to gather. SS-based techniques can be incorporated into any device that is equipped with a wireless chip.
This thesis studies SS-based localization and path-loss exponent (PLE) self-estimation. Although these two research lines might seem unrelated, they are actually marching towards the same goal. The former can easily enable a very simple wireless chip to infer its location. But to solve that localization problem, the PLE is required, which is one of the key parameters in wireless propagation channels that decides the SS level. This makes the PLE very crucial to SS-based localization, although it is often unknown. Therefore, we need to develop accurate and robust PLE self-estimation approaches,which will eventually contribute to the improvement of the localization performance.
We start with the first research line, where we try to cope with all possible issues that we encounter in solving the localization problem. To eliminate the unknown transmit power issue, we adopt differential received signal strength (DRSS) measurements. Colored noise, non-linearity and non-convexity are the next three major issues. To deal with the first two, we introduce a whitened linear data model for DRSSbased localization. Based on that and assuming the PLE is known, three different approaches are respectively proposed to tackle the non-convexity issue: an advanced best linear unbiased estimator (A-BLUE), a Lagrangian estimator (LE) and a robust semidefinite programming (SDP)-based estimator (RSDPE). To cope with an unknown PLE, we propose a robust SDP-based block coordinate descent estimator (RSDP-BCDE) that jointly estimates the PLE and the target location. Its performance iteratively converges to that of the RSDPE with a known PLE.
As mentioned earlier, while generating DRSS measurements, we eliminate the unknown transmit power. This is very similar to the way time-difference-of-arrival (TDOA) methods cope with an unknown transmit time. Both of them use a differencing process to cope with an unknown linear nuisance parameter. Our DRSS study shows the differencing process does not cause any information loss and hence the selection of the reference is not important. However, this apparently contradicts what is commonly known in TDOA-based localization, where selecting a good reference is very crucial. To resolve this conflict, we introduce a unified framework for linear nuisance parameters such that all our conclusions apply to any kind of problem that can be written into this form. Three methods that can cope with linear nuisance parameters are considered by investigating their best linear unbiased estimators (BLUEs): joint estimation, orthogonal subspace projection (OSP) method and differential method. The results coincide with those obtained in our DRSS study. For TDOA-based localization, it is actually the modelling process that causes a reference dependent information loss, not the differencing process. Many other interesting conclusions are also drawn here.
Next, we turn our attention to the second research line. Undoubtedly, knowledge of the PLE is decisive to SS-based localization and hence accurately estimating the PLE will lead to a better localization performance. However, estimating the PLE also has benefits for other applications. If each node can self-estimate the PLE in a distributed fashion without any external assistance or information, it might be very helpful for efficiently designing some wireless communication and networking systems, since the PLE yields a multi-faceted influence therein. Driven by this idea, we propose two closedform (weighted) total least squares (TLS) methods for self-estimating the PLE, which are merely based on the locally collected SS measurements. To solve the unknown nodal distance issue, we particularly extract information fromthe random placement of neighbours in order to facilitate the derivations. We also elaborate on many possible applications thereafter, since this kind of PLE self-estimation has never been introduced before.
Although the previous two methods estimate the PLE by minimizing some residue, we also want to introduce Bayesian methods, such as maximizing the likelihood. Some obstacles related to such approaches are the totally unknown distribution for the SS measurements and the mathematical difficulties of computing it, since the SS is subject to not only the wireless channel effects but also the geometric dynamics (the random node placement). To deal with that, we start with a simple case that only considers the geometric path-loss for wireless channels. We are the first to discover that in this case the SS measurements in random networks are Pareto distributed. Based on that, we derive the CRLB and introduce two maximum likelihood (ML) estimators for PLE selfestimation. Although we considered a simplified setting, finding the general SS distribution would still be very useful for studying wireless communications and networking.Additional information ...
- Wed, 20 Dec 2017
MSc Thesis Presentation
Blind Graph Topology Change Detection: A Graph Signal Processing Approach
- 14 -- 16 May 2018
27th Workshop on Advances in Analog Circuit Design
The AACD workshops are a high-quality series of events held all over the world.