Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory
碩士 === 國立東華大學 === 電機工程學系 === 104 === Due to the rapid growth of wireless networks and the requirement on the quality of service (QoS), the improvement of the spectrum utilization efficiency under busy and congested urban environment has become an important issue. Cognitive radio (CR) is the best te...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Published: |
2016
|
Online Access: | http://ndltd.ncl.edu.tw/handle/729qcc |
id |
ndltd-TW-104NDHU5442016 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-104NDHU54420162019-05-15T23:01:22Z http://ndltd.ncl.edu.tw/handle/729qcc Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory 運用感知無線電網路結合拍賣理論選擇非相同頻道之時域切分機制 Yi-Yang Du 杜翊暘 碩士 國立東華大學 電機工程學系 104 Due to the rapid growth of wireless networks and the requirement on the quality of service (QoS), the improvement of the spectrum utilization efficiency under busy and congested urban environment has become an important issue. Cognitive radio (CR) is the best technique to fulfill this task. Without affecting the transmission of the primary users (PUs), the secondary users (SUs) can detect the idle channels and send their information via these channels. The theories of economics were used in some previous research to improve the spectrum utilization efficiency. In this thesis, the auction theory is incorporated into CR for the allocation of channels so that the number of users can be increased and the efficiency can be enhanced. The results are further compared with those from the general allocation of channels in CR. Keywords : Cognitive radio ; Auction theory Po-Hao Chang 張伯浩 2016 學位論文 ; thesis 49 |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 電機工程學系 === 104 === Due to the rapid growth of wireless networks and the requirement on the quality of service (QoS), the improvement of the spectrum utilization efficiency under busy and congested urban environment has become an important issue. Cognitive radio (CR) is the best technique to fulfill this task. Without affecting the transmission of the primary users (PUs), the secondary users (SUs) can detect the idle channels and send their information via these channels.
The theories of economics were used in some previous research to improve the spectrum utilization efficiency. In this thesis, the auction theory is incorporated into CR for the allocation of channels so that the number of users can be increased and the efficiency can be enhanced. The results are further compared with those from the general allocation of channels in CR.
Keywords : Cognitive radio ; Auction theory
|
author2 |
Po-Hao Chang |
author_facet |
Po-Hao Chang Yi-Yang Du 杜翊暘 |
author |
Yi-Yang Du 杜翊暘 |
spellingShingle |
Yi-Yang Du 杜翊暘 Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
author_sort |
Yi-Yang Du |
title |
Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
title_short |
Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
title_full |
Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
title_fullStr |
Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
title_full_unstemmed |
Non-Identical Time Domain Channel Allocation Mechanism in Cognitive Radio Networks by Using Auction Theory |
title_sort |
non-identical time domain channel allocation mechanism in cognitive radio networks by using auction theory |
publishDate |
2016 |
url |
http://ndltd.ncl.edu.tw/handle/729qcc |
work_keys_str_mv |
AT yiyangdu nonidenticaltimedomainchannelallocationmechanismincognitiveradionetworksbyusingauctiontheory AT dùyìyáng nonidenticaltimedomainchannelallocationmechanismincognitiveradionetworksbyusingauctiontheory AT yiyangdu yùnyònggǎnzhīwúxiàndiànwǎnglùjiéhépāimàilǐlùnxuǎnzéfēixiāngtóngpíndàozhīshíyùqièfēnjīzhì AT dùyìyáng yùnyònggǎnzhīwúxiàndiànwǎnglùjiéhépāimàilǐlùnxuǎnzéfēixiāngtóngpíndàozhīshíyùqièfēnjīzhì |
_version_ |
1719139536730062848 |