Matrix-based channel hopping algorithms for cognitive radio networks

Guey Yun Chang, Jen Feng Huang, Yao Shian Wang

研究成果: 雜誌貢獻期刊論文同行評審

32 引文 斯高帕斯(Scopus)

摘要

Cognitive radio networks (CRNs) have emerged as a critical technique for solving spectrum shortage problems and enhancing the utilization of licensed channels. To prevent interference with the co-locate incumbent networks, before data transmission, nodes in CRNs should rendezvous on an available channel (i.e., idle licensed channel) for establishing a link or exchanging control information. However, implementing rendezvous is challenging because the availability of channels is time-varying and position-varying. For reducing rendezvous failure and increasing throughput, a node pair in CRN should be able to rendezvous on every licensed channels (i.e., maximizing rendezvous diversity) and rendezvous on an available channel as soon as possible (i.e., minimizing maximum conditional time to rendezvous (MCTTR)). Besides, to take full advantage of the frequency diversity of multi-channel medium access, rendezvous should be spread out in time and channel (i.e., minimizing channel loading). In this paper, we propose two rendezvous channel hopping algorithms, T-CH and D-CH, which can be used without time synchronization and role pre-assignment (each node has a pre-assigned role as either a sender or a receiver). D-CH requires that SUs in CRNs should have a unique ID (identifier), while T-CH does not. Both our T-CH and D-CH have maximum rendezvous diversity and minimum channel loading, and outperform in terms of MCTTR.

原文???core.languages.en_GB???
文章編號7012065
頁(從 - 到)2755-2768
頁數14
期刊IEEE Transactions on Wireless Communications
14
發行號5
DOIs
出版狀態已出版 - 1 5月 2015

指紋

深入研究「Matrix-based channel hopping algorithms for cognitive radio networks」主題。共同形成了獨特的指紋。

引用此