Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2106.04223

Outage Performance of Multi-UAV Relaying-based Imperfect Hardware Hybrid Satellite-Terrestrial Networks

Pankaj K. Sharma·Deepika Gupta
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider an imperfect hardware hybrid satellite-terrestrial network (HSTN) where the satellite communication with a ground user equipment (UE) is aided by the multiple amplify-and-forward (AF) three-dimensional ($3$D) mobile unmanned aerial vehicle (UAV) relays. Herein, we consider that all transceiver nodes are corrupted by the radio frequency hardware impairments (RFHI). Further, a stochastic mixed mobility (MM) model is employed to characterize the instantaneous location of $3$D mobile UAV relays in a cylindrical cell with UE lying at its center on ground plane. Taking into account the aggregate RFHI model for satellite and UAV relay transceivers and the random $3$D distances-based path loss for UAV relay-UE links, we investigate the outage probability (OP) and corresponding asymptotic outage behaviour of the system under an opportunistic relay selection scheme in a unified form for shadowed-Rician satellite links' channels and Nakagami-\emph{m} as well as Rician terrestrial links' channels. We corroborate theoretical analysis by simulations.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pankaj K. Sharma, Deepika Gupta. 2021-06-08. Outage Performance of Multi-UAV Relaying-based Imperfect Hardware Hybrid Satellite-Terrestrial Networks. https://doi.org/10.1109/jsyst.2021.3090799

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗