TY - JOUR
T1 - Multicast Rendezvous in Fast-Varying DSA Networks
AU - Abdel-Rahman, Mohammad J.
AU - Rahbari, Hanif
AU - Krunz, Marwan
N1 - Funding Information:
This research was supported in part by the US National Science Foundation (NSF) (Grants IIP-1265960 and IIP-1432880) and Raytheon. Any opinions, findings, conclusions, or recommendations expressed in this paper are those of the author(s) and do not necessarily reflect the views of the US National Science Foundation. Preliminary results in this paper were presented at the IEEE DySPAN Conference, Oct. 2012 [1].
Publisher Copyright:
© 2014 IEEE.
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
AN - SCOPUS:84961616522
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 -