Search arXivSearch

arXiv · 2009.13993

A PHY Layer Security of a Jamming-Based Underlay Cognitive Hybrid Satellite-Terrestrial Network

Abstract

In this work, we investigate the physical layer security of a jamming-based underlay cognitive hybrid satellite-terrestrial network {consisting of a} radio frequency link at the first hop and an optical feeder at the second hop. Particularly, one secondary user (SU) is transmitting data {to an end-user} optical ground station {($\boldsymbol{D}$)} through the aid of a relay satellite, in the presence of {an active} eavesdropper {at} each hop. {Moreover}, another SU located in the first hop is acting as a friendly jammer and continuously broadcasting an artificial noise that cannot be decoded by the wiretapper so as to impinge positively on the system's secrecy. Owing to the underlying strategy, the SUs are permanently adjusting their transmit powers in order to avoid causing harmful interference to primary users. The RF channels undergo shadowed-Rician and Rayleigh fading models, while the optical link is subject to Gamma-Gamma {turbulence with pointing error}. Closed-form and asymptotic expressions for the intercept probability (IP) are derived considering two different scenarios regardless of the channel's conditions, namely (i) absence and (ii) presence of a friendly jammer. The effect of various key parameters on IP, e.g., {sources'} transmit power, {artificial noise}, maximum tolerated interference power, and fading severity parameters are examined. Precisely, we aim to answer the following question: could a friendly jammer further enhance the security of such a system even in a low SNR regime? All the derived results are corroborated by Monte Carlo simulations and new insights into the considered system's secrecy are gained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mounia Bouabdellah, Faissal El Bouanani. 2020-09-29. A PHY Layer Security of a Jamming-Based Underlay Cognitive Hybrid Satellite-Terrestrial Network. https://arxiv.org/abs/2009.13993

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