TY - GEN
T1 - Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks
AU - Li, Aohan
AU - Han, Guangjie
AU - Ohtsuki, Tomoaki
N1 - Funding Information:
ACKNOWLEDGMENTS The work is supported by the National Key Research and Development Program, No.2018YFC0407900 and the National Natural Science Foundation of China under Grant No.61572172 and supported by the Fundamental Research Funds for the Central Universities, No.2016B10714 and supported by Six talent peaks project in Jiangsu Province, No.XYDXXJS-007.
Publisher Copyright:
© 2018 IEEE.
PY - 2018
Y1 - 2018
N2 - In Cognitive Radio Networks (CRNs), the available channels for the unlicensed Secondary Users (SUs) may be varying. When SUs want to communicate with each other, they must first access the same channel simultaneously. The process of accessing the same channel is referred to as a rendezvous process, by which SUs can exchange control information for establishing data transmission link. Channel Hoping (CH) is one of the most representative techniques for letting SUs rendezvous with each other. At the beginning of each time slot, SUs access available channels according to their CH Sequences (CHSs) generated by the CH algorithm. In our previous work, we have proposed a Heterogeneous Radio Rendezvous (HRR) algorithm to address the rendezvous problem for heterogeneous CRNs, where SUs may be equipped with different numbers of radios. In this paper, we propose an Enhanced HRR (EHRR) algorithm, which can further shorten the length of period for the CHSs. Compared with the HRR algorithm, the EHRR algorithm lowers the upper bounds of Maximum Time To Rendezvous (MTTR). Moreover, the upper bounds of MTTR for the EHRR algorithm are derived by theoretical analysis. In addition, the performance of the EHRR algorithm in terms of MTTR is evaluated by simulation. Simulation results show the superiority of the EHRR algorithm compared with the HRR algorithm in terms of MTTR.
AB - In Cognitive Radio Networks (CRNs), the available channels for the unlicensed Secondary Users (SUs) may be varying. When SUs want to communicate with each other, they must first access the same channel simultaneously. The process of accessing the same channel is referred to as a rendezvous process, by which SUs can exchange control information for establishing data transmission link. Channel Hoping (CH) is one of the most representative techniques for letting SUs rendezvous with each other. At the beginning of each time slot, SUs access available channels according to their CH Sequences (CHSs) generated by the CH algorithm. In our previous work, we have proposed a Heterogeneous Radio Rendezvous (HRR) algorithm to address the rendezvous problem for heterogeneous CRNs, where SUs may be equipped with different numbers of radios. In this paper, we propose an Enhanced HRR (EHRR) algorithm, which can further shorten the length of period for the CHSs. Compared with the HRR algorithm, the EHRR algorithm lowers the upper bounds of Maximum Time To Rendezvous (MTTR). Moreover, the upper bounds of MTTR for the EHRR algorithm are derived by theoretical analysis. In addition, the performance of the EHRR algorithm in terms of MTTR is evaluated by simulation. Simulation results show the superiority of the EHRR algorithm compared with the HRR algorithm in terms of MTTR.
UR - http://www.scopus.com/inward/record.url?scp=85063530886&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063530886&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2018.8647527
DO - 10.1109/GLOCOM.2018.8647527
M3 - Conference contribution
AN - SCOPUS:85063530886
T3 - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
BT - 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Global Communications Conference, GLOBECOM 2018
Y2 - 9 December 2018 through 13 December 2018
ER -
