A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks

• Main Authors: Ke, Chang-Ting, 柯長廷
• Other Authors: Sheu, Jang-Ping
• Format: Others
• Language: en_US
• Published: 2014
• Online Access: http://ndltd.ncl.edu.tw/handle/39222518435996764501

碩士 === 國立清華大學 === 通訊工程研究所 === 102 === In cognitive radio networks (CRNs), primary users (PUs) have the absolute priority to access the license channels. To efficiently utilize the spectrum, secondary users (SUs) can dynamically access the unused channels by channel hopping (CH) schemes. Most existing CH schemes focus on the symmetric model that assumes all SUs have the same available channel set. However, the asymmetric model, where SUs may have different available channels sets, is more critical in the real CRN environment. In this thesis, we propose a universal channel hopping algorithm called Triple-Double Matrix (TDM) that can guarantee rendezvous within shorter period than the previous works under the asymmetric model without any constraints on the available channels of each SU. According to our simulation results, TDM has better maximum conditional time-to-rendezvous (MCTTR) than previous works.