skip to main content

Title: Outage-Optimized Deployment of UAVs
We consider multiple unmanned aerial vehi- cles (UAVs) serving a density of ground terminals (GTs) as mobile base stations. The objective is to minimize the outage probability of GT-to-UAV transmissions. In this context, the optimal placement of UAVs under different UAV altitude constraints and GT densities is studied. First, using a random deployment argument, a general upper bound on the optimal outage probability is found for any density of GTs and any number of UAVs. Lower bounds on the performance of optimal deployments are also deter- mined. The upper and lower bounds are combined to show that the optimal outage probability decays exponentially with the number of UAVs for GT densities with finite support. Next, the structure of optimal deployments are studied when the common altitude constraint is large. In this case, for a wide class of GT densities, it is shown that all UAVs should be placed to the same location in an optimal deployment. A design implication is that one can use a single multi-antenna UAV as opposed to multiple single-antenna UAVs without loss of optimality. Numerical optimization of UAV deployments are carried out using particle swarm optimization. Simulation results are also presented to confirm the analytical findings.
Authors:
;
Award ID(s):
1814717
Publication Date:
NSF-PAR ID:
10118986
Journal Name:
IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
Sponsoring Org:
National Science Foundation
More Like this
  1. Unmanned aerial vehicles (UAVs) can supplement the existing ground-based heterogeneous cellular networks (Het-Nets), by replacing/supporting damaged infrastructure, providing real-time video support at the site of an emergency, offloading traffic in congested areas, extending coverage, and filling coverage gaps. In this paper, we introduce distributed algorithms that leverage UAV mobility, enhanced inter-cell interference coordination (ICIC), and cell range expansion (CRE) techniques defined in 3GPP Release-10 and 3GPP Release-11. Through Monte-Carlo simulations, we compare the system-wide 5th percentile spectral efficiency (5pSE) while optimizing the performance using a brute force algorithm, a heuristic-based sequential algorithm, and a deep Q-learning algorithm. The autonomous UAVs jointly optimize their location, ICIC parameters, and CRE to maximize 5pSE gains and minimize the outage probability. Our results show that the ICIC technique relying on a simple heuristic outperforms the ICIC technique based on deep Q-learning. Taking advantage of the multiple optimization parameters for interference coordination, the heuristic based ICIC technique can achieve 5pSE values that are reasonably close to those achieved with exhaustive brute force search techniques, at a significantly lower computational complexity.
  2. In this paper, we propose a generalized millimeter-Wave (mmWave) reconfigurable antenna multiple-input multiple-output (RA-MIMO) architecture that takes advantage of lens antennas. The considered antennas can generate multiple independent beams simultaneously using a single RF chain. This property, together with RA-MIMO, is used to combat small-scale fading and shadowing in mmWave bands. To this end, first, we derive a channel matrix for RA-MIMO. Then, we use rate-one space-time block codes (STBCs), together with phase-shifters at the receive reconfigurable antennas, to suppress the effect of small-scale fading. We consider two kinds of phase shifters: i) ideal which is error-free and ii) digital which adds quantization error. The goal of phase-shifters is to convert a complex-valued channel matrix into real-valued. Hence, it is possible to use rate-one STBCs for any dimension of RA-MIMO. We investigate diversity gain and derive an upper bound for symbol error rate in cases of ideal and digital phase-shifters. We show that RA-MIMO achieves the full-diversity gain with ideal phase-shifters and the full-diversity gain for digital phase-shifters when the number of quantization bits is higher than one. We investigate RA-MIMO in the presence of shadowing. Our analysis demonstrates that, by increasing the dimension of RA-MIMO, the outage probability decreasesmore »which means the effect of shadowing decreases. Numerical results verify our theoretical derivations.« less
  3. Unmanned Aerial Vehicles (UAVs) often lack the size, weight, and power to support large antenna arrays or a large number of radio chains. Despite such limitations, emerging applications that require the use of swarms, where UAVs form a pattern and coordinate towards a common goal, must have the capability to transmit in any direction in three-dimensional (3D) space from moment to moment. In this work, we design a measurement study to evaluate the role of antenna polarization diversity on UAV systems communicating in arbitrary 3D space. To do so, we construct flight patterns where one transmitting UAV is hovering at a high altitude (80 m) and a receiving UAV hovers at 114 different positions that span 3D space at a radial distance of approximately 20 m along equally-spaced elevation and azimuth angles. To understand the role of diverse antenna polarizations, both UAVs have a horizontally-mounted antenna and a vertically-mounted antenna-each attached to a dedicated radio chain-creating four wireless channels. With this measurement campaign, we seek to understand how to optimally select an antenna orientation and quantify the gains in such selections.
  4. We consider the communication complexity of a number of distributed optimization problems. We start with the problem of solving a linear system. Suppose there is a coordinator together with s servers P1, …, Ps, the i-th of which holds a subset A(i) x = b(i) of ni constraints of a linear system in d variables, and the coordinator would like to output an x ϵ ℝd for which A(i) x = b(i) for i = 1, …, s. We assume each coefficient of each constraint is specified using L bits. We first resolve the randomized and deterministic communication complexity in the point-to-point model of communication, showing it is (d2 L + sd) and (sd2L), respectively. We obtain similar results for the blackboard communication model. As a result of independent interest, we show the probability a random matrix with integer entries in {–2L, …, 2L} is invertible is 1–2−Θ(dL), whereas previously only 1 – 2−Θ(d) was known. When there is no solution to the linear system, a natural alternative is to find the solution minimizing the ℓp loss, which is the ℓp regression problem. While this problem has been studied, we give improved upper or lower bounds for every value ofmore »p ≥ 1. One takeaway message is that sampling and sketching techniques, which are commonly used in earlier work on distributed optimization, are neither optimal in the dependence on d nor on the dependence on the approximation ε, thus motivating new techniques from optimization to solve these problems. Towards this end, we consider the communication complexity of optimization tasks which generalize linear systems, such as linear, semi-definite, and convex programming. For linear programming, we first resolve the communication complexity when d is constant, showing it is (sL) in the point-to-point model. For general d and in the point-to-point model, we show an Õ(sd3L) upper bound and an (d2 L + sd) lower bound. In fact, we show if one perturbs the coefficients randomly by numbers as small as 2−Θ(L), then the upper bound is Õ(sd2L) + poly(dL), and so this bound holds for almost all linear programs. Our study motivates understanding the bit complexity of linear programming, which is related to the running time in the unit cost RAM model with words of O(log(nd)) bits, and we give the fastest known algorithms for linear programming in this model. Read More: https://epubs.siam.org/doi/10.1137/1.9781611975994.106« less
  5. While there has been significant progress on statistical theories in the information community, there is a lack of studies in information-theoretic distributed resource allocation to maximize information gain. With advanced technologies of unmanned aerial vehicles (UAVs) in response to corresponding revised FAA regulations, this study focuses on developing a new framework for utilizing UAVs in incident management. As a result of new computing technologies, predictive decision-making studies have recently improved ERV allocations for a sequence of incidents; however, these ground-based operations do not simultaneously capture network-wide information. This study incorporates a real-time aerial view using UAVs with three key improvements. First, aerial observations update the status of the freeway shoulder, allowing an ERV to safely travel at full speed. Second, observing parameters of the congestion shockwave provides accurate measurements of the true impact of an incident. Third, real-time information can be gathered on the clearance progress of an incident scene. We automate UAV and ERV allocation while satisfying constraints between these vehicles using a distributed constraint optimization problem (DCOP) framework. To find the optimal assignment of vehicles, the proposed model is formulated and solved using the Max-Sum approach. The system utility convergence is presented for different scenarios of grid size,more »number of incidents, and number of vehicles. We also present the solution of our model using the Distributed Stochastic Algorithm (DSA). DSA with exploration heuristics outperformed the Max-Sum algorithm when probability threshold p=0.5 but degrades for higher values of p.« less