Energy‐efficient resource allocation in relay‐aided orthogonal frequency division multiplexing cognitive radio networks with quality of service provisioning

• Published in: International journal of communication systems Vol. 33; no. 16
• Main Authors: Yan, Feiyu, Zhao, Jihong, Qu, Hua, Xu, Xiguang
• Format: Journal Article
• Language: English
• Published: Chichester Wiley Subscription Services, Inc 10.11.2020
• Subjects: Cognitive radio; Computer simulation; DF relays; energy efficiency; Mathematical programming; OFDM; Optimization; Orthogonal Frequency Division Multiplexing; Provisioning; QoS provisioning; Quality of service; Quality of service architectures; Relay; Resource allocation; Subcarriers
• ISSN: 1074-5351; 1099-1131
• DOI: 10.1002/dac.4566

Summary This paper investigates the energy‐efficient resource allocation problem in orthogonal frequency division multiplexing (OFDM)‐based cognitive radio (CR) networks with multiple decode‐and‐forward relays. In order to maximize the system energy efficiency (EE), we jointly optimize the relay selection, subcarrier pairing, and power allocation subject to the transmit power constraints, the interference thresholds at the primary system, and the quality of service (QoS) provisioning for the CR system. Using the fractional programming and the Lagrangian dual decomposition method, the optimization problem which is a mixed‐integer nonlinear program (MINLP) can be efficiently solved to obtain an asymptotically optimal solution. We also propose a suboptimal scheme to reduce the computational complexity at the expense of a little performance loss. Simulation results demonstrate the performance of proposed schemes and the effect of the constraints values. In this paper, we jointly optimize the relay selection, subcarrier pairing and power allocation to maximize the energy efficiency in decoded‐and‐forward relay‐aided OFDM‐base cognitive radio networks with QoS provisioning. Using the fractional programming and the Lagrangian dual decomposition method, the optimization problem which is a mixed‐integer nonlinear program can be efficiently solved to obtain an asymptotically optimal solution. We also propose a suboptimal scheme to reduce the computational complexity at the expense of a little performance loss.