A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks
碩士 === 國立清華大學 === 通訊工程研究所 === 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 exi...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/39222518435996764501 |
id |
ndltd-TW-102NTHU5650116 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NTHU56501162016-03-09T04:34:23Z http://ndltd.ncl.edu.tw/handle/39222518435996764501 A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks 無線感知網路之頻道會合通用演算法設計 Ke, Chang-Ting 柯長廷 碩士 國立清華大學 通訊工程研究所 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. Sheu, Jang-Ping 許健平 2014 學位論文 ; thesis 46 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 通訊工程研究所 === 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.
|
author2 |
Sheu, Jang-Ping |
author_facet |
Sheu, Jang-Ping Ke, Chang-Ting 柯長廷 |
author |
Ke, Chang-Ting 柯長廷 |
spellingShingle |
Ke, Chang-Ting 柯長廷 A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
author_sort |
Ke, Chang-Ting |
title |
A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
title_short |
A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
title_full |
A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
title_fullStr |
A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
title_full_unstemmed |
A Universal Channel Rendezvous Algorithm for Cognitive Radio Networks |
title_sort |
universal channel rendezvous algorithm for cognitive radio networks |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/39222518435996764501 |
work_keys_str_mv |
AT kechangting auniversalchannelrendezvousalgorithmforcognitiveradionetworks AT kēzhǎngtíng auniversalchannelrendezvousalgorithmforcognitiveradionetworks AT kechangting wúxiàngǎnzhīwǎnglùzhīpíndàohuìhétōngyòngyǎnsuànfǎshèjì AT kēzhǎngtíng wúxiàngǎnzhīwǎnglùzhīpíndàohuìhétōngyòngyǎnsuànfǎshèjì AT kechangting universalchannelrendezvousalgorithmforcognitiveradionetworks AT kēzhǎngtíng universalchannelrendezvousalgorithmforcognitiveradionetworks |
_version_ |
1718202268710338560 |