Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Communications workshops

Novel Signaling Design for MIMO-NOMA Against External and Internal Eavesdroppers

Yue Qi, Mojtaba Vaezi, Wonjae Shin

Published May 16, 2022• 0 citations
Publisher

Abstract

Secure communication over two related multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks is investigated. Both networks consist of two legitimate (internal) users and an eavesdropper (external user). In one network, in addition to the external eavesdropper, one of the internal users is also seen as an eavesdropper to the other internal user, resulting in layered confidentiality. The secrecy capacity expressions of these networks are composed of nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices. To overcome this challenge, we form a weighted sum-rate maximization problem for each network and apply the block successive maximization method. This method updates the primal variable blocks successively by maximizing local lower-bounds of the original problem, followed by an update for the dual variable in a closed form. The solutions for these problems design covariance matrices corresponding to the transmitted messages such that they are transmitted securely and reliably. Numerical results illustrate the efficacy of the proposed signaling design for both MIMO-NOMA networks.

DOI
10.1109/iccworkshops53468.2022.9814554

Related papers

Secure Transmit Antenna Selection Protocol for MIMO NOMA Networks over Nakagami-m Channels

Duc‐Dung Tran, Ha-Vu Tran, Dac‐Binh Ha +1 more

In this paper, we studied a multi-input multi-output (MIMO) non-orthogonal multiple access (NOMA) network consisting of one source and two legitimate users (LUs), so-called near and far users according to their distances to the source, and one passive eavesdropper, over Nakagami-\textit{m} fading channel. Specifically, we investigated the scenario that the signals of the far user might or might not be decoded successfully at the eavesdropper and the near user. Thus, we aimed at designing a transmit antenna selection (TAS) secure communication protocol for the network. Then, two TAS solutions, namely Solutions I and II, were proposed. Specifically, solutions I and II focus on maximizing the received signal power between the source and the near user, and between the source and the far user, respectively. Accordingly, the exact and asymptotic closed-form expressions of the secrecy outage probability for the LUs and the overall system were derived. Our analytical results corroborated by Monte Carlo simulation indicate that the secrecy performance could be significantly improved by properly selecting power allocation coefficients and increasing the number of antennas at the source and the LUs. Interestingly, solution II could provide a better overall secrecy performance over solution I.

arXiv:1809.01306•Sep 5, 2018•4 citations

Secure Transmission in MIMO-NOMA Networks

Yue Qi, Mojtaba Vaezi

This letter focuses on the physical layer security over two-user multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks. A linear precoding technique is designed to ensure the confidentiality of the message of each user from its counterpart. This technique first splits the base station power between the two users and, based on that, decomposes the secure MIMO-NOMA channel into two MIMO wiretap channels, and designs the transmit covariance matrix for each channel separately. The proposed method substantially enlarges the secrecy rate compared to existing linear precoding methods and strikes a balance between performance and computation cost. Simulation results verify the effectiveness of the proposed method.

arXiv:2008.05923•IEEE Communications Letters•Aug 17, 2020•37 citations

Secure Precoding in MIMO-NOMA: A Deep Learning Approach

Jordan Pauls, Mojtaba Vaezi

A novel signaling design for secure transmission over two-user multiple-input multiple-output non-orthogonal multiple access channel using deep neural networks (DNNs) is proposed. The goal of the DNN is to form the covariance matrix of users’ signals such that the message of each user is transmitted reliably while being confidential from its counterpart. The proposed DNN linearly precodes each user’s signal before superimposing them and achieves near-optimal performance with significantly lower run time. Simulation results show that the proposed models reach about 98% of the secrecy capacity rates. The spectral efficiency of the DNN precoder is much higher than that of existing analytical linear precoders,–e.g., generalized singular value decomposition–and its on-the-fly complexity is several times less than the existing iterative methods.

arXiv:2110.07121•IEEE Wireless Communications Letters•Oct 15, 2021•13 citations

On the Design of Secure Non-Orthogonal Multiple Access Systems

Biao He, An Liu, Nan Yang +1 more

This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system, where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit power subject to the secrecy outage and quality of service constraints, and derive the closed-form solution to this problem. We then explore the problem of maximizing the minimum confidential information rate among users subject to the secrecy outage and transmit power constraints, and provide an iterative algorithm to solve this problem. We find that the secrecy outage constraint in the studied problems does not change the optimal decoding order for NOMA, and one should increase the power allocated to the user whose channel is relatively bad when the secrecy constraint becomes more stringent. Finally, we show the advantage of NOMA over orthogonal multiple access in the studied problems both analytically and numerically.

arXiv:1612.06961•IEEE Journal on Selected Areas in Communications•Jul 17, 2017•208 citations

Secure Transmit Antenna Selection Protocol for MIMO NOMA Networks Over Nakagami-m Channels

Duc‐Dung Tran, Ha-Vu Tran, Dac‐Binh Ha +1 more

In this paper, we consider a multi-input multioutput (MIMO) nonorthogonal multiple access (NOMA) network consisting of one source and two legitimate users (LUs), so-called near and far users according to their distances to the source, and one passive eavesdropper, over Nakagami-m fading channels. Specifically, we investigate the cases where the signals of the far user might or might not be successfully decoded at the eavesdropper and the near user. Thus, we aim to design a transmit antenna selection (TAS) secure communication protocol for the network; where, two TAS solutions, namely Solutions I and II, are proposed. Specifically, Solutions I and II focus on maximizing the received signal power between the source and the near user, and between the source and the far user, respectively. Accordingly, exact and asymptotic closed-form expressions for the secrecy outage probability of the LUs and the overall system are derived. Our analytical results corroborated by the Monte Carlo simulation indicate that the secrecy performance could be significantly improved by properly selecting the power allocation coefficients and increasing the number of antennas at the source and the LUs. Interestingly, solution II is shown to provide a better overall secrecy performance over solution I.

IEEE Systems Journal•Mar 8, 2019•39 citations

Weighted Sum Rate Maximization of MIMO Broadcast and Interference Channels With Confidential Messages

Daeyoung Park

We consider two-user MIMO broadcast and interference channels in which confidential messages intended for each receiver are kept secret from the other receiver. The confidential secrecy rates are nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices analytically. In the MIMO broadcast channels, we prove the weighted secrecy sum rate maximization has zero duality gap and KKT conditions are necessary conditions for the optimal solution. We apply the block successive lower-bound maximization technique to nonconvex weighted secrecy sum rate maximization problems. We also derive numerical algorithms for MIMO interference channels and Gaussian wiretap channels with a cooperative jammer. Every limit point achieved by the proposed algorithms is a local optimal solution that satisfies the KKT conditions. Numerical results show that the proposed algorithms outperform existing suboptimal algorithms in terms of secrecy rates.

IEEE Transactions on Wireless Communications•Oct 30, 2015•29 citations
Secure communication over two related multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks is investigated. Both networks consist of two legitimate (internal) users and an eavesdropper (external user). In one network, in addition to the external eavesdropper, one of the internal users is also seen as an eavesdropper to the other internal user, resulting in layered confidentiality. The secrecy capacity expressions of these networks are composed of nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices. To overcome this challenge, we form a weighted sum-rate maximization problem for each network and apply the block successive maximization method. This method updates the primal variable blocks successively by maximizing local lower-bounds of the original problem, followed by an update for the dual variable in a closed form. The solutions for these problems design covariance matrices corresponding to the transmitted messages such that they are transmitted securely and reliably. Numerical results illustrate the efficacy of the proposed signaling design for both MIMO-NOMA networks.
In this paper, we studied a multi-input multi-output (MIMO) non-orthogonal multiple access (NOMA) network consisting of one source and two legitimate users (LUs), so-called near and far users according to their distances to the source, and one passive eavesdropper, over Nakagami-\textit{m} fading channel. Specifically, we investigated the scenario that the signals of the far user might or might not be decoded successfully at the eavesdropper and the near user. Thus, we aimed at designing a transmit antenna selection (TAS) secure communication protocol for the network. Then, two TAS solutions, namely Solutions I and II, were proposed. Specifically, solutions I and II focus on maximizing the received signal power between the source and the near user, and between the source and the far user, respectively. Accordingly, the exact and asymptotic closed-form expressions of the secrecy outage probability for the LUs and the overall system were derived. Our analytical results corroborated by Monte Carlo simulation indicate that the secrecy performance could be significantly improved by properly selecting power allocation coefficients and increasing the number of antennas at the source and the LUs. Interestingly, solution II could provide a better overall secrecy performance over solution I.
This letter focuses on the physical layer security over two-user multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) networks. A linear precoding technique is designed to ensure the confidentiality of the message of each user from its counterpart. This technique first splits the base station power between the two users and, based on that, decomposes the secure MIMO-NOMA channel into two MIMO wiretap channels, and designs the transmit covariance matrix for each channel separately. The proposed method substantially enlarges the secrecy rate compared to existing linear precoding methods and strikes a balance between performance and computation cost. Simulation results verify the effectiveness of the proposed method.
A novel signaling design for secure transmission over two-user multiple-input multiple-output non-orthogonal multiple access channel using deep neural networks (DNNs) is proposed. The goal of the DNN is to form the covariance matrix of users’ signals such that the message of each user is transmitted reliably while being confidential from its counterpart. The proposed DNN linearly precodes each user’s signal before superimposing them and achieves near-optimal performance with significantly lower run time. Simulation results show that the proposed models reach about 98% of the secrecy capacity rates. The spectral efficiency of the DNN precoder is much higher than that of existing analytical linear precoders,–e.g., generalized singular value decomposition–and its on-the-fly complexity is several times less than the existing iterative methods.
This paper proposes a new design of non-orthogonal multiple access (NOMA) under secrecy considerations. We focus on a NOMA system, where a transmitter sends confidential messages to multiple users in the presence of an external eavesdropper. The optimal designs of decoding order, transmission rates, and power allocated to each user are investigated. Considering the practical passive eavesdropping scenario where the instantaneous channel state of the eavesdropper is unknown, we adopt the secrecy outage probability as the secrecy metric. We first consider the problem of minimizing the transmit power subject to the secrecy outage and quality of service constraints, and derive the closed-form solution to this problem. We then explore the problem of maximizing the minimum confidential information rate among users subject to the secrecy outage and transmit power constraints, and provide an iterative algorithm to solve this problem. We find that the secrecy outage constraint in the studied problems does not change the optimal decoding order for NOMA, and one should increase the power allocated to the user whose channel is relatively bad when the secrecy constraint becomes more stringent. Finally, we show the advantage of NOMA over orthogonal multiple access in the studied problems both analytically and numerically.
In this paper, we consider a multi-input multioutput (MIMO) nonorthogonal multiple access (NOMA) network consisting of one source and two legitimate users (LUs), so-called near and far users according to their distances to the source, and one passive eavesdropper, over Nakagami-m fading channels. Specifically, we investigate the cases where the signals of the far user might or might not be successfully decoded at the eavesdropper and the near user. Thus, we aim to design a transmit antenna selection (TAS) secure communication protocol for the network; where, two TAS solutions, namely Solutions I and II, are proposed. Specifically, Solutions I and II focus on maximizing the received signal power between the source and the near user, and between the source and the far user, respectively. Accordingly, exact and asymptotic closed-form expressions for the secrecy outage probability of the LUs and the overall system are derived. Our analytical results corroborated by the Monte Carlo simulation indicate that the secrecy performance could be significantly improved by properly selecting the power allocation coefficients and increasing the number of antennas at the source and the LUs. Interestingly, solution II is shown to provide a better overall secrecy performance over solution I.
We consider two-user MIMO broadcast and interference channels in which confidential messages intended for each receiver are kept secret from the other receiver. The confidential secrecy rates are nonconvex functions of transmit covariance matrices, which makes it intractable to find optimal transmit covariance matrices analytically. In the MIMO broadcast channels, we prove the weighted secrecy sum rate maximization has zero duality gap and KKT conditions are necessary conditions for the optimal solution. We apply the block successive lower-bound maximization technique to nonconvex weighted secrecy sum rate maximization problems. We also derive numerical algorithms for MIMO interference channels and Gaussian wiretap channels with a cooperative jammer. Every limit point achieved by the proposed algorithms is a local optimal solution that satisfies the KKT conditions. Numerical results show that the proposed algorithms outperform existing suboptimal algorithms in terms of secrecy rates.