Maximum achievable arrival rate of secondary users under GoS constraints in cognitive radio networks

In this paper, we model the cognitive radio network with channel reservation for primary users using two-dimensional continuous Markov process. Based on this model, we propose an algorithm to maximize the achievable arrival rate of secondary users (SUs) under specific grade of service (GoS) constraints. Moreover, to reduce the computational complexity of the algorithm, the closed-form expressions of the steady-state probabilities are derived using an approximate approach. Moreover the formulas for the blocking probability and the dropping probability of SUs are obtained. Finally, simulations are conducted to verify the accuracy of our approximation and the correctness of the proposed algorithm.