Secure Communications in NOMA System: Subcarrier Assignment and Power Allocation

Haijun Zhang, Ning Yang, Keping Long, Miao Pan, George K. Karagiannidis, Victor C. M. Leung

Abstract

Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple access (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.

Introduction

As wireless networks evolve toward 5G and 6G, Non-Orthogonal Multiple Access (NOMA) has emerged as a key technology to boost spectral efficiency by allowing multiple users to share the same frequency resource. However, NOMA's open nature makes it inherently vulnerable to eavesdropping. In a two-way relay scenario, managing interference while maintaining security is a complex task. Traditional physical-layer security methods often prioritize the secrecy rate at the expense of high power consumption. This research shifts the focus toward maximizing Secrecy Energy Efficiency (SEE)—the ratio of secure data bits to the energy consumed—to ensure both secure and "green" communications.

System Model and Methodology

The investigated system involves a two-way relay station (RS) assisting multiple user pairs in data exchange while an eavesdropper (Eve) attempts to intercept the signals. To counter this, the system employs Cooperative Jamming (CJ) by transmitting Artificial Noise (AN) from the relay to confuse the eavesdropper without degrading legitimate communication.

Figure 1: System model of the NOMA two-way relay network with cooperative jamming and an eavesdropper.

The joint optimization problem is NP-hard, leading the authors to propose a two-stage approach:

  1. Subcarrier Assignment (SCAS): Utilizing matching theory, subcarriers and user pairs are treated as players in a many-to-many matching game. Two schemes are proposed: SCAS-1 (low complexity) and SCAS-2 (SEE-focused).
  2. Secure Power Allocation (SSPA): The non-convex power allocation problem is transformed into a convex Geometric Programming (GP) problem, solvable via efficient interior point methods to find the global optimum for power distribution.

Performance Evaluation

Numerical simulations using a Hata urban propagation model and Rayleigh fading were conducted to validate the proposed algorithms. Key parameters included 10 subcarriers over a 4.5 MHz bandwidth and a peak relay power of 46 dBm.

Figure 3: Secrecy energy efficiency vs. the number of match operations for the SCAS-2 algorithm with varying user counts.

As shown in Figure 3, the proposed SCAS-2 algorithm demonstrates rapid convergence, with SEE reaching a stable plateau within approximately 40 match operations regardless of the number of users ($U=30, 40, 60$). This efficiency makes the matching-based approach viable for real-time base station implementation. Furthermore, the SSPA-2 algorithm consistently outperformed baseline methods like Orthogonal Frequency Division Multiple Access (OFDMA) and Random Allocation NOMA (RA-NOMA) in terms of bits per Joule.

Conclusion and Future Work

The proposed framework effectively enhances the security and energy efficiency of NOMA relay networks. By leveraging matching games and geometric programming, the system achieves superior performance compared to traditional orthogonal access methods. Future research will address the limitations of the current model, such as the assumption of perfect channel state information (CSI) for passive eavesdroppers and the extension to high-mobility scenarios and multi-relay networks.

Summary updated

Abstract

Secure communication is a promising technology for wireless networks because it ensures secure transmission of information. In this paper, we investigate the joint subcarrier (SC) assignment and power allocation problem for non-orthogonal multiple access (NOMA) amplify-and-forward two-way relay wireless networks, in the presence of eavesdroppers. By exploiting cooperative jamming (CJ) to enhance the security of the communication link, we aim to maximize the achievable secrecy energy efficiency by jointly designing the SC assignment, user pair scheduling and power allocation. Assuming the perfect knowledge of the channel state information (CSI) at the relay station, we propose a low-complexity subcarrier assignment scheme (SCAS-1), which is equivalent to many-to-many matching games, and then SCAS-2 is formulated as a secrecy energy efficiency maximization problem. The secure power allocation problem is modeled as a convex geometric programming problem, and then solved by interior point methods. Simulation results demonstrate that the effectiveness of the proposed SSPA algorithms under scenarios of using and not using CJ, respectively.
BibTeX
@article{zhang2018secure,
  author = {Haijun Zhang and Ning Yang and Keping Long and Miao Pan and George K. Karagiannidis and Victor C. M. Leung},
  title = {{Secure Communications in NOMA System: Subcarrier Assignment and Power Allocation}},
  journal = {IEEE J. Sel. Areas Commun.},
  year = {2018},
  url = {https://openreview.net/forum?id=Z2UHxMtLse},
}
Figure