Search arXivSearch

arXiv · 1411.0228

Relay-Selection Improves the Security-Reliability Trade-off in Cognitive Radio Systems

Abstract

We consider a cognitive radio (CR) network consisting of a secondary transmitter (ST), a secondary destination (SD) and multiple secondary relays (SRs) in the presence of an eavesdropper. We rely on careful relay selection for protecting the ST-SD transmission against the eavesdropper with the aid of both single-relay and multi-relay selection. To be specific, only the "best" SR is chosen in the single-relay selection for assisting the secondary transmission, whereas the multi-relay selection invokes multiple SRs for simultaneously forwarding the ST's transmission to the SD. We analyze both the intercept probability and outage probability of the proposed single-relay and multi-relay selection schemes for the secondary transmission relying on realistic spectrum sensing. We also evaluate the performance of classic direct transmission and artificial noise based methods for the purpose of comparison with the proposed relay selection schemes. It is shown that as the intercept probability requirement is relaxed, the outage performance of the direct transmission, the artificial noise based and the relay selection schemes improves, and vice versa. This implies a trade-off between the security and reliability of the secondary transmission in the presence of eavesdropping attacks, which is referred to as the security-reliability trade-off (SRT). Furthermore, we demonstrate that the SRTs of the single-relay and multi-relay selection schemes are generally better than that of classic direct transmission. Moreover, as the number of SRs increases, the SRTs of the proposed single-relay and multi-relay selection approaches significantly improve. Finally, our numerical results show that as expected, the multi-relay selection scheme achieves a better SRT performance than the single-relay selection.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yulong Zou, Benoit Champagne, Wei-Ping Zhu, Lajos Hanzo. 2014-11-29. Relay-Selection Improves the Security-Reliability Trade-off in Cognitive Radio Systems. https://doi.org/10.1109/tcomm.2014.2377239

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