Design and Analysis of Optimal Random Access Policies in Cognitive Radio Networks
In this paper, the authors consider a time slotted cognitive radio network where multiple Secondary Users (SUs) contend to access wireless channels. They propose and analyze a channel access policy where each secondary user stochastically determines whether to access a wireless channel (or not) based on a given access probability. In their analysis, they consider two extreme cases - where all Sus possess full information and have no information regarding idle channels. They propose to obtain the access probabilities that minimize the steady-state queue length tail probabilities in the two extreme cases based on Effective Bandwidth theory.