CRAHNs: Cognitive radio ad hoc networks
Ad Hoc Networks
A survey on MAC protocols for cognitive radio networks
Ad Hoc Networks
Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
A survey of common control channel design in cognitive radio networks
Physical Communication
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
Sensing Confidence Level-Based Joint Spectrum and Power Allocation in Cognitive Radio Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Cognitive radio (CR) technology enables the opportunistic use of the portions of the licensed spectrum by the CR users, while ensuring low interference to the primary user (PU) activity in the licensed bands. The spectrum is sensed locally by the CR users, and a specific channel that is acceptable to both the end nodes of the communication link is chosen. However, this necessitates a common control channel (CCC) for exchanging the sensing information and reserving the channel before actual data transfer. In this paper, a common control channel design for CR ad hoc networks is proposed, called as adaptive multiple rendezvous control channel (AMRCC) based on frequency hopping. Our scheme is scalable, and allows continuous connectivity between the CR users under dynamic PU activity. The contribution made in this paper is threefold: (i) a frequency hopping scheme is proposed that allows altering the hopping sequence based on the PU activity in the channels, (ii) a simple and low-overhead procedure is developed to aid new node-join and leave events, and (iii) a slot duration optimization is given that avoids a significant performance degradation with the number of available channels. Performance evaluation proves that our solution achieves better performance than the other classic CCC solutions in terms of time to rendezvous (TTR) and the resulting throughput, specifically in CR ad hoc networks.