Searcharxiv⌕ Search

arXiv subjects

Pham Q. Viet

Publications and source records attributed to Pham Q. Viet.

7 recordsLinked to original sources

Path Planning for Aerial Relays via Probabilistic Roadmaps

Autonomous uncrewed aerial vehicles (UAVs) can be utilized as aerial relays to serve users far from terrestrial infrastructure. Unfortunately, existing algorithms for aerial relay path planning cannot accommodate general flight constraints or channel models. This is required in practice due to connectivity constraints, the presence of obstacles (e.g., buildings), and regulations. This paper proposes a framework that overcomes these limitations by spatially discretizing the flight region. To cope with the resulting exponential growth in complexity, the framework adopts a probabilistic roadmap approach, where a shortest path is found through a graph of randomly generated states. To attain high optimality with affordable complexity, the probability distribution used to generate these states is designed based on heuristic path planners with theoretical guarantees. The algorithms derived in this framework not only overcome the main limitations of existing schemes but also entail smaller computational complexity. Extensive theoretical and numerical results corroborate the merits of the proposed approach.

math.OC↗

Radio Map Estimation: Empirical Validation and Analysis

Radio maps provide metrics such as the received signal strength at every location in a geographical region of interest. Extensive research has been carried out in this context, but it relies almost exclusively on synthetic-data experiments. Thus, the practical aspects of the radio map estimation (RME) problem as well as the performance of existing estimators in the real world remain unknown. To fill this gap end, this paper puts forth the first comprehensive, rigorous, and reproducible study of RME with real data. The main contributions include (C1) an assessment of the viability of RME based on the estimation error that can be achieved, (C2) the analysis of the main phenomena and trade-offs involved in RME, including the experimental verification of theoretical findings in the literature, and (C3) a thorough evaluation of a wide range of estimators on realworld data. Remarkably, this reveals that the performance gain of existing deep estimators in their pure form may not compensate for their complexity. A simple enhancement (C4) is proposed to alleviate this issue. The vast amount of data collected for this study is published along with the developed simulator to enable research on new schemes, hopefully bringing RME one step closer to practical deployment.

eess.SP↗

Spatial Transformers for Radio Map Estimation

Radio map estimation (RME) involves spatial interpolation of radio measurements to predict metrics such as the received signal strength at locations where no measurements were collected. The most popular estimators nowadays project the measurement locations to a regular grid and complete the resulting measurement tensor with a convolutional deep neural network. Unfortunately, these approaches suffer from poor spatial resolution and require a great number of parameters. The first contribution of this paper addresses these limitations by means of an attention-based estimator named Spatial TransfOrmer for Radio Map estimation (STORM). This scheme not only outperforms the existing estimators, but also exhibits lower computational complexity, translation equivariance, rotation equivariance, and full spatial resolution. The second contribution is an extended transformer architecture that allows STORM to perform active sensing, by which the next measurement location is selected based on the previous measurements. This is particularly useful for minimization of drive tests (MDT) in cellular networks, where operators request user equipment to collect measurements. Finally, STORM is extensively validated by experiments with one ray-tracing and two real-measurement datasets.

math.OC↗

Aerial Base Station Placement via Propagation Radio Maps

The deployment of aerial base stations (ABSs) on unmanned aerial vehicles (UAVs) presents a promising solution for extending cellular connectivity to areas where terrestrial infrastructure is overloaded, damaged, or absent. A pivotal challenge in this domain is to decide the locations of a set of ABSs to effectively serve ground-based users. Most existing approaches oversimplify this problem by assuming that the channel gain between two points is a function of solely distance and, sometimes, also the elevation angle. In turn, this paper leverages propagation radio maps to account for arbitrary air-to-ground channel gains. This methodology enables the identification of an approximately minimal set of locations where ABSs need to be deployed to ensure that all ground terminals achieve a target service rate, while adhering to backhaul capacity limitations and avoiding designated no-fly zones. Relying on a convex relaxation technique and the alternating direction method of multipliers (ADMM), this paper puts forth a solver whose computational complexity scales linearly with the number of ground terminals. Convergence is established analytically and an extensive set of simulations corroborate the merits of the proposed scheme relative to conventional methods.

math.OC↗

Implicit Channel Charting with Application to UAV-aided Localization

Traditional localization algorithms based on features such as time difference of arrival are impaired by non-line of sight propagation, which negatively affects the consistency that they expect among distance estimates. Instead, fingerprinting localization is robust to these propagation conditions but requires the costly collection of large data sets. To alleviate these limitations, the present paper capitalizes on the recently-proposed notion of channel charting to learn the geometry of the space that contains the channel state information (CSI) measurements collected by the nodes to be localized. The proposed algorithm utilizes a deep neural network that learns distances between pairs of nodes using their measured CSI. Unlike standard channel charting approaches, this algorithm directly works with the physical geometry and therefore only implicitly learns the geometry of the radio domain. Simulation results demonstrate that the proposed algorithm outperforms its competitors and allows accurate localization in emergency scenarios using an unmanned aerial vehicle.

math.OC↗

Aerial Base Station Placement: A Tutorial Introduction

The deployment of Aerial Base Stations (ABSs) mounted on board Unmanned Aerial Vehicles (UAVs) is emerging as a promising technology to provide connectivity in areas where terrestrial infrastructure is insufficient or absent. This may occur for example in remote areas, large events, emergency situations, or areas affected by a natural disaster such as a wildfire or a tsunami. To successfully materialize this goal, it is required that ABSs are placed at locations in 3D space that ensure a high quality of service (QoS) to the ground terminals. This paper provides a tutorial introduction to this ABS placement problem where the fundamental challenges and trade-offs are first investigated by means of a toy application example. Next, the different approaches in the literature to address the aforementioned challenges in both 2D or 3D space will be introduced and a discussion on adaptive placement will be provided. The paper is concluded by discussing future research directions.

cs.RO↗

Aerial Base Station Placement Leveraging Radio Tomographic Maps

Mobile base stations on board unmanned aerial vehicles (UAVs) promise to deliver connectivity to those areas where the terrestrial infrastructure is overloaded, damaged, or absent. A fundamental problem in this context involves determining a minimal set of locations in 3D space where such aerial base stations (ABSs) must be deployed to provide coverage to a set of users. While nearly all existing approaches rely on average characterizations of the propagation medium, this work develops a scheme where the actual channel information is exploited by means of a radio tomographic map. A convex optimization approach is presented to minimize the number of required ABSs while ensuring that the UAVs do not enter no-fly regions. A simulation study reveals that the proposed algorithm markedly outperforms its competitors.

math.OC↗