Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.12166

Signaling Design for MIMO-NOMA with Different Security Requirements

Yue Qi·Mojtaba Vaezi
View original source ↗Read source document ↗Export metadata ↓

Abstract

Signaling design for secure transmission in two-user multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks is investigated in this paper. The base station broadcasts multicast data to all users and also integrates additional services, unicast data targeted to certain users, and confidential data protected against eavesdroppers. We categorize the above MIMO-NOMA with different security requirements into several communication scenarios. The associated problem in each scenario is nonconvex. We propose a unified approach, called the power splitting scheme, for optimizing the rate equations corresponding to the scenarios. The proposed method decomposes the optimization of the secure MIMO-NOMA channel into a set of simpler problems, including multicast, point-to-point, and wiretap MIMO problems, corresponding to the three basic messages: multicast, private/unicast, and confidential messages. We then leverage existing solutions to design signaling for the above problems such that the messages are transmitted with high security and reliability. Numerical results illustrate the efficacy of the proposed covariance matrix design in secure MIMO-NOMA transmission. The proposed method also outperforms existing solutions, when applicable. In the case of no multicast messages, we also reformulate the nonconvex problem into weighted sum rate (WSR) maximization problems by applying the block successive maximization method and generalizing the zero duality gap. The two methods have their advantages and limitations. Power splitting is a general tool that can be applied to the MIMO-NOMA with any combination of the three messages (multicast, private, and confidential) whereas WSR maximization shows greater potential for secure MIMO-NOMA communication without multicasting. In such cases, WSR maximization provides a slightly better rate than the power splitting method.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yue Qi, Mojtaba Vaezi. 2021-12-22. Signaling Design for MIMO-NOMA with Different Security Requirements. https://doi.org/10.1109/tsp.2022.3156915

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↗