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

International Journal of Communication Systems

Secrecy sum rate optimization in MISO nonorthogonal multiple access systems with orthogonal space‐time block coding

Jianfei Yan, Quanzhong Li, Qi Zhang, Liang Yang, Jiayin Qin

Published Nov 4, 2019• 2 citations
Publisher

Abstract

Summary In this paper, we investigate the secrecy sum rate optimization problem for a multiple‐input single‐output (MISO) nonorthogonal multiple access (NOMA) system with orthogonal space‐time block codes (OSTBC). This system consists of a transmitter, two users, and a potential eavesdropper. The transmitter sends information by orthogonal space‐time block codes. The transmitter's precoder and the power allocation scheme are designed to maximize achievable secrecy sum rate subject to the power constraint at the transmitter and the minimum transmission rate requirement of the weak user. We consider two cases of the eavesdropper's channel condition to obtain positive secrecy sum rate. The first case is the eavesdropper's equivalent channel is the weakest, and the other is the eavesdropper's equivalent channel between the strong user and weak user. For the former case, we employ the constrained concave convex procedure (CCCP)‐based iterative algorithm with one‐dimensional search. While for the latter, we adopt the method of alternating optimization (AO) between precoder and power allocation. We solve a semidefinite programming to optimize the precoder and drive a closed‐form expression of power allocation. The simulation results obtained by our method demonstrate the superiority of our proposed scheme.

DOI
10.1002/dac.4132

Related papers

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•205 citations

Joint Precoding Optimization for Secure Transmission in Downlink MISO-NOMA Networks

Dongdong Li, Nan Zhao, Yunfei Chen +3 more

Non-orthogonal multiple access (NOMA) is a prospective technology for radio resource constrained future mobile networks. However, NOMA users far from base station (BS) tend to be more susceptible to eavesdropping because they are allocated more transmit power. In this paper, we aim to jointly optimize the precoding vectors at BS to ensure the legitimate security in a downlink multiple-input single-output (MISO) NOMA network. In the proposed scheme, we can maximize the sum secrecy rate by joint precoding optimization. Owing to its non-convexity, the problem is converted into a convex one, which is solved by a second-order cone programming based iterative algorithm. Simulation results are presented to demonstrate that the proposed schemes can improve the security performance for MISO NOMA systems effectively.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2019•2 citations

Secure Transmission via Joint Precoding Optimization for Downlink MISO NOMA

Nan Zhao, Dongdong Li, Mingqian Liu +4 more

Non-orthogonal multiple access (NOMA) is a prospective technology for radio resource constrained future mobile networks. However, NOMA users far from a base station (BS) tend to be more susceptible to eavesdropping because they are allocated more transmit power. In this paper, we aim to jointly optimize the precoding vectors at the BS to ensure the legitimate security in a downlink multiple-input single-output (MISO) NOMA network. When the eavesdropping channel state information (CSI) is available at the BS, we can maximize the sum secrecy rate by joint precoding optimization. Owing to its non-convexity, the problem is converted into a convex one, which is solved by a second-order-cone-programming-based iterative algorithm. When the CSI of the eavesdropping channel is not available, we first consider the case that the secure user is not the farthest from the BS, and the transmit power of the farther users is maximized via joint precoding optimization to guarantee its security. Then, we consider the case when the farthest user from the BS requires secure transmission, and the modified successive interference cancellation order and joint precoding optimization can be adopted to ensure its security. A similar method can be exploited to solve the two non-convex problems when the CSI is unknown. Simulation results demonstrate that the proposed schemes can improve the security performance for MISO NOMA systems effectively, with and without eavesdropping CSI.

IEEE Transactions on Vehicular Technology•May 31, 2019•65 citations

Transmit Beamforming Designs for Secure Transmission in MISO-NOMA Networks

Yanbo Zhang, Zheng Yang, Jingjing Cui +4 more

In this paper, we consider a downlink multiple-input single-output non-orthogonal multiple access (MISO-NOMA) network with several legitimate users and a eavesdropper using successive interference cancellation (SIC). The purpose of this paper is to maximize the secrecy performance of the MISO-NOMA network by designing the transmit power between the legitimate users and the artificial jamming. Explicitly, the secrecy sum rate of the MISO-NOMA network is to be maximized by optimizing the transmit beamforming vectors and the artificial jamming vector, subject to the required quality of service of each legitimate user, the artificial jamming beamforming design constraint and the SIC decoding condition. Due to the non-convexity of the optimization problem, we reformulate the original problem into an equivalent optimization problem and then provide a successive convex approximation based iterative algorithm for solving it. Simulation results demonstrate that the proposed optimization scheme outperforms the existing schemes.

IEEE Vehicular Technology Conference•Jun 1, 2022•1 citation

Robust Transmit Designs for Secrecy Rate Constrained MISO NOMA System

Binbin Su, Qiang Ni, Bingtao He

This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2018•7 citations

Secure Beamforming Design in Wiretap MISO Interference Channels

Jian Zhou, Ruohan Cao, Hui Gao +2 more

In this paper, we study the secrecy communication in two-user MISO interference networks where an external eavesdropper is interested in the messages transmitted by both transmitters. We propose a beamforming design to maximize the achievable secrecy sum rate of the transmitters subject to the individual power constraint at each transmitter. To transform this complex non-convex problem into a convex one, we propose an iterative algorithm based on the constrained concave convex procedure (CCCP) and successive convex approximation (SCA). It is observed that the proposed algorithm converges fast to a stationary point within a few iterations. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors have closed-form solutions. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy sum rate performance.

IEEE Vehicular Technology Conference•May 1, 2015•7 citations
Summary In this paper, we investigate the secrecy sum rate optimization problem for a multiple‐input single‐output (MISO) nonorthogonal multiple access (NOMA) system with orthogonal space‐time block codes (OSTBC). This system consists of a transmitter, two users, and a potential eavesdropper. The transmitter sends information by orthogonal space‐time block codes. The transmitter's precoder and the power allocation scheme are designed to maximize achievable secrecy sum rate subject to the power constraint at the transmitter and the minimum transmission rate requirement of the weak user. We consider two cases of the eavesdropper's channel condition to obtain positive secrecy sum rate. The first case is the eavesdropper's equivalent channel is the weakest, and the other is the eavesdropper's equivalent channel between the strong user and weak user. For the former case, we employ the constrained concave convex procedure (CCCP)‐based iterative algorithm with one‐dimensional search. While for the latter, we adopt the method of alternating optimization (AO) between precoder and power allocation. We solve a semidefinite programming to optimize the precoder and drive a closed‐form expression of power allocation. The simulation results obtained by our method demonstrate the superiority of our proposed scheme.
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.
Non-orthogonal multiple access (NOMA) is a prospective technology for radio resource constrained future mobile networks. However, NOMA users far from base station (BS) tend to be more susceptible to eavesdropping because they are allocated more transmit power. In this paper, we aim to jointly optimize the precoding vectors at BS to ensure the legitimate security in a downlink multiple-input single-output (MISO) NOMA network. In the proposed scheme, we can maximize the sum secrecy rate by joint precoding optimization. Owing to its non-convexity, the problem is converted into a convex one, which is solved by a second-order cone programming based iterative algorithm. Simulation results are presented to demonstrate that the proposed schemes can improve the security performance for MISO NOMA systems effectively.
Non-orthogonal multiple access (NOMA) is a prospective technology for radio resource constrained future mobile networks. However, NOMA users far from a base station (BS) tend to be more susceptible to eavesdropping because they are allocated more transmit power. In this paper, we aim to jointly optimize the precoding vectors at the BS to ensure the legitimate security in a downlink multiple-input single-output (MISO) NOMA network. When the eavesdropping channel state information (CSI) is available at the BS, we can maximize the sum secrecy rate by joint precoding optimization. Owing to its non-convexity, the problem is converted into a convex one, which is solved by a second-order-cone-programming-based iterative algorithm. When the CSI of the eavesdropping channel is not available, we first consider the case that the secure user is not the farthest from the BS, and the transmit power of the farther users is maximized via joint precoding optimization to guarantee its security. Then, we consider the case when the farthest user from the BS requires secure transmission, and the modified successive interference cancellation order and joint precoding optimization can be adopted to ensure its security. A similar method can be exploited to solve the two non-convex problems when the CSI is unknown. Simulation results demonstrate that the proposed schemes can improve the security performance for MISO NOMA systems effectively, with and without eavesdropping CSI.
In this paper, we consider a downlink multiple-input single-output non-orthogonal multiple access (MISO-NOMA) network with several legitimate users and a eavesdropper using successive interference cancellation (SIC). The purpose of this paper is to maximize the secrecy performance of the MISO-NOMA network by designing the transmit power between the legitimate users and the artificial jamming. Explicitly, the secrecy sum rate of the MISO-NOMA network is to be maximized by optimizing the transmit beamforming vectors and the artificial jamming vector, subject to the required quality of service of each legitimate user, the artificial jamming beamforming design constraint and the SIC decoding condition. Due to the non-convexity of the optimization problem, we reformulate the original problem into an equivalent optimization problem and then provide a successive convex approximation based iterative algorithm for solving it. Simulation results demonstrate that the proposed optimization scheme outperforms the existing schemes.
This paper studies the secure transmission for downlink multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) system in which imperfect channel state information (CSI) of the eavesdropper links is considered. We propose the novel robust beamforming strategies for the direct transmission NOMA (DT NOMA) and cooperative jamming NOMA (CJ NOMA) with a helper. We formulate our problem as the worst-case sum power minimization subject to secrecy rate constraint. The semidefinite relaxation (SDR) method is firstly applied to relax the quadratic terms and rank-one optimality is proved. Then an iterative algorithm based on successive convex approximation (SCA) is proposed to transform the nonconvex problem into convex approximations. Simulation results show that both the proposed NOMA schemes outperform the orthogonal multiple scheme, and CJ NOMA scheme can achieve much better system performance gain than DT NOMA scheme.
In this paper, we study the secrecy communication in two-user MISO interference networks where an external eavesdropper is interested in the messages transmitted by both transmitters. We propose a beamforming design to maximize the achievable secrecy sum rate of the transmitters subject to the individual power constraint at each transmitter. To transform this complex non-convex problem into a convex one, we propose an iterative algorithm based on the constrained concave convex procedure (CCCP) and successive convex approximation (SCA). It is observed that the proposed algorithm converges fast to a stationary point within a few iterations. Furthermore, we also propose a low-complexity null-space beamforming design scheme in which the beamforming vectors have closed-form solutions. Simulation results show the effectiveness of the two proposed schemes in improving the secrecy sum rate performance.