A Fast Rendezvous Channel-Hopping Algorithm for Cognitive Radio Networks
Authors:
- 12 June 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (7) , 1475-1478
Abstract
Cognitive radio networks (CRNs) have emerged as a critical technique to enhance the utilization of licensed channels. In CRNs, each secondary user (SU) should not interfere the co-locate incumbent networks. For this purpose, before data transmission, SUs should rendezvous on an available channel (i.e., idle and licensed channel) for establishing a link or exchanging control information. However, implementation of rendezvous is challenging since SUs are not aware of the presence of each other before rendezvous and available channels sensed by each SU may be different. In this paper, we proposed a fast rendezvous channel hopping algorithm (FRCH), which can guarantee rendezvous within 2N2 + N timeslots under asynchronous environments, where N denotes the number of licensed channels in a CRN.Keywords
This publication has 7 references indexed in Scilit:
- Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks2011
- ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks2011
- Control Channel Establishment in Cognitive Radio Networks using Channel HoppingIEEE Journal on Selected Areas in Communications, 2011
- Deterministic rendezvous scheme in multichannel access networksElectronics Letters, 2010
- A Channel Rendezvous Scheme for Cognitive Radio NetworksIEEE Communications Letters, 2010
- Sequence-Based Rendezvous for Dynamic Spectrum Access2008
- Spectrum Sharing for Multi-Hop Networking with Cognitive RadiosIEEE Journal on Selected Areas in Communications, 2008