Search arXivSearch

arXiv · 2212.13931

Transmitter Selection for Secrecy Against Colluding Eavesdroppers with Backhaul Uncertainty

Abstract

Due to the exponential growth of interconnected devices and reduced cell coverage, beyond fifth-generation networks will be dense. Thus, instead of wired backhaul, wireless backhaul will be cost-effective and flexible. For security in multi-transmitter systems, sub-optimal and optimal transmitter selection schemes exist. However, including backhaul activity knowledge available (BKA) and backhaul activity knowledge unavailable (BKU) cases and transmitter selection schemes, there is no generalized secrecy analysis method. Moreover, evaluation of the ergodic secrecy rate (ESR) of the optimal selection schemes is impossible using existing solution approaches. To address these, we propose two sub-optimal and optimal transmitter selection schemes for a small-cell multi-transmitter system in BKU or BKA cases in the presence of multiple colluding eavesdroppers. We derive the distribution of the ratio of the destination channel SNR and eavesdropping channel SNR, thereby providing different secrecy performance metrics uniformly irrespective of selection schemes and BKU or BKA cases. Simplified asymptotic expressions are provided to elucidate the influence of the system parameters and of the backhaul reliability. We observe that the secrecy performance improves when the knowledge of backhaul link activity is utilized, and the improvement is most noticeable when the backhaul is highly unreliable. We also observe that while the secrecy performance degrades with an increasing number of eavesdroppers, neither the asymptotic saturation value of the secrecy outage probability nor the rate of improvement of the ESR with signal-to-noise-ratio depends on the number of eavesdroppers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Burhan Wafai, Ankit Dubey, Chinmoy Kundu. 2023-06-04. Transmitter Selection for Secrecy Against Colluding Eavesdroppers with Backhaul Uncertainty. https://arxiv.org/abs/2212.13931

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