标题: | 在OFDMA系统下的最大化保证服务品质讯务流数量排程演算法 QoS Scheduling for Maximum Guaranteed Flow Number in OFDMA-Based System |
作者: | 黄谦和 Huang, Chien-Ho 李程辉 Lee, Tsern-Huei 电信工程研究所 |
关键字: | 正交分频多工存取;服务品质;资源分配;排程;OFDMA;QoS;resource allocation;scheduling |
公开日期: | 2012 |
摘要: | 近年来,由于无线网路的快速发展,为我们日常生活中带来许多应用。这些应用通常都有着各自的服务品质需求,像是封包遗失率、延迟时间等。因此,设计一个能够保证服务品质与频谱效率的排程演算法是很重要的课题。在此论文中,我们设计了一个在正交分频多工存取系统下两阶段式的排程演算法。藉由将讯务流分成两个群组并在两阶段中依序服务,可以提高满足服务品质要求的讯务流数量。模拟结果显示我们提出的排程演算法与其他论文相比有相当幅度的增进,能够让系统在服务品质的要求下满足更多的讯务流。 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. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#GT079813538 http://hdl.handle.net/11536/47025 |
显示于类别: | Thesis |
文件中的档案:
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.