Fundamental Limits of Wideband Localization - Part II: Cooperative Networks

The availability of positional information is of great importance in many commercial, governmental, and military applications. Localization is commonly accomplished through the use of radio communication between mobile devices (agents) and fixed infrastructure (anchors). However, precise determination of agent positions is a challenging task, especially in harsh environments due to radio blockage or limited anchor deployment. In these situations, cooperation among agents can significantly improve localization accuracy and reduce localization outage probabilities. A general framework of analyzing the fundamental limits of wideband localization has been developed in Part I of the paper. Here, we build on this framework and establish the fundamental limits of wideband cooperative location-aware networks. Our analysis is based on the waveforms received at the nodes, in conjunction with Fisher information inequality. We provide a geometrical interpretation of equivalent Fisher information for cooperative networks. This approach allows us to succinctly derive fundamental performance limits and their scaling behaviors, and to treat anchors and agents in a unified way from the perspective of localization accuracy. Our results yield important insights into how and when cooperation is beneficial.Comment: To appear in IEEE Transactions on Information Theor

Secret Key Generation Based on AoA Estimation for Low SNR Conditions

In the context of physical layer security, a physical layer characteristic is used as a common source of randomness to generate the secret key. Therefore an accurate estimation of this characteristic is the core for reliable secret key generation. Estimation of almost all the existing physical layer characteristic suffer dramatically at low signal to noise (SNR) levels. In this paper, we propose a novel secret key generation algorithm that is based on the estimated angle of arrival (AoA) between the two legitimate nodes. Our algorithm has an outstanding performance at very low SNR levels. Our algorithm can exploit either the Azimuth AoA to generate the secret key or both the Azimuth and Elevation angles to generate the secret key. Exploiting a second common source of randomness adds an extra degree of freedom to the performance of our algorithm. We compare the performance of our algorithm to the algorithm that uses the most commonly used characteristics of the physical layer which are channel amplitude and phase. We show that our algorithm has a very low bit mismatch rate (BMR) at very low SNR when both channel amplitude and phase based algorithm fail to achieve an acceptable BMR

Super-Resolution TOA Estimation with Diversity Techniques for Indoor Geolocation Applications

Recently, there are great interests in the location-based applications and the location-awareness of mobile wireless systems in indoor areas, which require accurate location estimation in indoor environments. The traditional geolocation systems such as the GPS are not designed for indoor applications, and cannot provide accurate location estimation in indoor environments. Therefore, there is a need for new location finding techniques and systems for indoor geolocation applications. In this thesis, a wide variety of technical aspects and challenging issues involved in the design and performance evaluation of indoor geolocation systems are presented first. Then the TOA estimation techniques are studied in details for use in indoor multipath channels, including the maximum-likelihood technique, the MUSIC super-resolution technique, and diversity techniques as well as various issues involved in the practical implementation. It is shown that due to the complexity of indoor radio propagation channels, dramatically large estimation errors may occur with the traditional techniques, and the super-resolution techniques can significantly improve the performance of the TOA estimation in indoor environments. Also, diversity techniques, especially the frequency-diversity with the CMDCS, can further improve the performance of the super-resolution techniques

Signal processing for location estimation and tracking in wireless environments

[No abstract available

Node Density and Quality of Estimation for Infrastructure-based Indoor Geolocation Using Time of Arrival

Infrastructure-based indoor geolocation systems utilizing a regular grid arrangement of sensors are being investigated for many applications in indoor wireless networks. One of the factors affecting the Quality of Estimation (i.e. location estimation accuracy) of these systems is node density. In this dissertation we study the effects of node density on indoor geolocation systems based on time of arrival (TOA). The effects of node density on the performance of various indoor communication networks (e.g. wireless LANs) in the presence of realistic indoor radio propagation models has been analyzed and reported in the literature. However, we have noted the lack of an equivalent analysis on the effects of node density on the performance of infrastructure-based indoor geolocation systems. The goal of this dissertation is to address this knowledge gap. Due to the complicated behavior of the indoor radio channel, the relationship between the node density and Quality of Estimation (QoE) is not straightforward. Specifically, QoE depends on factors such as the bandwidth used to make the TOA-based distance measurements, the existence of undetected direct path (UDP) conditions, and coverage. In this dissertation, we characterize these dependencies. We begin by characterizing the Quality of Estimation for closest-neighbor (CN), least-squares (LS) and weighted LS techniques in the presence of different node densities and a distance measurement error (DME) model based on ray tracing (RT) that was recently proposed in the literature. Then, we propose a new indoor geolocation algorithm, Closest Neighbor with TOA Grid (CN-TOAG), characterize its performance and show that it outperforms the existing techniques. We also propose an extension to this algorithm, known as Coverage Map Search (CMS) that allows it to be used in suboptimal coverage conditions (which we refer to as partial coverage conditions) that may prevent other TOA-based geolocation techniques from being used. We treat the partial coverage case by defining coverage probabilities and relating them to the average radius of coverage and dimensions of the indoor area. Next, we characterize the effects of node density on the performance of the CN-TOAG algorithm using a DME model based on UWB measurements, and show that node density and partial coverage are intimately linked together. Since this second DME model also allows for the effects of UDP conditions (which affect the quality of the link or QoL), we also characterize the effects of varying UDP conditions on the performance. Finally, we conclude the dissertation by presenting an analysis of fundamental performance bounds for infrastructure-based indoor geolocation, specifically focusing on the Cramer-Rao Lower Bound (CRLB)

Localization in Wireless Sensor Networks

International audienceWith the proliferation of Wireless Sensor Networks (WSN) applications, knowing the node current location have become a crucial requirement. Location awareness enables various applications from object tracking to event monitoring, and also supports core network services such as: routing, topology control, coverage, boundary detection and clustering. Therefore, WSN localization have become an important area that attracted significant research interest. In the most common case, position related parameters are first extracted from the received measurements, and then used in a second step for estimating the position of the tracked node by means of a specific algorithm. From this perspective, this chapter is intended to provide an overview of the major localization techniques, in order to provide the reader with the necessary inputs to quickly understand the state-of-the-art and/or apply these techniques to localization problems such as robot networks. We first review the most common measurement techniques, and study their theoretical accuracy limits in terms of Cramer-Rao lower bounds. Secondly, we classify the main localization algorithms, taking those measurements as input in order to provide an estimated position of the tracked node(s)

Soft information for localization-of-things

Location awareness is vital for emerging Internetof- Things applications and opens a new era for Localizationof- Things. This paper first reviews the classical localization techniques based on single-value metrics, such as range and angle estimates, and on fixed measurement models, such as Gaussian distributions with mean equal to the true value of the metric. Then, it presents a new localization approach based on soft information (SI) extracted from intra- and inter-node measurements, as well as from contextual data. In particular, efficient techniques for learning and fusing different kinds of SI are described. Case studies are presented for two scenarios in which sensing measurements are based on: 1) noisy features and non-line-of-sight detector outputs and 2) IEEE 802.15.4a standard. The results show that SI-based localization is highly efficient, can significantly outperform classical techniques, and provides robustness to harsh propagation conditions.RYC-2016-1938