A survey of common control channel design in cognitive radio networks
Physical Communication
Coordination problem in cognitive wireless mesh networks
Pervasive and Mobile Computing
Neighbor discovery for cognitive radio ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing
On bridging the gap between homogeneous and heterogeneous rendezvous schemes for cognitive radios
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Slow hopping based cooperative sensing MAC protocol for cognitive radio networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.07 |
In decentralized cognitive radio (CR) networks, enabling the radios to establish a control channel (i.e., "rendezvous" to establish a link) is a challenging problem. The use of a dedicated common control channel simplifies the rendezvous process but may not be feasible in many opportunistic spectrum sharing scenarios due to the dynamically changing availability of all the channels, including the control channel. To address this problem, researchers have proposed the use of channel hopping protocols for enabling rendezvous in CR networks. Most, if not all, of the existing channel hopping schemes only provide ad hoc approaches for generating channel hopping sequences and evaluating their properties. In this paper, we present a systematic approach, based on quorum systems, for designing and analyzing channel hopping protocols for the purpose of control channel establishment. The proposed approach, called Quorum-based Channel Hopping (QCH) system, can be used for implementing rendezvous protocols in CR networks that are robust against link breakage caused by the appearance of incumbent user signals. We describe two synchronous QCH systems under the assumption of global clock synchronization, and two asynchronous channel hopping systems that do not require global clock synchronization. Our analytical and simulation results show that the proposed channel hopping schemes outperform existing schemes under various network conditions.