Full metadata record
DC FieldValueLanguage
dc.contributor.author黃謙和en_US
dc.contributor.authorHuang, Chien-Hoen_US
dc.contributor.author李程輝en_US
dc.contributor.authorLee, Tsern-Hueien_US
dc.date.accessioned2015-11-26T01:05:24Z-
dc.date.available2015-11-26T01:05:24Z-
dc.date.issued2012en_US
dc.identifier.urihttp://140.113.39.130/cdrfb3/record/nctu/#GT079813538en_US
dc.identifier.urihttp://hdl.handle.net/11536/47025-
dc.description.abstract近年來,由於無線網路的快速發展,為我們日常生活中帶來許多應用。這些應用通常都有著各自的服務品質需求,像是封包遺失率、延遲時間等。因此,設計一個能夠保證服務品質與頻譜效率的排程演算法是很重要的課題。在此論文中,我們設計了一個在正交分頻多工存取系統下兩階段式的排程演算法。藉由將訊務流分成兩個群組並在兩階段中依序服務,可以提高滿足服務品質要求的訊務流數量。模擬結果顯示我們提出的排程演算法與其他論文相比有相當幅度的增進,能夠讓系統在服務品質的要求下滿足更多的訊務流。zh_TW
dc.description.abstractIn recently years, broadband wireless access, an attractive technology to support various applications in our daily life, has been developed rapidly. Those applications usually have QoS requirements, such that packet loss ratio and delay bound. Therefore, it is important to design a scheduling scheme that provides QoS and uses spectrum efficiently. In this thesis, we propose a two-stage scheduling scheme in OFDMA-based wireless system. Flows are divided into two sets and served with two resource allocation algorithm in two stages. The simulation results show that our proposed scheme can serve more flows than previous work, under the same QoS requirements.en_US
dc.language.isoen_USen_US
dc.subject正交分頻多工存取zh_TW
dc.subject服務品質zh_TW
dc.subject資源分配zh_TW
dc.subject排程zh_TW
dc.subjectOFDMAen_US
dc.subjectQoSen_US
dc.subjectresource allocationen_US
dc.subjectschedulingen_US
dc.title在OFDMA系統下的最大化保證服務品質訊務流數量排程演算法zh_TW
dc.titleQoS Scheduling for Maximum Guaranteed Flow Number in OFDMA-Based Systemen_US
dc.typeThesisen_US
dc.contributor.department電信工程研究所zh_TW
Appears in Collections:Thesis


Files in This Item:

  1. 353801.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.