Search arXivSearch

arXiv · 1801.00443

Capacity Characterization of UAV-Enabled Two-User Broadcast Channel

Abstract

Although prior works have exploited the UAV's mobility to enhance the wireless communication performance under different setups, the fundamental capacity limits of UAV-enabled/aided multiuser communication systems have not yet been characterized. To fill this gap, we consider in this paper a UAV-enabled two-user broadcast channel (BC), where a UAV flying at a constant altitude is deployed to send independent information to two users at different fixed locations on the ground. We aim to characterize the capacity region of this new type of BC over a given UAV flight duration, by jointly optimizing the UAV's trajectory and transmit power/rate allocations over time, subject to the UAV's maximum speed and maximum transmit power constraints. First, to draw essential insights, we consider two special cases with asymptotically large/low UAV flight duration/speed, respectively. For the former case, it is shown that a simple hover-fly-hover (HFH) UAV trajectory with time division multiple access (TDMA) based orthogonal multiuser transmission is capacity-achieving, while in the latter case, the UAV should hover at a fixed location that is nearer to the user with larger achievable rate and in general superposition coding (SC) based non-orthogonal transmission with interference cancellation at the receiver of the nearer user is required. Next, we consider the general case with finite UAV speed and flight duration. We show that the optimal UAV trajectory should follow a general HFH structure, i.e., the UAV successively hovers at a pair of initial and final locations above the line segment of the two users each with a certain amount of time and flies unidirectionally between them at the maximum speed, and SC is generally needed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qingqing Wu, Jie Xu, Rui Zhang. 2018-01-06. Capacity Characterization of UAV-Enabled Two-User Broadcast Channel. https://arxiv.org/abs/1801.00443

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT