Dynamic Channel and Power Allocation in Cognitive Radio Networks Supporting Heterogeneous Services

Resource allocation problem in cognitive radio networks (CRN) is one of the key issues to improve the efficiency of spectrum utilization. Most of previous work on resource allocation mainly concentrates on the secondary users (SUs) with only one type of service requirement, without considering the scenario with heterogenous services requirement. In this paper, we study the dynamic channel and power allocation for SUs supporting heterogenous services in CRN. Firstly we classify the SUs by service requirement, i.e., SUs with minimum rate guarantee and SUs with best-effort services. Then we introduce the minimum rate constraints and proportional fairness constraints for SUs respectively. Under this setup, we formulate the problem of dynamic channel and power allocation for SUs as a mixed integer programming problem. And the heuristic optimal algorithm and suboptimal algorithm are proposed to realize the dynamic channel and power allocation. Extensive simulation results are presented to demonstrate the performance of the proposed scheme.