IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
A survey on MAC protocols for cognitive radio networks
Ad Hoc Networks
Maximum channel throughput via cooperative spectrum sensing in cognitive radio networks
IEEE Transactions on Wireless Communications
Opportunistic spectrum scheduling for multiuser cognitive radio: a queueing analysis
IEEE Transactions on Wireless Communications
Power Control and Channel Allocation in Cognitive Radio Networks with Primary Users' Cooperation
IEEE Transactions on Mobile Computing
Delay analysis for cognitive radio networks with random access: a fluid queue view
INFOCOM'10 Proceedings of the 29th conference on Information communications
Effective capacity of delay-constrained cognitive radio in Nakagami fading channels
IEEE Transactions on Wireless Communications
Effective capacity analysis of cognitive radio channels for quality of service provisioning
IEEE Transactions on Wireless Communications
Effective capacity: a wireless link model for support of quality of service
IEEE Transactions on Wireless Communications
Cross-Layer Design and Analysis of Wireless Networks Using the Effective Bandwidth Function
IEEE Transactions on Wireless Communications
Effective bandwidth in high-speed digital networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider a time slotted cognitive radio network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users' channels. We analyze the performance of a channel access policy where each SU stochastically determines whether to access a wireless channel or not based on a given access probability. In the analysis, we focus on the queueing performance of an arbitrary SU with the channel access policy. To improve the queueing performance of SUs, the access probability in our channel access policy is adapted to the knowledge on the wireless channel information, e.g., the number of available channels and the probability of a deep fade for channels. It is then important to obtain the optimal access probabilities from the queueing performance perspective. In this paper we consider three scenarios. In the first scenario, all SUs have full information on wireless channel status and fading channel conditions. In the second scenario, all SUs have full information on wireless channel status but do not know their fading channel conditions, and in the last scenario all SUs do not have any information on wireless channel status and conditions. For each scenario we analyze the queueing performance of an arbitrary SU and show how to obtain the optimal access probabilities with the help of the effective bandwidth theory. From our analysis we provide an insight on how to design an optimal channel access policy in each scenario. We also show how the optimal channel access policies in three scenarios are related with each other. Numerical results are provided to validate our analysis. In addition, we investigate the performance behaviors of the optimal channel access policies.