arXiv subjects

David Gesbert

Publications and source records attributed to David Gesbert.

At least 55 records · Page 3Linked to original sources

arXiv2021

Multi-UAV Path Planning for Wireless Data Harvesting with Deep Reinforcement Learning

Harvesting data from distributed Internet of Things (IoT) devices with multiple autonomous unmanned aerial vehicles (UAVs) is a challenging problem requiring flexible path planning methods. We propose a multi-agent reinforcement learning (MARL) approach that, in contrast to previous work, can adapt to profound changes in the scenario parameters defining the data harvesting mission, such as the number of deployed UAVs, number, position and data amount of IoT devices, or the maximum flying time, without the need to perform expensive recomputations or relearn control policies. We formulate the path planning problem for a cooperative, non-communicating, and homogeneous team of UAVs tasked with maximizing collected data from distributed IoT sensor nodes subject to flying time and collision avoidance constraints. The path planning problem is translated into a decentralized partially observable Markov decision process (Dec-POMDP), which we solve through a deep reinforcement learning (DRL) approach, approximating the optimal UAV control policy without prior knowledge of the challenging wireless channel characteristics in dense urban environments. By exploiting a combination of centered global and local map representations of the environment that are fed into convolutional layers of the agents, we show that our proposed network architecture enables the agents to cooperate effectively by carefully dividing the data collection task among themselves, adapt to large complex environments and state spaces, and make movement decisions that balance data collection goals, flight-time efficiency, and navigation constraints. Finally, learning a control policy that generalizes over the scenario parameter space enables us to analyze the influence of individual parameters on collection performance and provide some intuition about system-level benefits.

cs.MA↗

arXiv2021

A Received Power Model for Reconfigurable Intelligent Surface and Measurement-based Validations

The idea of using a Reconfigurable Intelligent Surface (RIS) consisting of a large array of passive scattering elements to assist wireless communication systems has recently attracted much attention from academia and industry. A central issue with RIS is how much power they can effectively convey to the target radio nodes. Regarding this question, several power level models exist in the literature but few have been validated through experiments. In this paper, we propose a radar cross section-based received power model for an RIS-aided wireless communication system that is rooted in the physical properties of RIS. Our proposed model follows the intuition that the received power is related to the distances from the transmitter/receiver to the RIS, the angles in the TX-RIS-RX triangle, the effective area of each element, and the reflection coefficient of each element. To the best of our knowledge, this paper is the first to model the angle-dependent phase shift of the reflection coefficient, which is typically ignored in existing literature. We further measure the received power with our experimental platform in different scenarios to validate our model. The measurement results show that our model is appropriate both in near field and far field and can characterize the impact of angles well.

cs.IT↗

arXiv2021

UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning

Coverage path planning (CPP) is the task of designing a trajectory that enables a mobile agent to travel over every point of an area of interest. We propose a new method to control an unmanned aerial vehicle (UAV) carrying a camera on a CPP mission with random start positions and multiple options for landing positions in an environment containing no-fly zones. While numerous approaches have been proposed to solve similar CPP problems, we leverage end-to-end reinforcement learning (RL) to learn a control policy that generalizes over varying power constraints for the UAV. Despite recent improvements in battery technology, the maximum flying range of small UAVs is still a severe constraint, which is exacerbated by variations in the UAV's power consumption that are hard to predict. By using map-like input channels to feed spatial information through convolutional network layers to the agent, we are able to train a double deep Q-network (DDQN) to make control decisions for the UAV, balancing limited power budget and coverage goal. The proposed method can be applied to a wide variety of environments and harmonizes complex goal structures with system constraints.

cs.RO↗

arXiv2021

Vehicle Localization via Cooperative Channel Mapping

This paper addresses vehicle positioning, a topic whose importance has risen dramatically in the context of future autonomous driving systems. While classical methods that use GPS and/or beacon signals from network infrastructure for triangulation tend to be sensitive to multi-paths and signal obstruction, our method exhibits robustness with respect to such phenomena. Our approach builds on the recently proposed Channel-SLAM method which first enabled leveraging of multi-path so as to improve (single) vehicle positioning. Here, we propose a cooperative mapping approach which builds upon the Channel-SLAM concept, referred to here as Team Channel-SLAM. Team Channel-SLAM not only exploits the stationary nature of many reflecting objects around the vehicle, but also capitalizes on the multi-vehicle nature of road traffic. The key intuition behind our method is the exploitation for the first time of the correlation between reflectors around multiple neighboring vehicles. An algorithm is derived for reflector selection and estimation, combined with a team particle filter (TPF) so as to achieve high precision simultaneous multiple vehicle positioning. We obtain large improvement over the single-vehicle positioning scenario, with gains being already noticeable for moderate vehicle densities, such as over 40% improvement for a vehicle density as low as 4 vehicles in 132 meters' length road.

eess.SP↗

arXiv2021

D2D-Aided Multi-Antenna Multicasting under Generalized CSIT

Multicasting, where a base station (BS) wishes to convey the same message to several user equipments (UEs), represents a common yet highly challenging wireless scenario. In fact, guaranteeing decodability by the whole UE population proves to be a major performance bottleneck since the UEs in poor channel conditions ultimately determine the achievable rate. To overcome this issue, two-phase cooperative multicasting schemes, which use conventional multicasting in a first phase and leverage device-to-device (D2D) communications in a second phase to effectively spread the message, have been extensively studied. However, most works are limited either to the simple case of single-antenna BS or to a specific channel state information at the transmitter (CSIT) setup. This paper proposes a general two-phase framework that is applicable to the cases of perfect, statistical, and topological CSIT in the presence of multiple antennas at the BS. The proposed method exploits the precoding capabilities at the BS, which enable targeting specific UEs that can effectively serve as D2D relays towards the remaining UEs, and maximize the multicast rate under some outage constraint. Numerical results show that our schemes bring substantial gains over traditional single-phase multicasting and overcome the worst-UE bottleneck behavior in all the considered CSIT configurations.

cs.IT↗

arXiv2020

User Coordination for Fast Beam Training in FDD Multi-User Massive MIMO

Massive multiple-input multiple-output (mMIMO) communications are one of the enabling technologies of 5G and beyond networks. While prior work indicates that mMIMO networks employing time division duplexing have a significant capacity growth potential, deploying mMIMO in frequency division duplexing (FDD) networks remains problematic. The two main difficulties in FDD networks are the scalability of the downlink reference signals and the overhead associated with the required uplink feedback for channel state information (CSI) acquisition. To address these difficulties, most existing methods utilize assumptions on the radio environment such as channel sparsity or angular reciprocity. In this work, we propose a novel cooperative method for a scalable and low-overhead approach to FDD mMIMO under the so-called grid-of-beams architecture. The key idea behind our scheme lies in the exploitation of the near-common signal propagation paths that are often found across several mobile users located in nearby regions, through a coordination mechanism. In doing so, we leverage the recently specified device-to-device communications capability in 5G networks. Specifically, we design beam selection algorithms capable of striking a balance between CSI acquisition overhead and multi-user interference mitigation. The selection exploits statistical information, through so-called covariance shaping. Simulation results demonstrate the effectiveness of the proposed algorithms, which prove particularly well-suited to rapidly-varying channels with short coherence time.

eess.SP↗

arXiv2020

UAV Path Planning for Wireless Data Harvesting: A Deep Reinforcement Learning Approach

Autonomous deployment of unmanned aerial vehicles (UAVs) supporting next-generation communication networks requires efficient trajectory planning methods. We propose a new end-to-end reinforcement learning (RL) approach to UAV-enabled data collection from Internet of Things (IoT) devices in an urban environment. An autonomous drone is tasked with gathering data from distributed sensor nodes subject to limited flying time and obstacle avoidance. While previous approaches, learning and non-learning based, must perform expensive recomputations or relearn a behavior when important scenario parameters such as the number of sensors, sensor positions, or maximum flying time, change, we train a double deep Q-network (DDQN) with combined experience replay to learn a UAV control policy that generalizes over changing scenario parameters. By exploiting a multi-layer map of the environment fed through convolutional network layers to the agent, we show that our proposed network architecture enables the agent to make movement decisions for a variety of scenario parameters that balance the data collection goal with flight time efficiency and safety constraints. Considerable advantages in learning efficiency from using a map centered on the UAV's position over a non-centered map are also illustrated.

cs.LG↗

arXiv2020

Team Deep Mixture of Experts for Distributed Power Control

In the context of wireless networking, it was recently shown that multiple DNNs can be jointly trained to offer a desired collaborative behaviour capable of coping with a broad range of sensing uncertainties. In particular, it was established that DNNs can be used to derive policies that are robust with respect to the information noise statistic affecting the local information (e.g. CSI in a wireless network) used by each agent (e.g. transmitter) to make its decision. While promising, a major challenge in the implementation of such method is that information noise statistics may differ from agent to agent and, more importantly, that such statistics may not be available at the time of training or may evolve over time, making burdensome retraining necessary. This situation makes it desirable to devise a "universal" machine learning model, which can be trained once for all so as to allow for decentralized cooperation in any future feedback noise environment. With this goal in mind, we propose an architecture inspired from the well-known Mixture of Experts (MoE) model, which was previously used for non-linear regression and classification tasks in various contexts, such as computer vision and speech recognition. We consider the decentralized power control problem as an example to showcase the validity of the proposed model and to compare it against other power control algorithms. We show the ability of the so called Team-DMoE model to efficiently track time-varying statistical scenarios.

cs.IT↗

arXiv2020

Submodularity in Action: From Machine Learning to Signal Processing Applications

Submodularity is a discrete domain functional property that can be interpreted as mimicking the role of the well-known convexity/concavity properties in the continuous domain. Submodular functions exhibit strong structure that lead to efficient optimization algorithms with provable near-optimality guarantees. These characteristics, namely, efficiency and provable performance bounds, are of particular interest for signal processing (SP) and machine learning (ML) practitioners as a variety of discrete optimization problems are encountered in a wide range of applications. Conventionally, two general approaches exist to solve discrete problems: $(i)$ relaxation into the continuous domain to obtain an approximate solution, or $(ii)$ development of a tailored algorithm that applies directly in the discrete domain. In both approaches, worst-case performance guarantees are often hard to establish. Furthermore, they are often complex, thus not practical for large-scale problems. In this paper, we show how certain scenarios lend themselves to exploiting submodularity so as to construct scalable solutions with provable worst-case performance guarantees. We introduce a variety of submodular-friendly applications, and elucidate the relation of submodularity to convexity and concavity which enables efficient optimization. With a mixture of theory and practice, we present different flavors of submodularity accompanying illustrative real-world case studies from modern SP and ML. In all cases, optimization algorithms are presented, along with hints on how optimality guarantees can be established.

eess.SP↗

arXiv2020

DoF Region of the Decentralized MIMO Broadcast Channel -- How many informed antennas do we need?

In this work, we study the impact of imperfect sharing of the Channel State Information (CSI) available at the transmitters on a Network MIMO setting in which a set of $M$ transmit antennas, possibly not co-located, jointly serve two multi-antenna users endowed with $N_1$ and $N_2$ antennas, respectively. We consider the case where only a subset of $k$ transmit antennas have access to perfect CSI, whereas the other $M-k$ transmit antennas have only access to finite precision CSI. The analysis of this configuration aims to answer the question of how much an extra informed antenna can help. We model this scenario as a Decentralized MIMO Broadcast Channel (BC) and characterize the Degrees-of-Freedom (DoF) region, showing that only $k=\max(N_1,N_2)$ antennas with perfect CSI are needed to achieve the DoF of the conventional BC with ubiquitous perfect CSI. Furthermore, we identify the increase of DoF obtained by providing CSI to an extra transmit antenna.

cs.IT↗

arXiv2020

Addressing the curse of mobility in massive MIMO with Prony-based angular-delay domain channel predictions

Massive MIMO is widely touted as an enabling technology for 5th generation (5G) mobile communications and beyond. On paper, the large excess of base station (BS) antennas promises unprecedented spectral efficiency gains. Unfortunately, during the initial phase of industrial testing, a practical challenge arose which threatens to undermine the actual deployment of massive MIMO: user mobility-induced channel Doppler. In fact, testing teams reported that in moderate-mobility scenarios, e.g., 30 km/h of user equipment (UE) speed, the performance drops up to 50% compared to the low-mobility scenario, a problem rooted in the acute sensitivity of massive MIMO to this channel Doppler, and not foreseen by many theoretical papers on the subject. In order to deal with this "curse of mobility", we propose a novel form of channel prediction method, named Prony-based angular-delay domain (PAD) prediction, which is built on exploiting the specific angle-delay-Doppler structure of the multipath. In particular, our method relies on the high angular-delay resolution which arises in the context of 5G. Our theoretical analysis shows that when the number of base station antennas and the bandwidth are large, the prediction error of our PAD algorithm converges to zero for any UE velocity level, provided that only two accurate enough previous channel samples are available. Moreover, when the channel samples are inaccurate, we propose to combine the PAD algorithm with a denoising method for channel estimation phase based on the subspace structure and the long-term statistics of the channel observations. Simulation results show that under a realistic channel model of 3GPP in rich scattering environment, our proposed method is able to overcome this challenge and even approaches the performance of stationary scenarios where the channels do not vary at all.

cs.IT↗

arXiv2020

Decentralizing Multi-Operator Cognitive Radio Resource Allocation: An Asymptotic Analysis

We address the problem of resource allocation (RA) for spectrum underlay in a cognitive radio (CR) communication system with multiple secondary operators sharing resource with an incumbent primary operator. The multiple secondary operator RA problem is well known to be especially challenging because of the inter-operator coupling constraints arising in the optimization problem, which render impractical inter-operator information exchange necessary. In this paper, we consider a satellite setting for multi-operator CR. In the CR maturation regime, i.e., the period in which the secondary subscriber density is growing yet remains much below that of incumbent users, we show that in fact the inter-operator mutual constraints can be neglected, thus making distributed (across secondary operators) optimization possible. Furthermore, we establish analytically that the mutual constraints asymptotically vanish with the primary user density.

eess.SP↗

arXiv2020

Distributed Resource Allocation Algorithms for Multi-Operator Cognitive Communication Systems

We address the problem of resource allocation (RA) in a cognitive radio (CR) communication system with multiple secondary operators sharing spectrum with an incumbent primary operator. The key challenge of the RA problem is the inter-operator coordination arising in the optimization problem so that the aggregated interference at the primary users (PUs) does not exceed the target threshold. While this problem is easily solvable if a centralized unit could access information of all secondary operators, it becomes challenging in a realistic scenario. In this paper, considering a satellite setting, we alleviate this problem by proposing two approaches to reduce the information exchange level among the secondary operators. In the first approach, we formulate an RA scheme based on a partial information sharing method which enables distributed optimization across secondary operators. In the second approach, instead of exchanging secondary users (SUs) information, the operators only exchange their contributions of the interference-level and RA is performed locally across secondary operators. These two approaches, for the first time in this context, provide a trade-off between performance and level of inter-operator information exchange. Through the numerical simulations, we explain this trade-off and illustrate the penalty resulting from partial information exchange.

eess.SP↗

arXiv2020

On the Degrees-of-Freedom of the K-user Distributed Broadcast Channel

We study the Degrees-of-Freedom (DoF) in a wireless setting in which K Transmitters (TXs) aim at jointly serving K users. The performance is studied when the TXs are faced with a distributed Channel State Information (CSI) configuration in which each TX has access to its own multi-user imperfect channel estimate based on which it designs its transmit coefficients. The channel estimates are not only imperfectly acquired but they are also imperfectly shared between the TXs. Our first contribution consists of computing a genie-aided upper bound for the DoF of that setting. Our main contribution is then to develop a new robust transmission scheme that leverages the different qualities of CSI available at the TXs to improve the achieved DoF. We show the surprising result that there is a CSI regime, coined the Weak-CSIT regime, in which the genie-aided upper bound is achieved by the proposed transmission scheme. Interestingly, the optimal DoF in the Weak-CSIT regime only depends on the CSI quality at the best informed TX and not on the CSI quality at all other TXs.

cs.IT↗

arXiv2020

Team Channel-SLAM: A Cooperative Mapping Approach to Vehicle Localization

Vehicle positioning is considered a key element in autonomous driving systems. While conventional positioning requires the use of GPS and/or beacon signals from network infrastructure for triangulation, they are sensitive to multi-path and signal obstruction. However, recent proposals like the Channel-SLAM method showed it was possible in principle to in fact leverage multi-path to improve positioning of a single vehicle. In this paper, we derive a cooperative Channel-SLAM framework, which is referred as Team Channel-SLAM. Different from the previous work, Team Channel-SLAM not only exploits the stationary nature of reflecting objects around the receiver to characterize the location of a single vehicle through multi-path signals, but also capitalizes on the multi-vehicle aspects of road traffic to further improve positioning.Specifically, Team Channel-SLAM exploits the correlation between reflectors around multiple neighboring vehicles to achieve high precision multiple vehicle positioning. Our method uses affinity propagation clustering and cooperative particle filter. The new framework is shown to give substantial improvement over the single vehicle positioning situation.

eess.SP↗

arXiv2019

Predicting Device-to-Device Channels from Cellular Channel Measurements: A Learning Approach

Device-to-device (D2D) communication, which enables a direct connection between users while bypassing the cellular channels to base stations (BSs), is a promising way to offload the traffic from conventional cellular networks. In D2D communication, one recurring problem is that, in order to optimally allocate resources across D2D and cellular users, the knowledge of D2D channel gains is needed. However, such knowledge is hard to obtain at reasonable signaling costs. In this paper, we show this problem can be circumvented by tapping into the information provided by the estimation of the cellular channels between the users and surrounding BSs as this estimation is done anyway for a normal operation of the network. While the cellular and D2D channel gains exhibit independent fast fading behavior, we show that average gains of the cellular and D2D channels share a non-explicit correlation structure, which is rooted into the network topology, terrain, and buildings setup. We propose a machine (deep) learning approach capable of predicting the D2D channel gains from seemingly independent cellular channels. Our results show a high degree of convergence between true and predicted D2D channel gains. The predicted gains allow to reach a near-optimal communication capacity in many radio resource management algorithms.

cs.IT↗

arXiv2019

3D-Map Assisted UAV Trajectory Design Under Cellular Connectivity Constraints

The enabling of safe cellular controlled unmanned aerial vehicle (UAV) beyond visual line of sight is expected to open important future opportunities in the area of transportation, goods delivery, and system monitoring. A key challenge in this area lies in the design of trajectories which, while allowing the completion of the UAV mission, can guarantee reliable cellular connectivity all along the path. Previous approaches in this domain have considered simplistic propagation model assumptions (e.g. Line of Sight based) or more advanced models but with computationally demanding optimized solutions. In this paper, we propose a novel approach for trajectory design using a coverage map that can be obtained with a combination of 3D map of the environment and radio propagation models. Leveraging on the convexity of sub-regions within the coverage map, we propose a low-complexity graph based algorithm which is shown to achieve quasi-optimal performance at a fraction of the computational cost of known optimal methods.

cs.IT↗

arXiv2019

Efficient Local Map Search Algorithms for the Placement of Flying Relays

This paper studies the optimal unmanned aerial vehicle (UAV) placement problem for wireless networking. The UAV operates as a flying wireless relay to provide coverage extension for a base station (BS) and deliver capacity boost to a user shadowed by obstacles. While existing methods rely on statistical models for potential blockage of a direct propagation link, we propose an approach capable of leveraging local terrain information to offer performance guarantees. The proposed method allows to strike the best trade-off between minimizing propagation distances to ground terminals and discovering good propagation conditions. The algorithm only requires several propagation parameters, but it is capable to avoid deep propagation shadowing and is proven to find the globally optimal UAV position. Only a local exploration over the target area is required, and the maximum length of search trajectory is linear to the geographical scale. Hence, it lends itself to online search. Significant throughput gains are found when compared to other positioning approaches based on statistical propagation models.

cs.IT↗