博碩士論文 107522617 完整後設資料紀錄

DC 欄位 語言
DC.contributor資訊工程學系zh_TW
DC.creator翁柏肯zh_TW
DC.creatorNatpakan Wongchamnanen_US
dc.date.accessioned2020-7-29T07:39:07Z
dc.date.available2020-7-29T07:39:07Z
dc.date.issued2020
dc.identifier.urihttp://ir.lib.ncu.edu.tw:88/thesis/view_etd.asp?URN=107522617
dc.contributor.department資訊工程學系zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract在蜂窩網絡中,經典的問題是信道分配,它為小區中的每個請求選擇要分配的信道。移動流量數據和移動設備的數量每年都在增長,但頻道數量有限。大多數作品將傳統的強化學習應用於信道分配而沒有預測的移動流量,並且與實際情況無關。 另外,流量預測結果對於行動流量的動態性質也很好。 因此,我們提出一種強化學習,提出了一種針對動態信道分配的強化學習框架,該框架考慮了流量預測,旨在最大程度地降低服務阻塞概率。我們使用近端策略優化算法(PPO)模型將阻塞概率和信道利用率與傳統方法進行比較,在意大利米蘭的144個基地台中創建了1350個信道,並使用了2013年11月1日至2013年12月31日的移動流量數據,使用DCA算法和其他強化學習模型進行模擬。zh_TW
dc.description.abstractIn cellular networks, the classic problem is channel assignment, which selects a channel to allocate for each request in a cell. However, the mobile traffic data and the number of mobile devices grow up every year, but the number of channels is limited. Most works apply traditional reinforcement learning in channel assignment without predicted mobile traffic and do not concern with real situations. In addition, mobile traffic prediction result works well for the dynamic nature of mobile traffic. Hence, we present a reinforcement learning framework for dynamic channel assignment which takes into account the mobile traffic prediction, which aims at minimizing the service blocking probability. In the simulation, we make 144 base stations in Milano, Italy with 1350 channels and using Mobile traffic data from November 1, 2013, to December 31, 2013, using Proximal Policy Optimization (PPO) model to compare blocking probability and channel utilization with traditional DCA algorithm and others reinforcement learning models.en_US
DC.subject強化學習zh_TW
DC.subject頻道指派zh_TW
DC.subject近端策略優化算法zh_TW
DC.subjectReinforcement learningen_US
DC.subjectChannel assignmenten_US
DC.subjectProximal Policy Optimizationen_US
DC.titleReinforcement Learning for Dynamic Channel Assignment Using Predicted Mobile Trafficen_US
dc.language.isoen_USen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明