Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1601.03613

Non-orthogonal Multiple Access in Large-Scale Underlay Cognitive Radio Networks

Yuanwei Liu·Zhiguo Ding·Maged Elkashlan·Jinhong Yuan
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, non-orthogonal multiple access (NOMA) is applied to large-scale underlay cognitive radio (CR) networks with randomly deployed users. In order to characterize the performance of the considered network, new closed-form expressions of the outage probability are derived using stochastic-geometry. More importantly, by carrying out the diversity analysis, new insights are obtained under the two scenarios with different power constraints: 1) fixed transmit power of the primary transmitters (PTs), and 2) transmit power of the PTs being proportional to that of the secondary base station. For the first scenario, a diversity order of $m$ is experienced at the $m$-th ordered NOMA user. For the second scenario, there is an asymptotic error floor for the outage probability. Simulation results are provided to verify the accuracy of the derived results. A pivotal conclusion is reached that by carefully designing target data rates and power allocation coefficients of users, NOMA can outperform conventional orthogonal multiple access in underlay CR networks.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuanwei Liu, Zhiguo Ding, Maged Elkashlan, Jinhong Yuan. 2016-01-14. Non-orthogonal Multiple Access in Large-Scale Underlay Cognitive Radio Networks. https://doi.org/10.1109/tvt.2016.2524694

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗