Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks

Aohan Li, Guangjie Han, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538647271
DOIs
Publication statusPublished - 2019 Feb 20
Event2018 IEEE Global Communications Conference, GLOBECOM 2018 - Abu Dhabi, United Arab Emirates
Duration: 2018 Dec 92018 Dec 13

Publication series

Name2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings

Conference

Conference2018 IEEE Global Communications Conference, GLOBECOM 2018
CountryUnited Arab Emirates
CityAbu Dhabi
Period18/12/918/12/13

Fingerprint

rendezvous
Rendezvous
Cognitive Radio Networks
Cognitive radio
Radio receivers
Upper bound
Data communication systems
Telecommunication links
data transmission
Data Transmission
slots
Theoretical Analysis
Simulation
simulation
methylidyne

ASJC Scopus subject areas

  • Information Systems and Management
  • Renewable Energy, Sustainability and the Environment
  • Safety, Risk, Reliability and Quality
  • Signal Processing
  • Modelling and Simulation
  • Instrumentation
  • Computer Networks and Communications

Cite this

Li, A., Han, G., & Ohtsuki, T. (2019). Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings [8647527] (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.2018.8647527

Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks. / Li, Aohan; Han, Guangjie; Ohtsuki, Tomoaki.

2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8647527 (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, A, Han, G & Ohtsuki, T 2019, Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks. in 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings., 8647527, 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings, Institute of Electrical and Electronics Engineers Inc., 2018 IEEE Global Communications Conference, GLOBECOM 2018, Abu Dhabi, United Arab Emirates, 18/12/9. https://doi.org/10.1109/GLOCOM.2018.8647527
Li A, Han G, Ohtsuki T. Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks. In 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. 8647527. (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings). https://doi.org/10.1109/GLOCOM.2018.8647527
Li, Aohan ; Han, Guangjie ; Ohtsuki, Tomoaki. / Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks. 2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. (2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings).
@inproceedings{2137b95709ec474db121f2bcbd4edf5d,
title = "Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks",
abstract = "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.",
author = "Aohan Li and Guangjie Han and Tomoaki Ohtsuki",
year = "2019",
month = "2",
day = "20",
doi = "10.1109/GLOCOM.2018.8647527",
language = "English",
series = "2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2018 IEEE Global Communications Conference, GLOBECOM 2018 - Proceedings",

}

TY - GEN

T1 - Enhanced Channel Hopping Algorithm for Heterogeneous Cognitive Radio Networks

AU - Li, Aohan

AU - Han, Guangjie

AU - Ohtsuki, Tomoaki

PY - 2019/2/20

Y1 - 2019/2/20

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

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.

ER -