近來，隨著第三代行動通訊系統的完成，多媒體的應用和需求與日俱增。在資料頻寬上的要求更超過目前第三代無線細胞系統所能提供能力；為了支援如此大量資料傳輸量，進而引領出UMTS Rel.05所提出高速封包存取(HSDPA)；在此系統下，為了高速傳輸環境需求，提供了通道品質指示器(CQI)的功能來檢知通訊狀況，而有許多依通道狀況的排程方案也因此而被提出，並且試圖達到增加整體系統的高效能輸出以及同時能滿足服務品質(QoS)的要求。然而，目前並沒有方案用於UMTS環境中，能在混合自動重覆傳輸要求下(Hybrid ARQ)，達到權重管理不同資料型態之串流排程演算法。是以在高速封包存取之議題下，我們將提出一個利用混合自動重覆傳輸要求延遲傳送，並以服務要求優先權順序加以排程，用以有效利用共享通道並且滿足不同資料服務品質要求；我們所提出的加權複合式封包排程演算法模擬結果將與最大載波干擾比(Max Carrier to Interference Ratio)和公平比例(Proportional Fairness)演算法比較，預期所提出的權重演算法未來將可提升系統細胞的效能，並能滿足服務品質的要求。

The 3rd Generation WCDMA standard has been enhanced to offer significantly increased performance for packet data. But coming application like multimedia on desiring data rates will spur the UMTS can support. To support for such high data rates, High Speed Downlink Access (HSDPA), labeled as a 3.5G wireless system, has been published in UMTS Release 05. Under the HSDPA system, have to support high speed transmission and promises a peak data rate of up to 10Mb/s. To achieve such high speed rate, system provides the Channel Quality Indicator (CQI) information to detect the air interface condition. Then, there are many channel condition related scheduling schemes have been proposed to attend achievement of high system performance and guarantee the quality-of-service (QoS) requirements. However, there is no solution of packet scheduling algorithm can consider differences of data-types priority management under the hybrid automatic repeat request (H-ARQ) scenario. In this paper, we propose the weight combination packet scheduling algorithm to target to enhance the system efficiency and balanced QoS requirements.  The proposed schemes is simulated with OPNET simulator and compared with the Max CIR and PF algorithms in fast fading channel. Simulation result shows that the proposed algorithm can both effectively increase the cell throughput and meet the users’ satisfaction base QoS requirements.

目錄
第一章  緒論 1
1.1前言  1
1.2研究動機  4
1.3研究目的  6
1.4論文架構  8
第二章　相關研究  9
2.1 高速資料存取 9
2.2 高速封包下載存取  11
2.3 封包排程器模型和流程  20
2.4 高速封包下載之排程演算法  22
2.5 非即時性的排程演算法應用  23
2.6 即時性的排程演算法應用  28
第三章　服務品質先備式封包排程演算法  31
3.1 系統架構之設計動機與簡介  31
3.2 排程演算法架構及相關因子  34
3.3  HSPDSCH 指派動作/封包排程流程機制  40
第四章　封包排程演算法模擬與分析  48
4.1 模擬環境、相關參數及輔助程式  48
4.2 模擬場景設定  55
4.3 模擬結果  57
第五章 結論與未來發展  66
參考文獻  68
附錄一：論文英文稿  71

圖目錄 
圖1.1 3G無線網路系統演進  3
圖2.1 UTRAN架構下的高速資料存取   10
圖2.2 HS-DSCH的分散係數與時間關係  13
圖2.3 HSDPA實體層架構與Hybrid-ARQ  17
圖2.4 通道品質指示器(CQI)監控機制  19
圖2.5 封包排程器基本模型  21
圖3.1 封包排程中基地台監控使用者通道品質  32
圖3.2 一般狀況下的排程方式   41
圖3.3 資源不足狀況下的排程方式  42
圖3.4 一般資源不足狀況下的封包排程前  44
圖3.5 一般資源不足狀況下的封包排程後  44
圖3.6 資源不足狀況下的封包排程前  45
圖3.7 資源不足狀況下的封包排程依序排列  45
圖3.8 資源不足狀況下的封包排程完成結果  46
圖4.1 UMTS的組成架構  48
圖4.2 使用者裝置結構  50
圖4.3 基地台裝置結構  51
圖4.4 無線電訊網路制器裝置結構  52
圖4.5 GPR支援節點服務裝置結構  53
圖4.6 FTP伺服器串流服務支援資料表  54
圖4.7 演算法效能比較結果  58
圖4.8 Cumulative Distribution Function  59
圖4.9 MaxCIR algorithm v.s. service users  61
圖4.10 PF algorithm v.s. service users  61
圖4.11 QoS Provision algorithm v.s. service users  62
圖4.12 使用者最低需求吻合度  64

表目錄 
表2.1 封包排程演算法比較表  30
表3.1 通訊類別定義與相關延遲邊界  35
表4.1 使用者裝置結構  55

公式目錄
公式2-1  24
公式2-2  25
公式3-1  37
公式3-2  37
公式3-3  38
公式3-4  39
公式3-5  39
公式4-1  57

[1] H.Kaaranene, A.Ahtiainen and L.Laitinen, “UMTS Networks, Architecture, Mobility, and Services 2nd ed.”, Wiley, 2005
[2] T.E. Kolding, F. Frederiksen and P. E. Mogensen, “High Speed Downlink Packet Access: WCDMA Evolution,” IEEE of Vehicular Technology Conference News, Feb. 2003. Volume 6, Issue 1, Page(s) 4496-4500.
[3] S. Parkvall, E. Englund, M. Lundevall and J. Torsner, “Evolving 3G Mobile Systems: Broadband and Broadcast services in WCDMA”, IEEE Communication Magazine, Feb 2006, Page(s) 68-74.
[4] D. Mulvey, “HSPA”, IET Communication Engineer, Volume 5, Issue 1, Feb-Mar 2007, Page(s) 38-41.
[5] P. Viswanath, D.N.C.Tse and R.Laroia, “Opportunistic Beamforming Using Dumb Antennas,” IEEE of Transaction Information Theory, Volume 48, no.6, 2002, Page(s) 1277–1294.
[6] B. Al-Manthari, H. Hassanein and Nidal Nasser Queen’s University, “Packet scheduling in 3.5G high-speed downlink packet access network” breadth and depth” IEEE Network Magazine, Volume 21, Issue 1, Feb 2007, Page(s) 41-46
[7] 3GPP TS25.214, “Physical Layer Procedures (Release5)”, v. 5.5.0, June 2003.
[8] S. Borst, “User-Level Performance of Channel-Aware scheduling Algorithms in Wireless Data Networks,” Proceedings of IEEE INFOCOM, Volume 1, Mar. 2003, Page(s) 321–331.
[9] A. Jalali, R. Padovani, and R. Pankaj, “Data Throughput of CDMA-HDR a High Efficiency-High Date Rate Personal Communication Wireless System,” Proceedings of IEEE of Vehicular Technology Conference, May 2000, Page(s) 1854–1858.
[10] T. Bonald, “A Score-Based Opportunistic Scheduler for Fading Radio Channels,” Proceedings of European Wireless, Sept. 2002, Page(s) 2244–2248
[11] G. Barriac and J. Holtzman, “Introducing Delay Sensitivity into the Proportional Fair Algorithm for CDMA Downlink Scheduling,” Proceedings of IEEE 7th of International Symposium Spread Spectrum Techniques and Applications, Volume 3, 2002, Page(s) 652–656.
[12] P. Jose, Packet Scheduling and Quality of Service in HSDPA, Ph.D. dissertation, Aalborg University, Oct. 2003.
[13]H. Zeng et al., “Packet Scheduling Algorithm Considering Both the Delay Constraint and User Throughput in HSDPA,” Proceedings of International Conference Community of Circuits and System, volume 1, May 2005, Page(s) 387–382. 
[14]J. P. Romero, 0. Sallent, R. Agusti, and M. A. Diaz-Guerra, Radio Resource Management Strategies in UMTS, John Wiley & Sons, 2005.
[15]3GPP TS25.214 "Physical Layer Procedures (Release 5)," version 5.1 1.0, Jun. 2005.
[16]3GPP TR25.896 "Feasibility Study for Enhanced Uplink for UTRAFDD (Release 6)," version 6.0.0, Mar. 2004.