Multicast Rendezvous in Fast-Varying DSA Networks

Mohammad J. Abdel-Rahman, Hanif Rahbari, Marwan M Krunz

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Establishing communications between devices in a dynamic spectrum access (DSA) system requires the communicating parties to "rendezvous" before transmitting data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Previous FH-based rendezvous designs mainly target unicast rendezvous, and do not intrinsically support multicast rendezvous, where a group of nodes need to rendezvous simultaneously. Furthermore, these designs do not account for fast primary user (PU) dynamics, leading to long time-to-rendezvous (TTR). In this paper, we exploit the uniform k-arbiter and Chinese Remainder Theorem quorum systems to develop three FH-based multicast rendezvous algorithms, which provide different tradeoffs between rendezvous efficiency (e.g., low TTR) and security (e.g., robustness to node compromise). Our rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA systems. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through efficient mechanisms for channel ordering and quorum selection. Our simulations validate the effectiveness of the proposed rendezvous algorithms, their PU detection accuracy, and their robustness to insider attacks.

Original languageEnglish (US)
Article number6899689
Pages (from-to)1449-1462
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume14
Issue number7
DOIs
StatePublished - Jul 1 2015

Fingerprint

Frequency hopping
Communication

Keywords

  • Channel sorting
  • dynamic frequency hopping
  • dynamic spectrum access
  • multicast rendezvous
  • quorum systems

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Multicast Rendezvous in Fast-Varying DSA Networks. / Abdel-Rahman, Mohammad J.; Rahbari, Hanif; Krunz, Marwan M.

In: IEEE Transactions on Mobile Computing, Vol. 14, No. 7, 6899689, 01.07.2015, p. 1449-1462.

Research output: Contribution to journalArticle

Abdel-Rahman, Mohammad J. ; Rahbari, Hanif ; Krunz, Marwan M. / Multicast Rendezvous in Fast-Varying DSA Networks. In: IEEE Transactions on Mobile Computing. 2015 ; Vol. 14, No. 7. pp. 1449-1462.
@article{3653bd66d93947f1a2218311024e6249,
title = "Multicast Rendezvous in Fast-Varying DSA Networks",
abstract = "Establishing communications between devices in a dynamic spectrum access (DSA) system requires the communicating parties to {"}rendezvous{"} before transmitting data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Previous FH-based rendezvous designs mainly target unicast rendezvous, and do not intrinsically support multicast rendezvous, where a group of nodes need to rendezvous simultaneously. Furthermore, these designs do not account for fast primary user (PU) dynamics, leading to long time-to-rendezvous (TTR). In this paper, we exploit the uniform k-arbiter and Chinese Remainder Theorem quorum systems to develop three FH-based multicast rendezvous algorithms, which provide different tradeoffs between rendezvous efficiency (e.g., low TTR) and security (e.g., robustness to node compromise). Our rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA systems. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through efficient mechanisms for channel ordering and quorum selection. Our simulations validate the effectiveness of the proposed rendezvous algorithms, their PU detection accuracy, and their robustness to insider attacks.",
keywords = "Channel sorting, dynamic frequency hopping, dynamic spectrum access, multicast rendezvous, quorum systems",
author = "Abdel-Rahman, {Mohammad J.} and Hanif Rahbari and Krunz, {Marwan M}",
year = "2015",
month = "7",
day = "1",
doi = "10.1109/TMC.2014.2356475",
language = "English (US)",
volume = "14",
pages = "1449--1462",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Multicast Rendezvous in Fast-Varying DSA Networks

AU - Abdel-Rahman, Mohammad J.

AU - Rahbari, Hanif

AU - Krunz, Marwan M

PY - 2015/7/1

Y1 - 2015/7/1

N2 - Establishing communications between devices in a dynamic spectrum access (DSA) system requires the communicating parties to "rendezvous" before transmitting data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Previous FH-based rendezvous designs mainly target unicast rendezvous, and do not intrinsically support multicast rendezvous, where a group of nodes need to rendezvous simultaneously. Furthermore, these designs do not account for fast primary user (PU) dynamics, leading to long time-to-rendezvous (TTR). In this paper, we exploit the uniform k-arbiter and Chinese Remainder Theorem quorum systems to develop three FH-based multicast rendezvous algorithms, which provide different tradeoffs between rendezvous efficiency (e.g., low TTR) and security (e.g., robustness to node compromise). Our rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA systems. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through efficient mechanisms for channel ordering and quorum selection. Our simulations validate the effectiveness of the proposed rendezvous algorithms, their PU detection accuracy, and their robustness to insider attacks.

AB - Establishing communications between devices in a dynamic spectrum access (DSA) system requires the communicating parties to "rendezvous" before transmitting data packets. Frequency hopping (FH) is an effective rendezvous method that does not rely on a predetermined control channel. Previous FH-based rendezvous designs mainly target unicast rendezvous, and do not intrinsically support multicast rendezvous, where a group of nodes need to rendezvous simultaneously. Furthermore, these designs do not account for fast primary user (PU) dynamics, leading to long time-to-rendezvous (TTR). In this paper, we exploit the uniform k-arbiter and Chinese Remainder Theorem quorum systems to develop three FH-based multicast rendezvous algorithms, which provide different tradeoffs between rendezvous efficiency (e.g., low TTR) and security (e.g., robustness to node compromise). Our rendezvous algorithms are tailored for asynchronous and spectrum-heterogeneous DSA systems. To account for fast PU dynamics, we develop an algorithm for adapting the proposed FH designs on the fly. This adaptation is done through efficient mechanisms for channel ordering and quorum selection. Our simulations validate the effectiveness of the proposed rendezvous algorithms, their PU detection accuracy, and their robustness to insider attacks.

KW - Channel sorting

KW - dynamic frequency hopping

KW - dynamic spectrum access

KW - multicast rendezvous

KW - quorum systems

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

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

U2 - 10.1109/TMC.2014.2356475

DO - 10.1109/TMC.2014.2356475

M3 - Article

VL - 14

SP - 1449

EP - 1462

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 7

M1 - 6899689

ER -