Efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks

Abdulmajid Al-Mqdashi, Aduwati Sali, Nor Kamariah Noordin, Shaiful J. Hashim, Rosdiadee Nordin

Research output: Contribution to journalArticle

Abstract

Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics.

Original languageEnglish
Article number4360
JournalSensors (Switzerland)
Volume18
Issue number12
DOIs
Publication statusPublished - 1 Dec 2018

Fingerprint

rendezvous
Cognitive radio
Radio
Availability
Communication
matrices
Research
set theory
availability

Keywords

  • Blind rendezvous
  • Channel hopping
  • Distributed cognitive radio networks

ASJC Scopus subject areas

  • Analytical Chemistry
  • Atomic and Molecular Physics, and Optics
  • Biochemistry
  • Instrumentation
  • Electrical and Electronic Engineering

Cite this

Efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks. / Al-Mqdashi, Abdulmajid; Sali, Aduwati; Noordin, Nor Kamariah; Hashim, Shaiful J.; Nordin, Rosdiadee.

In: Sensors (Switzerland), Vol. 18, No. 12, 4360, 01.12.2018.

Research output: Contribution to journalArticle

Al-Mqdashi, Abdulmajid ; Sali, Aduwati ; Noordin, Nor Kamariah ; Hashim, Shaiful J. ; Nordin, Rosdiadee. / Efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks. In: Sensors (Switzerland). 2018 ; Vol. 18, No. 12.
@article{5e848684fa8f48c0934f608d930355e6,
title = "Efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks",
abstract = "Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics.",
keywords = "Blind rendezvous, Channel hopping, Distributed cognitive radio networks",
author = "Abdulmajid Al-Mqdashi and Aduwati Sali and Noordin, {Nor Kamariah} and Hashim, {Shaiful J.} and Rosdiadee Nordin",
year = "2018",
month = "12",
day = "1",
doi = "10.3390/s18124360",
language = "English",
volume = "18",
journal = "Sensors (Switzerland)",
issn = "1424-8220",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "12",

}

TY - JOUR

T1 - Efficient matrix-based channel hopping schemes for blind rendezvous in distributed cognitive radio networks

AU - Al-Mqdashi, Abdulmajid

AU - Sali, Aduwati

AU - Noordin, Nor Kamariah

AU - Hashim, Shaiful J.

AU - Nordin, Rosdiadee

PY - 2018/12/1

Y1 - 2018/12/1

N2 - Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics.

AB - Channel rendezvous is an initial and important process for establishing communications between secondary users (SUs) in distributed cognitive radio networks. Due to the drawbacks of the common control channel (CCC) based rendezvous approach, channel hopping (CH) has attracted a lot of research interests for achieving blind rendezvous. To ensure rendezvous within a finite time, most of the existing CH-based rendezvous schemes generate their CH sequences based on the whole global channel set in the network. However, due to the spatial and temporal variations in channel availabilities as well as the limitation of SUs sensing capabilities, the local available channel set (ACS) for each SU is usually a small subset of the global set. Therefore, following these global-based generated CH sequences can result in extensively long time-to-rendezvous (TTR) especially when the number of unavailable channels is large. In this paper, we propose two matrix-based CH rendezvous schemes in which the CH sequences are generated based on the ACSs only. We prove the guaranteed and full diversity rendezvous of the proposed schemes by deriving the theoretical upper bounds of their maximum TTRs. Furthermore, extensive simulation comparisons with other existing works are conducted which illustrate the superior performance of our schemes in terms of the TTR metrics.

KW - Blind rendezvous

KW - Channel hopping

KW - Distributed cognitive radio networks

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

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

U2 - 10.3390/s18124360

DO - 10.3390/s18124360

M3 - Article

C2 - 30544684

AN - SCOPUS:85058508941

VL - 18

JO - Sensors (Switzerland)

JF - Sensors (Switzerland)

SN - 1424-8220

IS - 12

M1 - 4360

ER -