Search arXivSearch

arXiv · 1708.09801

Proactive Eavesdropping via Jamming over HARQ-Based Communications

Abstract

This paper studies the wireless surveillance of a hybrid automatic repeat request (HARQ) based suspicious communication link over Rayleigh fading channels. We propose a proactive eavesdropping approach, where a half-duplex monitor can opportunistically jam the suspicious link to exploit its potential retransmissions for overhearing more efficiently. In particular, we consider that the suspicious link uses at most two HARQ rounds for transmitting the same data packet, and we focus on two cases without and with HARQ combining at the monitor receiver. In both cases, we aim to maximize the successful eavesdropping probability at the monitor, by adaptively allocating the jamming power in the first HARQ round according to fading channel conditions, subject to an average jamming power constraint. For both cases, we show that the optimal jamming power allocation follows a threshold-based policy, and the monitor jams with constant power when the eavesdropping channel gain is less than the threshold. Numerical results show that the proposed proactive eavesdropping scheme achieves higher successful eavesdropping probability than the conventional passive eavesdropping, and HARQ combining can help further improve the eavesdropping performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jie Xu, Kai Li, Lingjie Duan, Rui Zhang. 2017-08-31. Proactive Eavesdropping via Jamming over HARQ-Based Communications. https://arxiv.org/abs/1708.09801

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