Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks

Aohan Li, Guangjie Han, Tomoaki Ohtsuki

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In cognitive radio networks (CRNs), if two unlicensed secondary users (SUs) want to communicate with each other, they need to rendezvous with each other on the same channel at the same time. Rendezvous is the first key step for SUs to be able to communicate with each other. Channel hopping (CH) is a representative technique to solve the rendezvous problem in CRNs. SUs equipped with multiple radios can significantly reduce the time-to-rendezvous (TTR) for several existing CH algorithms while the additional cost is low. However, several drawbacks exist in the existing CH algorithms based on multiple radios. One of the main drawbacks is that they cannot be well applied in heterogeneous CRNs. The reason is that the number of radios for different SUs is implicitly assumed same or must be more than one in the existing CH algorithms based on multiple radios, which is unrealistic for heterogeneous CRNs. In heterogeneous CRNs, SUs may be equipped with different numbers of radios including one radio. To mainly address the above issue, hybrid radios rendezvous (HRR) algorithm is proposed in this paper. Moreover, the upper bounds of maximum TTR (MTTR) for the HRR algorithm are derived by a theoretical analysis. Furthermore, extensive simulations are performed to evaluate the expected TTR (ETTR), the MTTR, and the channel qualities of the rendezvous channels for the HRR algorithm. Simulation results show that rendezvous can be guaranteed by the HRR algorithm in heterogenous CRNs. Besides, the qualities of the rendezvous channels can be improved by the HRR algorithm. In addition, our algorithms can achieve rendezvous faster than several existing algorithms.

Original languageEnglish
Article number8667405
Pages (from-to)37342-37359
Number of pages18
JournalIEEE Access
Volume7
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Radio receivers
Cognitive radio

Keywords

  • blind rendezvous
  • channel hopping
  • Cognitive radio networks
  • multiple radios

ASJC Scopus subject areas

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)

Cite this

Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks. / Li, Aohan; Han, Guangjie; Ohtsuki, Tomoaki.

In: IEEE Access, Vol. 7, 8667405, 01.01.2019, p. 37342-37359.

Research output: Contribution to journalArticle

@article{173ec06be1cc4983a5a75bd765275e19,
title = "Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks",
abstract = "In cognitive radio networks (CRNs), if two unlicensed secondary users (SUs) want to communicate with each other, they need to rendezvous with each other on the same channel at the same time. Rendezvous is the first key step for SUs to be able to communicate with each other. Channel hopping (CH) is a representative technique to solve the rendezvous problem in CRNs. SUs equipped with multiple radios can significantly reduce the time-to-rendezvous (TTR) for several existing CH algorithms while the additional cost is low. However, several drawbacks exist in the existing CH algorithms based on multiple radios. One of the main drawbacks is that they cannot be well applied in heterogeneous CRNs. The reason is that the number of radios for different SUs is implicitly assumed same or must be more than one in the existing CH algorithms based on multiple radios, which is unrealistic for heterogeneous CRNs. In heterogeneous CRNs, SUs may be equipped with different numbers of radios including one radio. To mainly address the above issue, hybrid radios rendezvous (HRR) algorithm is proposed in this paper. Moreover, the upper bounds of maximum TTR (MTTR) for the HRR algorithm are derived by a theoretical analysis. Furthermore, extensive simulations are performed to evaluate the expected TTR (ETTR), the MTTR, and the channel qualities of the rendezvous channels for the HRR algorithm. Simulation results show that rendezvous can be guaranteed by the HRR algorithm in heterogenous CRNs. Besides, the qualities of the rendezvous channels can be improved by the HRR algorithm. In addition, our algorithms can achieve rendezvous faster than several existing algorithms.",
keywords = "blind rendezvous, channel hopping, Cognitive radio networks, multiple radios",
author = "Aohan Li and Guangjie Han and Tomoaki Ohtsuki",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/ACCESS.2019.2904942",
language = "English",
volume = "7",
pages = "37342--37359",
journal = "IEEE Access",
issn = "2169-3536",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Multiple Radios for Fast Rendezvous in Heterogeneous Cognitive Radio Networks

AU - Li, Aohan

AU - Han, Guangjie

AU - Ohtsuki, Tomoaki

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In cognitive radio networks (CRNs), if two unlicensed secondary users (SUs) want to communicate with each other, they need to rendezvous with each other on the same channel at the same time. Rendezvous is the first key step for SUs to be able to communicate with each other. Channel hopping (CH) is a representative technique to solve the rendezvous problem in CRNs. SUs equipped with multiple radios can significantly reduce the time-to-rendezvous (TTR) for several existing CH algorithms while the additional cost is low. However, several drawbacks exist in the existing CH algorithms based on multiple radios. One of the main drawbacks is that they cannot be well applied in heterogeneous CRNs. The reason is that the number of radios for different SUs is implicitly assumed same or must be more than one in the existing CH algorithms based on multiple radios, which is unrealistic for heterogeneous CRNs. In heterogeneous CRNs, SUs may be equipped with different numbers of radios including one radio. To mainly address the above issue, hybrid radios rendezvous (HRR) algorithm is proposed in this paper. Moreover, the upper bounds of maximum TTR (MTTR) for the HRR algorithm are derived by a theoretical analysis. Furthermore, extensive simulations are performed to evaluate the expected TTR (ETTR), the MTTR, and the channel qualities of the rendezvous channels for the HRR algorithm. Simulation results show that rendezvous can be guaranteed by the HRR algorithm in heterogenous CRNs. Besides, the qualities of the rendezvous channels can be improved by the HRR algorithm. In addition, our algorithms can achieve rendezvous faster than several existing algorithms.

AB - In cognitive radio networks (CRNs), if two unlicensed secondary users (SUs) want to communicate with each other, they need to rendezvous with each other on the same channel at the same time. Rendezvous is the first key step for SUs to be able to communicate with each other. Channel hopping (CH) is a representative technique to solve the rendezvous problem in CRNs. SUs equipped with multiple radios can significantly reduce the time-to-rendezvous (TTR) for several existing CH algorithms while the additional cost is low. However, several drawbacks exist in the existing CH algorithms based on multiple radios. One of the main drawbacks is that they cannot be well applied in heterogeneous CRNs. The reason is that the number of radios for different SUs is implicitly assumed same or must be more than one in the existing CH algorithms based on multiple radios, which is unrealistic for heterogeneous CRNs. In heterogeneous CRNs, SUs may be equipped with different numbers of radios including one radio. To mainly address the above issue, hybrid radios rendezvous (HRR) algorithm is proposed in this paper. Moreover, the upper bounds of maximum TTR (MTTR) for the HRR algorithm are derived by a theoretical analysis. Furthermore, extensive simulations are performed to evaluate the expected TTR (ETTR), the MTTR, and the channel qualities of the rendezvous channels for the HRR algorithm. Simulation results show that rendezvous can be guaranteed by the HRR algorithm in heterogenous CRNs. Besides, the qualities of the rendezvous channels can be improved by the HRR algorithm. In addition, our algorithms can achieve rendezvous faster than several existing algorithms.

KW - blind rendezvous

KW - channel hopping

KW - Cognitive radio networks

KW - multiple radios

UR - http://www.scopus.com/inward/record.url?scp=85065014069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85065014069&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2019.2904942

DO - 10.1109/ACCESS.2019.2904942

M3 - Article

AN - SCOPUS:85065014069

VL - 7

SP - 37342

EP - 37359

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8667405

ER -