Stackelberg Game for Secure CR-NOMA Networks Against Internal Eavesdropper

Abidrabbu S., Abushattal A., ARSLAN H.

IEEE Transactions on Cognitive Communications and Networking, vol.9, no.2, pp.452-462, 2023 (Scopus) identifier

  • Publication Type: Article / Article
  • Volume: 9 Issue: 2
  • Publication Date: 2023
  • Doi Number: 10.1109/tccn.2023.3234274
  • Journal Name: IEEE Transactions on Cognitive Communications and Networking
  • Journal Indexes: Scopus
  • Page Numbers: pp.452-462
  • Keywords: Non-orthogonal multiple access, physical layer security, power allocation, Stackelberg game, successive interference cancellation
  • Istanbul Medipol University Affiliated: Yes


The combination of CR-NOMA has enormous potential interest to improve spectral efficiency and increase system capacity in future wireless communication networks. Hence, according to the broadcast nature of the CR-NOMA wireless channel, handling the confidentiality of information is one of the most important requirements of the network. In this paper, PLS against internal Eve is investigated by the CR-NOMA under the limitations of joint delay and confidentiality rate. First, initial power allocation for SU based on the PU interference threshold is constructed. Then, a multi-objective problem based on different SUs demands is formulated based on Stackelberg game modeling. After that, the SE is studied and explored. At the final stage, an overall algorithm has been proposed whereby SE strategies are frequently updated to find the best parameters for the proposed system model. The simulation results show the superiority of the proposed scheme in achieving a higher average utility function, spectral efficiency, fairness index, up to 44%, 90%, and 54.7%, respectively, and reliability compared to the conventional scheme.