Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks

Abdulmajid Al-Mqdashi, A. Sali, Mohammad J. Abdel-Rahman, Nor Kamariah Noordin, Shaiful J. Hashim, Rosdiadee Nordin

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Rendezvous is a fundamental operation for establishing communications between cognitive radios in a cognitive radio ad hoc network (CRAHN). Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing CH-based rendezvous schemes were not designed for CRAHNs operating under fast primary user (PU) dynamics and result in excessive rendezvous delay when applied in such dynamic environments. To cope with fast PU dynamics, we propose in this paper two efficient cyclic-quorum–based CH rendezvous schemes, which we refer to as nested cyclic quorum channel hopping (NCQ-CH) and minimal nested cyclic quorum channel hopping (MNCQ-CH). The proposed schemes are tailored for the spectrum-heterogeneous CRAHNs. In addition to proactively accounting for PU dynamics, our CH-based rendezvous schemes are designed to react to fast PU dynamics on the fly. To achieve this online adaptation, we augment NCQ-CH and MNCQ-CH with efficient mechanisms for channel ranking and quorum selection. Our simulations demonstrate the superior performance of the proposed schemes under fast PU dynamics, in terms of the time-to-rendezvous and PU detection accuracy, as compared with existing rendezvous schemes in the literature.

Original languageEnglish
Article numbere3217
JournalTransactions on Emerging Telecommunications Technologies
Volume28
Issue number12
DOIs
Publication statusPublished - 1 Dec 2017

Fingerprint

Cognitive radio
Ad hoc networks
Communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks. / Al-Mqdashi, Abdulmajid; Sali, A.; Abdel-Rahman, Mohammad J.; Noordin, Nor Kamariah; Hashim, Shaiful J.; Nordin, Rosdiadee.

In: Transactions on Emerging Telecommunications Technologies, Vol. 28, No. 12, e3217, 01.12.2017.

Research output: Contribution to journalArticle

Al-Mqdashi, Abdulmajid ; Sali, A. ; Abdel-Rahman, Mohammad J. ; Noordin, Nor Kamariah ; Hashim, Shaiful J. ; Nordin, Rosdiadee. / Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks. In: Transactions on Emerging Telecommunications Technologies. 2017 ; Vol. 28, No. 12.
@article{7599df18fb5a4419ae51e79d6496bfc2,
title = "Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks",
abstract = "Rendezvous is a fundamental operation for establishing communications between cognitive radios in a cognitive radio ad hoc network (CRAHN). Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing CH-based rendezvous schemes were not designed for CRAHNs operating under fast primary user (PU) dynamics and result in excessive rendezvous delay when applied in such dynamic environments. To cope with fast PU dynamics, we propose in this paper two efficient cyclic-quorum–based CH rendezvous schemes, which we refer to as nested cyclic quorum channel hopping (NCQ-CH) and minimal nested cyclic quorum channel hopping (MNCQ-CH). The proposed schemes are tailored for the spectrum-heterogeneous CRAHNs. In addition to proactively accounting for PU dynamics, our CH-based rendezvous schemes are designed to react to fast PU dynamics on the fly. To achieve this online adaptation, we augment NCQ-CH and MNCQ-CH with efficient mechanisms for channel ranking and quorum selection. Our simulations demonstrate the superior performance of the proposed schemes under fast PU dynamics, in terms of the time-to-rendezvous and PU detection accuracy, as compared with existing rendezvous schemes in the literature.",
author = "Abdulmajid Al-Mqdashi and A. Sali and Abdel-Rahman, {Mohammad J.} and Noordin, {Nor Kamariah} and Hashim, {Shaiful J.} and Rosdiadee Nordin",
year = "2017",
month = "12",
day = "1",
doi = "10.1002/ett.3217",
language = "English",
volume = "28",
journal = "Transactions on Emerging Telecommunications Technologies",
issn = "2161-5748",
publisher = "John Wiley and Sons Ltd",
number = "12",

}

TY - JOUR

T1 - Efficient rendezvous schemes for fast-varying cognitive radio ad hoc networks

AU - Al-Mqdashi, Abdulmajid

AU - Sali, A.

AU - Abdel-Rahman, Mohammad J.

AU - Noordin, Nor Kamariah

AU - Hashim, Shaiful J.

AU - Nordin, Rosdiadee

PY - 2017/12/1

Y1 - 2017/12/1

N2 - Rendezvous is a fundamental operation for establishing communications between cognitive radios in a cognitive radio ad hoc network (CRAHN). Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing CH-based rendezvous schemes were not designed for CRAHNs operating under fast primary user (PU) dynamics and result in excessive rendezvous delay when applied in such dynamic environments. To cope with fast PU dynamics, we propose in this paper two efficient cyclic-quorum–based CH rendezvous schemes, which we refer to as nested cyclic quorum channel hopping (NCQ-CH) and minimal nested cyclic quorum channel hopping (MNCQ-CH). The proposed schemes are tailored for the spectrum-heterogeneous CRAHNs. In addition to proactively accounting for PU dynamics, our CH-based rendezvous schemes are designed to react to fast PU dynamics on the fly. To achieve this online adaptation, we augment NCQ-CH and MNCQ-CH with efficient mechanisms for channel ranking and quorum selection. Our simulations demonstrate the superior performance of the proposed schemes under fast PU dynamics, in terms of the time-to-rendezvous and PU detection accuracy, as compared with existing rendezvous schemes in the literature.

AB - Rendezvous is a fundamental operation for establishing communications between cognitive radios in a cognitive radio ad hoc network (CRAHN). Channel hopping (CH) provides an effective method for achieving rendezvous without relying on a dedicated common control channel. Most of the existing CH-based rendezvous schemes were not designed for CRAHNs operating under fast primary user (PU) dynamics and result in excessive rendezvous delay when applied in such dynamic environments. To cope with fast PU dynamics, we propose in this paper two efficient cyclic-quorum–based CH rendezvous schemes, which we refer to as nested cyclic quorum channel hopping (NCQ-CH) and minimal nested cyclic quorum channel hopping (MNCQ-CH). The proposed schemes are tailored for the spectrum-heterogeneous CRAHNs. In addition to proactively accounting for PU dynamics, our CH-based rendezvous schemes are designed to react to fast PU dynamics on the fly. To achieve this online adaptation, we augment NCQ-CH and MNCQ-CH with efficient mechanisms for channel ranking and quorum selection. Our simulations demonstrate the superior performance of the proposed schemes under fast PU dynamics, in terms of the time-to-rendezvous and PU detection accuracy, as compared with existing rendezvous schemes in the literature.

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

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

U2 - 10.1002/ett.3217

DO - 10.1002/ett.3217

M3 - Article

AN - SCOPUS:85037710758

VL - 28

JO - Transactions on Emerging Telecommunications Technologies

JF - Transactions on Emerging Telecommunications Technologies

SN - 2161-5748

IS - 12

M1 - e3217

ER -