TY - GEN
T1 - Spectrum opportunity-based control channel assignment in cognitive radio networks
AU - Lazos, Loukas
AU - Liu, Sisi
AU - Krunz, Marwan
PY - 2009
Y1 - 2009
N2 - We address the problem of dynamic assignment of coordination (control) channels in cognitive radio networks (CRNs) by exploiting time- and space-varying spectrum opportunities. Motivated by the inherent grouping of Cognitive Radio (CR) users according to channel availability, we propose a cluster-based architecture for control-channel assignment in a CRN. CRs are grouped in the same cluster if they roughly sense similar idle channels and are within communication range, either directly or via a clusterhead.We formulate the clustering design as a maximum edge biclique problem. A distributed cluster agreement algorithm called Spectrum-Opportunity Clustering (SOC) is proposed to solve this problem. SOC provides a desirable balance between two competing factors: the set of common idle channels within each cluster and the cluster size. A large set of common idle channels within each cluster allows graceful migration from the current control channel should primary radio (PR) activity appear on that channel. Hence, SOC provides a stable network partition with respect to local coordination, with no need for frequent reclustering. Moreover, when reclustering has to be performed (due to CR mobility or PR activity), CRs agree on new clusters after the broadcast of only three messages, thus incurring low communication overhead.
AB - We address the problem of dynamic assignment of coordination (control) channels in cognitive radio networks (CRNs) by exploiting time- and space-varying spectrum opportunities. Motivated by the inherent grouping of Cognitive Radio (CR) users according to channel availability, we propose a cluster-based architecture for control-channel assignment in a CRN. CRs are grouped in the same cluster if they roughly sense similar idle channels and are within communication range, either directly or via a clusterhead.We formulate the clustering design as a maximum edge biclique problem. A distributed cluster agreement algorithm called Spectrum-Opportunity Clustering (SOC) is proposed to solve this problem. SOC provides a desirable balance between two competing factors: the set of common idle channels within each cluster and the cluster size. A large set of common idle channels within each cluster allows graceful migration from the current control channel should primary radio (PR) activity appear on that channel. Hence, SOC provides a stable network partition with respect to local coordination, with no need for frequent reclustering. Moreover, when reclustering has to be performed (due to CR mobility or PR activity), CRs agree on new clusters after the broadcast of only three messages, thus incurring low communication overhead.
UR - http://www.scopus.com/inward/record.url?scp=70449578905&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449578905&partnerID=8YFLogxK
U2 - 10.1109/SAHCN.2009.5168974
DO - 10.1109/SAHCN.2009.5168974
M3 - Conference contribution
AN - SCOPUS:70449578905
SN - 9781424429080
T3 - 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
BT - 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
T2 - 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009
Y2 - 22 June 2009 through 26 June 2009
ER -