Secrecy Enhancement of relay cooperative NOMA network based on user behavior

被引:2
作者
Song, Xin [1 ,2 ,3 ]
Zhang, Runfeng [1 ,2 ]
Xu, Siyang [1 ,2 ,3 ]
Hao, Haiqi [1 ,2 ]
Ma, Jingyi [1 ,2 ]
机构
[1] Northeastern Univ Qinhuangdao, Sch Comp & Commun Engn, Qinhuangdao 066004, Peoples R China
[2] Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Peoples R China
[3] Northeastern Univ Qinhuangdao, Hebei Key Lab Marine Percept Network & Data Proc, Qinhuangdao 066004, Hebei, Peoples R China
关键词
Cooperative communication; Physical layer security; Reputation update; Ergodic secrecy rate; POWER ALLOCATION; UNTRUSTED RELAY; SYSTEMS; PERFORMANCE; SELECTION;
D O I
10.1016/j.comcom.2024.03.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
From the perspective of information security, relays exhibit varying levels of trustworthiness when forwarding information. For screening and eliminating the malicious users of cooperative NOMA relay networks, a reputation -based algorithm is proposed, in which the user relays (URs) are categorized into three types based on their behaviors - malicious users, speculative users, and honest users. Meanwhile, in order to minimize information leakage at the relay, cooperative interference signals are transmitted by far user (FU) and near user (NU) via the uplink while the base station (BS) is also transmitting signals to the relay. This approach increases interuser interference (IUI) to confuse the eavesdropping capability of the relay. To verify the superiority of the proposed scheme, an asymptotic lower bound expression for the ergodic secrecy rate (ESR) of the downlink is derived to characterize the secrecy performance of the proposed scheme. Furthermore, in the case of limited system power, a joint power allocation algorithm based on the golden section method is also proposed to further enhance the security performances of the system. The simulation results validate the accuracy of the derived analysis results and demonstrate that the proposed scheme has a significant improvement in the ESR compared with the traditional scheme.
引用
收藏
页码:23 / 34
页数:12
相关论文
共 31 条
  • [1] NOMA Inspired Cooperative Relaying System Using an AF Relay
    Abbasi, Omid
    Ebrahimi, Afshin
    Mokari, Nader
    [J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2019, 8 (01) : 261 - 264
  • [2] The Performance of Supervised Machine Learning Based Relay Selection in Cooperative NOMA
    Alkhawatrah, Mohammad
    [J]. IEEE ACCESS, 2023, 11 : 1570 - 1577
  • [3] Secrecy Enhancement of Cooperative NOMA Networks With Two-Way Untrusted Relaying
    Awad, Mona
    Ibraheem, Shady M.
    Napoleon, Sameh A.
    Saad, Waleed
    Shokair, Mona
    Nasr, Mohamed E.
    [J]. IEEE ACCESS, 2020, 8 (08): : 216349 - 216364
  • [4] Relay Selection for Cooperative NOMA
    Ding, Zhiguo
    Dai, Huaiyu
    Poor, H. Vincent
    [J]. IEEE WIRELESS COMMUNICATIONS LETTERS, 2016, 5 (04) : 416 - 419
  • [5] Joint User Scheduling and Power Allocation Optimization for Energy-Efficient NOMA Systems With Imperfect CSI
    Fang, Fang
    Zhang, Haijun
    Cheng, Julian
    Roy, Sebastien
    Leung, Victor C. M.
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2017, 35 (12) : 2874 - 2885
  • [6] On the secrecy capacity of fading channels
    Gopala, Praveen Kumar
    Lai, Lifeng
    El Gamal, Hesham
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) : 4687 - 4698
  • [7] Gradshtein I.S., 2007, Table of Integrals, Series, and Products, V7
  • [8] Breaking the Economic Barrier of Caching in Cellular Networks: Incentives and Contracts
    Hamidouche, Kenza
    Saad, Walid
    Debbah, Merouane
    [J]. 2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [9] Secure Communication Via an Untrusted Non-Regenerative Relay in Fading Channels
    Huang, Jing
    Mukherjee, Amitav
    Swindlehurst, A. Lee
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (10) : 2536 - 2550
  • [10] Performance Analysis for Cooperative NOMA With Opportunistic Relay Selection
    Ju, Jinjuan
    Duan, Wei
    Sun, Qiang
    Gao, Shangce
    Zhang, Guoan
    [J]. IEEE ACCESS, 2019, 7 : 131488 - 131500