TY - GEN
T1 - Adaptive frequency hopping algorithms for multicast rendezvous in DSA networks
AU - Abdel Rahman, Mohammad J.
AU - Rahbari, Hanif
AU - Krunz, Marwan
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
T3 - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
SP - 517
EP - 528
BT - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
T2 - 2012 IEEE International Symposium on Dynamic Spectrum Access Networks, DYSPAN 2012
Y2 - 16 October 2012 through 19 October 2012
ER -