Search arXivSearch

arXiv · 2008.06137

Performance of UAV-assisted D2D Networks in the Finite Block-length Regime

Abstract

We develop a comprehensive framework to characterize and optimize the performance of a unmanned aerial vehicle (UAV)-assisted D2D network, where D2D transmissions underlay cellular transmissions. Different from conventional non-line-of-sight (NLoS) terrestrial transmissions, aerial transmissions are highly likely to experience line-of-sight (LoS). As such, characterizing the performance of mixed aerial-terrestrial networks with accurate fading models is critical to precise network performance characterization and resource optimization. We first characterize closed-form expressions for a variety of performance metrics such as frame decoding error probability (referred to as reliability), outage probability, and ergodic capacity of users. The terrestrial and aerial transmissions may experience either LoS Rician fading or NLoS Nakagami-m fading with a certain probability. Based on the derived expressions, we formulate a hierarchical bi-objective mixed-integer-nonlinear-programming (MINLP) problem to minimize the total transmit power of all users and maximize the aggregate throughput of D2D users subject to quality-of-service (QoS) measures (i.e., reliability and ergodic capacity) of cellular users. We model the proposed problem as a bi-partite one-to-many matching game. To solve this problem, we first obtain the optimal closed-form power allocations for each D2D and cellular user on any possible subchannel, and then incorporate them to devise efficient subchannel and power allocation algorithms. Complexity analysis of the proposed algorithms is presented. Numerical results verify the accuracy of our derived expressions and reveal the significance of aerial relays compared to ground relays in increasing the throughput of D2D pairs especially for distant D2D pairs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mehdi Monemi, Hina Tabassum. 2020-08-13. Performance of UAV-assisted D2D Networks in the Finite Block-length Regime. https://arxiv.org/abs/2008.06137

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