Search arXivSearch

arXiv · 2109.13629

Weighted Secrecy Coverage Analysis and the Impact of Friendly Jamming over UAV-Enabled Networks

Abstract

In 5G and beyond networks, Unmanned Aerial Vehicles (UAV) are an attractive solution to enhance the secrecy of a wireless systems by exploiting their predominant LOS links and spacial manoeuvrability to introduce a friendly jamming. In this work, we investigate the impact of two cooperative UAV-based jammers on the secrecy performance of a ground wireless wiretap channel by considering secrecy-area related metrics, the jamming coverage and jamming efficiency. Moreover, we propose a hybrid metric, the so-called Weighted Secrecy Coverage (WSC) that can be used as a metric for gaining insights on the optimal deployments of the UAV jammers to provide the best exploration of jamming signals. For evaluating these metrics, we derive a closed-form position-based metric, the secrecy improvement, and propose an analogous computationally simpler metric. Our simulations show that a balanced power allocation between the two UAVs leads to the best performances, as well as a symmetrical positioning behind the line of sight between the legitimate transmitter and receiver. Moreover, there exist an optimal UAV height for the jammers. Finally, we propose a sub-optimal and simpler problem for the maximisation of the WSC.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

X. A. Flores Cabezas, D. P. Moya Osorio, M. Latva-aho. 2021-09-28. Weighted Secrecy Coverage Analysis and the Impact of Friendly Jamming over UAV-Enabled Networks. https://doi.org/10.1109/eucnc%2F6gsummit51104.2021.9482493

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