Positioning Performance Limits of GNSS Meta-Signals and HO-BOC Signals

Global Navigation Satellite Systems (GNSS) are the main source of position, navigation, and timing (PNT) information and will be a key player in the next-generation intelligent transportation systems and safety-critical applications, but several limitations need to be overcome to meet the stringent performance requirements. One of the open issues is how to provide precise PNT solutions in harsh propagation environments. Under nominal conditions, the former is typically achieved by exploiting carrier phase information through precise positioning techniques, but these methods are very sensitive to the quality of phase observables. Another option that is gaining interest in the scientific community is the use of large bandwidth signals, which allow obtaining a better baseband resolution, and therefore more precise code-based observables. Two options may be considered: (i) high-order binary offset carrier (HO-BOC) modulations or (ii) the concept of GNSS meta-signals. In this contribution, we assess the time-delay and phase maximum likelihood (ML) estimation performance limits of such signals, together with the performance translation into the position domain, considering single point positioning (SPP) and RTK solutions, being an important missing point in the literature. A comprehensive discussion is provided on the estimators’ behavior, the corresponding ML threshold regions, the impact of good and bad satellite constellation geometries, and final conclusions on the best candidates, which may lead to precise solutions under harsh conditions. It is found that if the receiver is constrained by the receiver bandwidth, the best choices are the L1-M or E6-Public Regulated Service (PRS) signals. If the receiver is able to operate at 60 MHz, it is recommended to exploit the full-bandwidth Galileo E5 signal. In terms of robustness and performance, if the receiver can operate at 135 MHz, the best choice is to use the GNSS meta-signals E5 + E6 or B2 + B3, which provide the best overall performances regardless of the positioning method used, the satellite constellation geometry, or the propagation conditions

Optimization of positioning capabilities in wireless sensor networks : from power efficiency to medium access

In Wireless Sensor Networks (WSN), the ability of sensor nodes to know its position is an enabler for a wide variety of applications for monitoring, control, and automation. Often, sensor data is meaningful only if its position can be determined. Many WSN are deployed indoors or in areas where Global Navigation Satellite System (GNSS) signal coverage is not available, and thus GNSS positioning cannot be guaranteed. In these scenarios, WSN may be relied upon to achieve a satisfactory degree of positioning accuracy. Typically, batteries power sensor nodes in WSN. These batteries are costly to replace. Therefore, power consumption is an important aspect, being performance and lifetime of WSN strongly relying on the ability to reduce it. It is crucial to design effective strategies to maximize battery lifetime. Optimization of power consumption can be made at different layers. For example, at the physical layer, power control and resource optimization may play an important role, as well as at higher layers through network topology and MAC protocols. The objective of this Thesis is to study the optimization of resources in WSN that are employed for positioning purposes, with the ultimate goal being the minimization of power consumption. We focus on anchor-based positioning, where a subset of the WSN nodes know their location (anchors) and send ranging signals to nodes with unknown position (targets) to assist them in estimating it through distance-related measurements. Two well known of such measurements are received signal strength (RSS) and time of arrival (TOA), in which this Thesis focuses. In order to minimize power consumption while providing a certain quality of positioning service, in this dissertation we research on the problems of power control and node selection. Aiming at a distributed implementation of the proposed techniques, we resort to the tools of non-cooperative game theory. First, transmit power allocation is addressed for RSS based ranging. Using game theory formulation, we develop a potential game leading to an iterated best response algorithm with sure convergence. As a performance metric, we introduce the geometric dilution of precision (GDOP), which is shown to help achieving a suitable geometry of the selected anchor nodes. The proposed scheme and relative distributed algorithms provide good equilibrium performance in both static and dynamic scenarios. Moreover, we present a distributed, low complexity implementation and analyze it in terms of computational complexity. Results show that performance close to that of exhaustive search is possible. We then address the transmit power allocation problem for TOA based ranging, also resorting to a game theoretic formulation. In this setup, and also considering GDOP as performance metric, a supermodular game formulation is proposed, along with a distributed algorithm with guaranteed convergence to a unique solution, based on iterated best response. We analyze the proposed algorithm in terms of the price of anarchy (PoA), that is, compared to a centralized optimum solution, and shown to have a moderate performance loss. Finally, this dissertation addresses the effect of different MAC protocols and topologies in the positioning performance. In this direction, we study the performance of mesh and cluster-tree topologies defined in WSN standards. Different topologies place different constraints in network connectivity, having a substantial impact on the performance of positioning algorithms. While mesh topology allows high connectivity with large energy consumption, cluster-tree topologies are more energy efficient but suffer from reduced connectivity and poor positioning performance. In order to improve the performance of cluster-tree topologies, we propose a cluster formation algorithm. It significantly improves connectivity with anchor nodes, achieving vastly improved positioning performance.En les xarxes de sensors sense fils (WSN), l'habilitat dels nodes sensors per conèixer la seva posició facilita una gran varietat d'aplicacions per la monitorització, el control i l'automatització. Així, les dades que proporciona un sensor tenen sentit només si la posició pot ésser determinada. Moltes WSN són desplegades en interiors o en àrees on la senyal de sistemes globals de navegació per satèl.lit (GNSS) no té prou cobertura, i per tant, el posicionament basat en GNSS no pot ésser garantitzat. En aquests escenaris, les WSN poden proporcionar una bona precisió en posicionament. Normalment, en WSN els nodes són alimentats amb bateries. Aquestes bateries són difícils de reemplaçar. Per tant, el consum de potència és un aspecte important i és crucial dissenyar estratègies efectives per maximitzar el temps de vida de la bateria. L'optimització del consum de potència pot ser fet a diferents capes del protocol. Per exemple, en la capa física, el control de potència i l'optimització dels recursos juguen un rol important, igualment que la topologia de xarxa i els protocols MAC en les capes més altes. L'objectiu d'aquesta tesi és estudiar l¿optimització de recursos en WSN que s'utilitzen per fer posicionament, amb el propòsit de minimitzar el consum de potència. Ens focalitzem en el posicionament basat en àncora, en el qual un conjunt de nodes coneixen la seva localització (nodes àncora) i envien missatges als nodes que no saben la seva posició per ajudar-los a estimar les seves coordenades amb mesures de distància. Dues classes de mesures són la potència de la senyal rebuda (RSS) i el temps d'arribada (TOA) en les quals aquesta tesi està focalitzada. Per minimitzar el consum de potència mentre que es proporciona suficient qualitat en el posicionament, en aquesta tesi estudiem els problemes de control de potència i selecció de nodes. Tenint en compte una implementació distribuïda de les tècniques proposades, utilitzem eïnes de teoria de jocs no cooperatius. Primer, l'assignació de potència transmesa és abordada pel càlcul de la distància amb RSS. Utilitzant la teoria de jocs, desenvolupem un joc potencial que convergeix amb un algoritme iteratiu basat en millor resposta (best response). Com a mètrica d'error, introduïm la dilució de la precisió geomètrica (GDOP) que mostra quant d'apropiada és la geometria dels nodes àncora seleccionats. L'esquema proposat i els algoritmes distribuïts proporcionen una bona resolució de l'equilibri en l'escenari estàtic i dinàmic. Altrament, presentem una implementació distribuïda i analitzem la seva complexitat computacional. Els resultats obtinguts són similars als obtinguts amb un algoritme de cerca exhaustiva. El problema d'assignació de la potència transmesa en el càlcul de la distància basat en TOA, també és tractat amb teoria de jocs. En aquest cas, considerant el GDOP com a mètrica d'error, proposem un joc supermodular juntament amb un algoritme distribuït basat en millor resposta amb convergència garantida cap a una única solució. Analitzem la solució proposada amb el preu de l'anarquia (PoA), és a dir, es compara la nostra solució amb una solució òptima centralitzada mostrant que les pèrdues són moderades. Finalment, aquesta tesi tracta l'efecte que causen diferents protocols MAC i topologies en el posicionament. En aquesta direcció, estudiem les topologies de malla i arbre formant clusters (cluster-tree) que estan definides als estàndards de les WSN. La diferència entre les topologies crea diferents restriccions en la connectivitat de la xarxa, afectant els resultats de posicionament. La topologia de malla permet una elevada connectivitat entre els nodes amb gran consum d'energia, mentre que les topologies d'arbre són més energèticament eficients però amb baixa connectivitat entre els nodes i baix rendiment pel posicionament. Per millorar la qualitat del posicionament en les topologies d'arbre, proposem un algoritme de formació de clústers.Postprint (published version

Target localization in MIMO radar systems

MIMO (Multiple-Input Multiple-Output) radar systems employ multiple antennas to transmit multiple waveforms and engage in joint processing of the received echoes from the target. MIMO radar has been receiving increasing attention in recent years from researchers, practitioners, and funding agencies. Elements of MIMO radar have the ability to transmit diverse waveforms ranging from independent to fully correlated. MIMO radar offers a new paradigm for signal processing research. In this dissertation, target localization accuracy performance, attainable by the use of MIMO radar systems, configured with multiple transmit and receive sensors, widely distributed over an area, are studied. The Cramer-Rao lower bound (CRLB) for target localization accuracy is developed for both coherent and noncoherent processing. The CRLB is shown to be inversely proportional to the signal effective bandwidth in the noncoherent case, but is approximately inversely proportional to the carrier frequency in the coherent case. It is shown that optimization over the sensors\u27 positions lowers the CRLB by a factor equal to the product of the number of transmitting and receiving sensors. The best linear unbiased estimator (BLUE) is derived for the MIMO target localization problem. The BLUE\u27s utility is in providing a closed-form localization estimate that facilitates the analysis of the relations between sensors locations, target location, and localization accuracy. Geometric dilution of precision (GDOP) contours are used to map the relative performance accuracy for a given layout of radars over a given geographic area. Coherent processing advantage for target localization relies on time and phase synchronization between transmitting and receiving radars. An analysis of the sensitivity of the localization performance with respect to the variance of phase synchronization error is provided by deriving the hybrid CRLB. The single target case is extended to the evaluation of multiple target localization performance. Thus far, the analysis assumes a stationary target. Study of moving target tracking capabilities is offered through the use of the Bayesian CRLB for the estimation of both target location and velocity. Centralized and decentralized tracking algorithms, inherit to distributed MIMO radar architecture, are proposed and evaluated. It is shown that communication requirements and processing load may be reduced at a relatively low performance cost

Doppler-aided positioning in GNSS receivers - A performance analysis

The main objective of Global Navigation Satellite Systems (GNSS) is to precisely locate a receiver based on the reception of radio-frequency waveforms broadcasted by a set of satellites. Given delayed and Doppler shifted replicas of the known transmitted signals, the most widespread approach consists in a two-step algorithm. First, the delays and Doppler shifts from each satellite are estimated independently, and sub- sequently the user position and velocity are computed as the solution to a Weighted Least Squares (WLS) problem. This second step conventionally uses only delay measurements to determine the user position, although Doppler is also informative. The goal of this paper is to provide simple and meaningful ex- pressions of the positioning precision. These expressions are analysed with respect to the standard WLS algorithms, exploiting the Doppler information or not. We can then evaluate the performance improve- ment brought by a joint frequency and delay positioning procedure. Numerical simulations assess that using Doppler information is indeed effective when considering long observation times, and particularly useful in challenging scenarios such as urban canyons (constrained satellite visibility) or near indoor sit- uations (weak signal conditions which need long integration times), thus providing new insights for the design of robust and high-sensitivity receivers

Source localization via time difference of arrival

Accurate localization of a signal source, based on the signals collected by a number of receiving sensors deployed in the source surrounding area is a problem of interest in various fields. This dissertation aims at exploring different techniques to improve the localization accuracy of non-cooperative sources, i.e., sources for which the specific transmitted symbols and the time of the transmitted signal are unknown to the receiving sensors. With the localization of non-cooperative sources, time difference of arrival (TDOA) of the signals received at pairs of sensors is typically employed. A two-stage localization method in multipath environments is proposed. During the first stage, TDOA of the signals received at pairs of sensors is estimated. In the second stage, the actual location is computed from the TDOA estimates. This later stage is referred to as hyperbolic localization and it generally involves a non-convex optimization. For the first stage, a TDOA estimation method that exploits the sparsity of multipath channels is proposed. This is formulated as an f1-regularization problem, where the f1-norm is used as channel sparsity constraint. For the second stage, three methods are proposed to offer high accuracy at different computational costs. The first method takes a semi-definite relaxation (SDR) approach to relax the hyperbolic localization to a convex optimization. The second method follows a linearized formulation of the problem and seeks a biased estimate of improved accuracy. A third method is proposed to exploit the source sparsity. With this, the hyperbolic localization is formulated as an an f1-regularization problem, where the f1-norm is used as source sparsity constraint. The proposed methods compare favorably to other existing methods, each of them having its own advantages. The SDR method has the advantage of simplicity and low computational cost. The second method may perform better than the SDR approach in some situations, but at the price of higher computational cost. The l1-regularization may outperform the first two methods, but is sensitive to the choice of a regularization parameter. The proposed two-stage localization approach is shown to deliver higher accuracy and robustness to noise, compared to existing TDOA localization methods. A single-stage source localization method is explored. The approach is coherent in the sense that, in addition to the TDOA information, it utilizes the relative carrier phases of the received signals among pairs of sensors. A location estimator is constructed based on a maximum likelihood metric. The potential of accuracy improvement by the coherent approach is shown through the Cramer Rao lower bound (CRB). However, the technique has to contend with high peak sidelobes in the localization metric, especially at low signal-to-noise ratio (SNR). Employing a small antenna array at each sensor is shown to lower the sidelobes level in the localization metric. Finally, the performance of time delay and amplitude estimation from samples of the received signal taken at rates lower than the conventional Nyquist rate is evaluated. To this end, a CRB is developed and its variation with system parameters is analyzed. It is shown that while with noiseless low rate sampling there is no estimation accuracy loss compared to Nyquist sampling, in the presence of additive noise the performance degrades significantly. However, increasing the low sampling rate by a small factor leads to significant performance improvement, especially for time delay estimation

Location-Aware Formation Control in Swarm Navigation

Goal-seeking and information-seeking are canonical problems in mobile agent swarms. We study the problem of collaborative goal-approaching under uncertain agent position information. We propose a framework that establishes location-aware formations, resulting in a controller that accounts for agent position uncertainty with a realistic ranging model. Simulation results confirm that, as the outcome of the controller, the swarm moves towards its goal, while emerging formations conducive to high-quality localization

Methodology for simulating 5G and GNSS high-accuracy positioning

This paper focuses on the exploitation of fifth generation (5G) centimetre-wave (cmWave) and millimetre-wave (mmWave) transmissions for high-accuracy positioning, in order to complement the availability of Global Navigation Satellite Systems (GNSS) in harsh environments, such as urban canyons. Our goal is to present a representative methodology to simulate and assess their hybrid positioning capabilities over outdoor urban, suburban and rural scenarios. A novel scenario definition is proposed to integrate the network density of 5G deployments with the visibility masks of GNSS satellites, which helps to generate correlated scenarios of both technologies. Then, a generic and representative modeling of the 5G and GNSS observables is presented for snapshot positioning, which is suitable for standard protocols. The simulations results indicate that GNSS drives the achievable accuracy of its hybridisation with 5G cmWave, because non-line-of-sight (NLoS) conditions can limit the cmWave localization accuracy to around 20 m. The 5G performance is significantly improved with the use of mmWave positioning with dominant line-of-sight (LoS) conditions, which can even achieve sub-meter localization with one or more base stations. Therefore, these results show that NLoS conditions need to be weighted in 5G localization, in order to complement and outperform GNSS positioning over urban environments

Analysis and design of local positioning systems for localizing drones over bounded regions

[ES] El uso de los UAV (Unmanned-Aerial-Vehicles) ha crecido significativamente en los últimos años. Su inserción en el sector civil abre paso a su implementación en el sector agrícola, industrial, así como su uso para aplicaciones de vigilancia o reparto. No obstante, el desarrollo eficiente de estas aplicaciones depende de la capacidad del dron de posicionarse de forma autónoma. Si bien es común encontrar drones con sistemas de posicionamiento satelital (GNSS), estos sistemas resultan insuficientes para la navegación autónoma en entornos urbanos o de interiores. En estos escenarios, la implementación de sistemas de posicionamiento local (LPS) resulta de gran interés por su capacidad de adaptación. A través de la distribución óptima de las balizas que constituyen este sistema pueden adaptarse a la mayoría de entornos, así como mejorar sus prestaciones. No obstante, la complejidad de este problema se ha caracterizado como NP-Hard, lo que dificulta su resolución. En este Trabajo de Fin de Máster se desarrolla un algoritmo genético para optimizar LPS en diferentes entornos. Este algoritmo, innovador en el diseño de LPS para UAV, se prueba sobre un entorno urbano diseñado. Los resultados obtenidos denotan la validez de la metodología al obtener incertidumbres en la localización significativamente menores que los GNSS, siendo además substancial la mejoría introducida por el algoritmo genético diseñado.[EN] Unmanned-Aerial-Vehicles (UAV) widespread use have grown significantly in recent years. Their insertion in the civil sector allows their implementation in the agricultural and industrial sectors, as well as their use for surveillance or delivery applications. However, the efficient development of these applications depends on the drone’s ability to position itself autonomously. Although it is common to find drones with satellite positioning systems (GNSS), these systems are insufficient for autonomous navigation in urban or indoor environments. In these scenarios, the implementation of local positioning systems (LPS) is widely spread due to their adaptability capabilities. Through the optimal distribution of the sensors that constitute this system, they can adapt to almost any environment while also improving its performance. However, the complexity of this problem has been characterized as NP-Hard, which complicates its resolution. In this Master’s Final Project, a genetic algorithm is developed to optimize LPS in different environments. This algorithm, pioneer in the design of LPS for UAV localization, is tested on a generated urban environment. The results obtained denote the effectiveness of the methodology by obtaining location uncertainties significantly lower than GNSS. Moreover, the proposed genetic algorithm achieves greater results than non-optimized distributions, proving its capabilities