Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks

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

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

19 Citations (Scopus)

Abstract

Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to 'rendezvous' before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. FH rendezvous protocols have mainly targeted pairwise rendezvous, using fixed (non-adaptive) FH sequences and assuming a homogeneous spectrum environment, i.e., all nodes perceive the same spectrum opportunities. In this paper, we address these limitations by developing three multicast rendezvous algorithms: AMQFH, CMQFH, and nested-CMQFH. The three algorithms are intended for asynchronous spectrum-heterogeneous DSA networks. They provide different tradeoffs between speed and robustness to node compromise. We use the uniform k-arbiter and the Chinese remainder theorem (CRT) quorum systems to design our multicast rendezvous algorithms. We also design two 'optimal' channel ordering mechanisms for channel sensing and assignment, one for AMQFH and the other for CMQFH and nested-CMQFH. Finally, we develop a proactive out-of-band sensing based dynamic FH (DFH) algorithm for online adaptation of the FH sequences used in the proposed rendezvous algorithms. Extensive simulations are used to evaluate our algorithms.

Original languageEnglish (US)
Title of host publication2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
Pages517-528
Number of pages12
DOIs
StatePublished - 2012
Event2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012 - Bellevue, WA, United States
Duration: Oct 16 2012Oct 19 2012

Other

Other2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
CountryUnited States
CityBellevue, WA
Period10/16/1210/19/12

Fingerprint

Frequency hopping
Communication

Keywords

  • Control channel
  • dynamic frequency hopping
  • dynamic spectrum access
  • multicast rendezvous
  • quorum systems

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Abdel Rahman, M. J., Rahbari, H., & Krunz, M. M. (2012). Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks. In 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012 (pp. 517-528). [6478176] https://doi.org/10.1109/DYSPAN.2012.6478176

Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks. / Abdel Rahman, Mohammad J.; Rahbari, Hanif; Krunz, Marwan M.

2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012. 2012. p. 517-528 6478176.

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

Abdel Rahman, MJ, Rahbari, H & Krunz, MM 2012, Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks. in 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012., 6478176, pp. 517-528, 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012, Bellevue, WA, United States, 10/16/12. https://doi.org/10.1109/DYSPAN.2012.6478176
Abdel Rahman MJ, Rahbari H, Krunz MM. Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks. In 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012. 2012. p. 517-528. 6478176 https://doi.org/10.1109/DYSPAN.2012.6478176
Abdel Rahman, Mohammad J. ; Rahbari, Hanif ; Krunz, Marwan M. / Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks. 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012. 2012. pp. 517-528
@inproceedings{f0ce6fe575d44754af45d071a13ca1f0,
title = "Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks",
abstract = "Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to 'rendezvous' before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. FH rendezvous protocols have mainly targeted pairwise rendezvous, using fixed (non-adaptive) FH sequences and assuming a homogeneous spectrum environment, i.e., all nodes perceive the same spectrum opportunities. In this paper, we address these limitations by developing three multicast rendezvous algorithms: AMQFH, CMQFH, and nested-CMQFH. The three algorithms are intended for asynchronous spectrum-heterogeneous DSA networks. They provide different tradeoffs between speed and robustness to node compromise. We use the uniform k-arbiter and the Chinese remainder theorem (CRT) quorum systems to design our multicast rendezvous algorithms. We also design two 'optimal' channel ordering mechanisms for channel sensing and assignment, one for AMQFH and the other for CMQFH and nested-CMQFH. Finally, we develop a proactive out-of-band sensing based dynamic FH (DFH) algorithm for online adaptation of the FH sequences used in the proposed rendezvous algorithms. Extensive simulations are used to evaluate our algorithms.",
keywords = "Control channel, dynamic frequency hopping, dynamic spectrum access, multicast rendezvous, quorum systems",
author = "{Abdel Rahman}, {Mohammad J.} and Hanif Rahbari and Krunz, {Marwan M}",
year = "2012",
doi = "10.1109/DYSPAN.2012.6478176",
language = "English (US)",
isbn = "9781467344487",
pages = "517--528",
booktitle = "2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012",

}

TY - GEN

T1 - Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks

AU - Abdel Rahman, Mohammad J.

AU - Rahbari, Hanif

AU - Krunz, Marwan M

PY - 2012

Y1 - 2012

N2 - Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to 'rendezvous' before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. FH rendezvous protocols have mainly targeted pairwise rendezvous, using fixed (non-adaptive) FH sequences and assuming a homogeneous spectrum environment, i.e., all nodes perceive the same spectrum opportunities. In this paper, we address these limitations by developing three multicast rendezvous algorithms: AMQFH, CMQFH, and nested-CMQFH. The three algorithms are intended for asynchronous spectrum-heterogeneous DSA networks. They provide different tradeoffs between speed and robustness to node compromise. We use the uniform k-arbiter and the Chinese remainder theorem (CRT) quorum systems to design our multicast rendezvous algorithms. We also design two 'optimal' channel ordering mechanisms for channel sensing and assignment, one for AMQFH and the other for CMQFH and nested-CMQFH. Finally, we develop a proactive out-of-band sensing based dynamic FH (DFH) algorithm for online adaptation of the FH sequences used in the proposed rendezvous algorithms. Extensive simulations are used to evaluate our algorithms.

AB - Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to 'rendezvous' before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. FH rendezvous protocols have mainly targeted pairwise rendezvous, using fixed (non-adaptive) FH sequences and assuming a homogeneous spectrum environment, i.e., all nodes perceive the same spectrum opportunities. In this paper, we address these limitations by developing three multicast rendezvous algorithms: AMQFH, CMQFH, and nested-CMQFH. The three algorithms are intended for asynchronous spectrum-heterogeneous DSA networks. They provide different tradeoffs between speed and robustness to node compromise. We use the uniform k-arbiter and the Chinese remainder theorem (CRT) quorum systems to design our multicast rendezvous algorithms. We also design two 'optimal' channel ordering mechanisms for channel sensing and assignment, one for AMQFH and the other for CMQFH and nested-CMQFH. Finally, we develop a proactive out-of-band sensing based dynamic FH (DFH) algorithm for online adaptation of the FH sequences used in the proposed rendezvous algorithms. Extensive simulations are used to evaluate our algorithms.

KW - Control channel

KW - dynamic frequency hopping

KW - dynamic spectrum access

KW - multicast rendezvous

KW - quorum systems

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

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

U2 - 10.1109/DYSPAN.2012.6478176

DO - 10.1109/DYSPAN.2012.6478176

M3 - Conference contribution

AN - SCOPUS:84876023766

SN - 9781467344487

SP - 517

EP - 528

BT - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012

ER -