在OFDMA系統下的最大化保證服務品質訊務流數量排程演算法

Abstract

近年來，由於無線網路的快速發展，為我們日常生活中帶來許多應用。這些應用通常都有著各自的服務品質需求，像是封包遺失率、延遲時間等。因此，設計一個能夠保證服務品質與頻譜效率的排程演算法是很重要的課題。在此論文中，我們設計了一個在正交分頻多工存取系統下兩階段式的排程演算法。藉由將訊務流分成兩個群組並在兩階段中依序服務，可以提高滿足服務品質要求的訊務流數量。模擬結果顯示我們提出的排程演算法與其他論文相比有相當幅度的增進，能夠讓系統在服務品質的要求下滿足更多的訊務流。

In 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.