Resource allocation in underlay cognitive radio networks with full‐duplex cognitive base station

Abstract

This paper considers an underlay cognitive radio network with a full-duplex cognitive base station and sets of half-duplex downlink and uplink secondary users, sharing multiple channels with the primary user. The resource allocation problem to maximize the sum rate of all the secondary users is investigated subject to the transmit power constraints and the interference power constraint. The optimization problem is highly nonconvex, and we jointly use the dual optimization method and the successive convex approximation method to derive resource allocation algorithms to solve the problem. Extensive simulations are shown to verify the performance of the resource allocation algorithms. It is shown that the proposed algorithms achieve much higher sum rate than that of the optimal half-duplex algorithms and the reference full-duplex algorithms. KEYWORDScognitive radio, full-duplex, resource allocation, successive convex approximation Int J Commun Syst. 2017;30:e3321.wileyonlinelibrary.com/journal/dac