Utilization and fairness in spectrum assignment for opportunistic spectrum access
Mobile Networks and Applications
Improved Algorithm of Spectrum Allocation Based on Graph Coloring Model in Cognitive Radio
CMC '09 Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03
A Novel Spectrum Allocation Mechanism Based on Graph Coloring and Bidding Theory
CINC '09 Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Efficient MAC in cognitive radio systems: a game-theoretic approach
IEEE Transactions on Wireless Communications
Conjecture-based channel selection game for delay-sensitive users in multi-channel wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
IEEE Transactions on Communications
Advanced graph-coloring spectrum allocation algorithm for cognitive radio
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A measurement-based model for dynamic spectrum access in WLAN channels
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Optimal spectrum sensing framework for cognitive radio networks
IEEE Transactions on Wireless Communications
Full length article: Proactive channel access in dynamic spectrum networks
Physical Communication
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider the problem of distributed channel selection in cognitive radio (CR) ad hoc networks (CRAHNs) in which CRs have the capability of estimating the primary channel traffic activities. We propose a distributed channel selection scheme referred to as best-fit channel selection (BFC). In BFC each CR selects a channel among the primary user (PU) channels for transmission that best fits to its transmission requirement as opposed to the widely known longest idle time channel selection (LITC) scheme, in which a CR selects the channel that has the longest expected idle time independent of its transmission needs. In a multi-user network LITC may degrade the network performance compared to the BFC. In contrast to the BFC, referred to as non-selfish, LITC is considered selfish since each CR aims to maximize its own benefit and wastes resources that may be utilized by other CRs in the network. Through a set of simulations, we highlight the performance improvement by the BFC scheme over the conventional LITC scheme. Simulation results show that the performance of BFC is significantly superior to that of the LTIC in terms of CRAHN throughput and probability of successful transmission of CRs.