This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.
This paper proposes a secure users-oriented multiple-input and single-output non-orthogonal multiple access downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate and sum secrecy rate of all SUs, respectively, subject to the secrecy outage probability constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation, we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate and max-sum secrecy rate problems, respectively. As for the upper bound case, an alternative optimization-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access one is verified by numerical results.
In this paper, we consider max-min fairness for a downlink two-user multi-input single-output (MISO) system with imperfect channel state information available at transmitter (CSIT) taking into account the total power constraint and the physical layer security. Considering the worst-case channel uncertainty for a potential eavesdropper (PE), we study the robust secure beamforming algorithm design which maximizes the minimum achieved worst-case secrecy rate among single-antenna legitimate users. In contrast to existing schemes adopted in the literatures, we propose a rather unorthodox rate splitting (RS) scheme which advocates the dual use of a common message serving both as a desired message and artificial noise (AN) for legitimate users and the PE, respectively. The algorithm design is formulated as a non-convex optimization problem which is generally intractable. As a compromise approach, we apply the successive convex approximation (SCA) method which facilitates the design of a low-complexity suboptimal iterative algorithm. In each iteration, a rank-constrained semi-definite program (SDP) is solved optimally by SDP relaxation (SDR). Simulation results demonstrate that our proposed robust secure beamforming scheme in the MISO-RS secure transmission system outperforms that of the non-robust counterpart. Moreover, our results also unveil that the proposed RS scheme can achieve a superior performance compared to the existing non-orthogonal multiple access (NOMA) schemes and the traditional scheme.
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.
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.
Multiple Input Single Output (MISO) Non-orthogonal multiple access (NOMA), combining the benefits of spatial multiplexing with higher spectral efficiency, has recently attained a substantial research interest in 5G and upcoming mobile communication networks. This paper proposes an optimal power control algorithm for downlink secure MISO-NOMA communication involving untrusted users. Sum secure rate maximization of both single antenna users has been considered, while satisfying their quality of service requirements, numerical method is used for optimal power sharing between users, and optimal beamforming vectors have been derived. Simulations validate the analysis, demonstrate the efficacy of the proposed design, and offer design insights into secure MISO-NOMA communications.
In this paper, the application of Non-Orthogonal Multiple Access (NOMA) is investigated in a multiple-input single-output network consisting of multiple legitimate users and a potential eavesdropper. To support secure transmissions from legitimate users, two NOMA Secrecy Sum Rate Transmit BeamForming (NOMA-SSR-TBF) schemes are proposed to maximise the SSR of a Base Station (BS) with sufficient and insufficient transmit power. For BS with sufficient transmit power, an artificial jamming beamforming design scheme is proposed to disrupt the potential eavesdropping without impacting the legitimate transmissions. In addition, for BS with insufficient transmit power, a modified successive interference cancellation decoding sequence is used to reduce the impact of artificial jamming on legitimate transmissions. More specifically, iterative algorithm for the successive convex approximation are provided to jointly optimise the vectors of transmit beamforming and artificial jamming. Experimental results demonstrate that the proposed NOMA-SSR-TBF schemes outperforms the existing works, such as the maximized artificial jamming power scheme, the maximized artificial jamming power scheme with artificial jamming beamforming design and maximized secrecy sum rate scheme without artificial jamming beamforming design.
In this paper, we study the physical layer security of a downlink multi-input single-output non-orthogonal multiple access (NOMA) system, in which transmit antenna selection (TAS) scheme, users’ quality of service (QoS) requirements, Nakagami-m fading channel, and user selection solution are considered for secure NOMA transmission. Specifically, we investigate the scenario that a base station (BS) (source) communicates with two legitimate user (LU) clusters with different priority depending on their QoS requirements in the presence of multiple passive eavesdroppers over Nakagami-m fading. To enhance the secrecy performance, we examine a TAS scheme and a user selection method. In this context, prior to transmission, a transmit antenna and a user in high-priority LU cluster are jointly selected to maximize the channel quality of the link from the BS to the selected user. Furthermore, together with the selected high-priority user, a user in low-priority LU cluster, which has the best channel condition, is chosen for performing two-user NOMA. In order to evaluate the secrecy performance, tight and asymptotic closed-form expressions of secrecy outage probability for selected LUs and overall system are derived. Our theoretical results confirmed by Monte–Carlo simulation show that in QoS-based NOMA system, high-priority users cause the higher effects on the overall secrecy performance in comparison with low-priority users. Finally, these results also indicate that our proposed communication protocol achieves the secrecy performance greater than conventional protocol.