Resource Allocation in Cognitive Heterogeneous Networks Considering the Arrival of Primary Users

Recently, cognitive heterogeneous networks (CHNs) have attracted more attention of the researchers' because of the heterogeneity of the cognitive radio networks, and also the high efficiency of spectrum utilization. A resource allocation algorithm in CHNs based on the convex optimization theory is studied in this paper, considering the probability of the primary users'(PUs) arrival. The goal of the algorithm is to minimize the transmitting delay of SUs during the communication via different radio access technologies(RATs). A model of two state birth-death process is used to describe the probability of PUs using the channel in the paper. The numerical results show that the proposed algorithm can improve the delay performance of the system and it outperforms other algorithms in the references.