TY - JOUR
T1 - Cluster-based control channel allocation in opportunistic cognitive radio networks
AU - Liu, Sisi
AU - Lazos, Loukas
AU - Krunz, Marwan
N1 - Funding Information:
This research was supported in part by the US National Science Foundation (NSF) (under grants CNS-1016943, CNS-0844111, CNS-0721935, CNS-0904681, IIP-0832238), Raytheon, and the “Connection One” center. 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 NSF. A preliminary version of this paper was presented at the IEEE SECON 2009 Conference, Rome, June 2009.
PY - 2012
Y1 - 2012
N2 - Cognitive radio networks (CRNs) involve extensive exchange of control messages, which are used to coordinate critical network functions such as distributed spectrum sensing, medium access, and routing, to name a few. Typically, control messages are broadcasted on a preassigned common control channel, which can be realized as a separate frequency band in multichannel systems, a given time slot in TDMA systems, or a frequency hopping sequence (or CDMA code) in spread spectrum systems. However, a static control channel allocation is contrary to the opportunistic access paradigm. In this paper, we address the problem of dynamically assigning the control channel in CRNs based on time-and space-varying spectrum opportunities. We propose a cluster-based architecture that allocates different channels for control at various clusters in the network. The clustering problem is formulated as a bipartite graph problem, for which we develop a class of algorithms that provide different tradeoffs between two conflicting factors: number of common channels in a cluster and the cluster size. Clusters are guaranteed to have a desirable number of common channels for control, which facilitates for graceful channel migration when primary radio (PR) activity is detected, without the need for frequent reclustering. We perform extensive simulations that verify the agility of our algorithms in adapting to spatial-temporal variations in spectrum availability.
AB - Cognitive radio networks (CRNs) involve extensive exchange of control messages, which are used to coordinate critical network functions such as distributed spectrum sensing, medium access, and routing, to name a few. Typically, control messages are broadcasted on a preassigned common control channel, which can be realized as a separate frequency band in multichannel systems, a given time slot in TDMA systems, or a frequency hopping sequence (or CDMA code) in spread spectrum systems. However, a static control channel allocation is contrary to the opportunistic access paradigm. In this paper, we address the problem of dynamically assigning the control channel in CRNs based on time-and space-varying spectrum opportunities. We propose a cluster-based architecture that allocates different channels for control at various clusters in the network. The clustering problem is formulated as a bipartite graph problem, for which we develop a class of algorithms that provide different tradeoffs between two conflicting factors: number of common channels in a cluster and the cluster size. Clusters are guaranteed to have a desirable number of common channels for control, which facilitates for graceful channel migration when primary radio (PR) activity is detected, without the need for frequent reclustering. We perform extensive simulations that verify the agility of our algorithms in adapting to spatial-temporal variations in spectrum availability.
KW - Dynamic spectrum networks
KW - bipartite graphs
KW - clustering
KW - cognitive radios
KW - control channel assignment
UR - http://www.scopus.com/inward/record.url?scp=84865426000&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84865426000&partnerID=8YFLogxK
U2 - 10.1109/TMC.2012.33
DO - 10.1109/TMC.2012.33
M3 - Article
AN - SCOPUS:84865426000
SN - 1536-1233
VL - 11
SP - 1436
EP - 1449
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 10
M1 - 6148229
ER -