TY - JOUR
T1 - Secure Transmission Design in HARQ Assisted Cognitive NOMA Networks
AU - Xiang, Zhongwu
AU - Yang, Weiwei
AU - Cai, Yueming
AU - Ding, Zhiguo
AU - Song, Yi
N1 - Funding Information:
Manuscript received September 3, 2019; revised November 28, 2019, December 29, 2019, and January 15, 2020; accepted January 15, 2020. Date of publication January 20, 2020; date of current version February 6, 2020. This work was supported by the National Natural Science Foundation of China under Grant 61771487 and Grant 61471393. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. Georges Kaddoum. (Corresponding author: Weiwei Yang.) Zhongwu Xiang, Weiwei Yang, and Yueming Cai are with the College of Communications Engineering, Army Engineering University of PLA, Nanjing 210007, China (e-mail: [email protected]; [email protected]; [email protected]).
Publisher Copyright:
© 2005-2012 IEEE.
PY - 2020
Y1 - 2020
N2 - In this paper, we design a secure transmission scheme in hybrid automatic repeat request (HARQ) assisted cognitive non-orthogonal multiple access (NOMA) networks, where a security-required user (SRU) is paired with a quality of service (QoS)-sensitive user (QSU) to perform NOMA. To elaborate, the QoS requirement of the QSU is guaranteed by a cognitive power allocation scheme, while the HARQ technique is employed to mitigate the successive interference cancellation (SIC) errors and improve the secrecy performance of the SRU. For reducing information leakage, a randomized retransmission NOMA (RR-NOMA) scheme is designed, where the retransmitted signals are generated from independent randomized codebooks. In this scheme, the closed-form expressions for the connection outage probability (COP), the average number of transmission (ANT), the secrecy outage probability (SOP), and effective secrecy throughput (EST) of the SRU are derived. In addition, as benchmarks, the performance analyses for the fixed retransmission (FR-NOMA) scheme and the randomized retransmission orthogonal multiple access (RR-OMA) scheme are also provided. Results show a trade-off between SOP and COP or EST, which is denoted by security-reliability trade-off (SRT) or security-efficiency trade-off (SET). Furthermore, simulation results show that the HARQ technique improves SRT and the RR-NOMA scheme achieves better SET than the FR-NOMA scheme in the low SOP region. We further conduct asymptotic analysis in the RR-NOMA, FR-NOMA and RR-OMA schemes. Asymptotic results demonstrate that the three schemes achieve the same ANT and the RR-NOMA scheme obtains better secrecy performance than the RR-OMA scheme and equal secrecy performance to the FR-NOMA scheme in terms of both EST and SOP.
AB - In this paper, we design a secure transmission scheme in hybrid automatic repeat request (HARQ) assisted cognitive non-orthogonal multiple access (NOMA) networks, where a security-required user (SRU) is paired with a quality of service (QoS)-sensitive user (QSU) to perform NOMA. To elaborate, the QoS requirement of the QSU is guaranteed by a cognitive power allocation scheme, while the HARQ technique is employed to mitigate the successive interference cancellation (SIC) errors and improve the secrecy performance of the SRU. For reducing information leakage, a randomized retransmission NOMA (RR-NOMA) scheme is designed, where the retransmitted signals are generated from independent randomized codebooks. In this scheme, the closed-form expressions for the connection outage probability (COP), the average number of transmission (ANT), the secrecy outage probability (SOP), and effective secrecy throughput (EST) of the SRU are derived. In addition, as benchmarks, the performance analyses for the fixed retransmission (FR-NOMA) scheme and the randomized retransmission orthogonal multiple access (RR-OMA) scheme are also provided. Results show a trade-off between SOP and COP or EST, which is denoted by security-reliability trade-off (SRT) or security-efficiency trade-off (SET). Furthermore, simulation results show that the HARQ technique improves SRT and the RR-NOMA scheme achieves better SET than the FR-NOMA scheme in the low SOP region. We further conduct asymptotic analysis in the RR-NOMA, FR-NOMA and RR-OMA schemes. Asymptotic results demonstrate that the three schemes achieve the same ANT and the RR-NOMA scheme obtains better secrecy performance than the RR-OMA scheme and equal secrecy performance to the FR-NOMA scheme in terms of both EST and SOP.
KW - HARQ assisted cognitive NOMA networks
KW - physical layer security
KW - security-efficiency trade-off
KW - security-reliability trade-off
UR - https://www.scopus.com/pages/publications/85078169357
U2 - 10.1109/TIFS.2020.2968176
DO - 10.1109/TIFS.2020.2968176
M3 - Article
AN - SCOPUS:85078169357
SN - 1556-6013
VL - 15
SP - 2528
EP - 2541
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
M1 - 8963920
ER -