淡江大學機構典藏:Item 987654321/35254
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3926313      線上人數 : 719
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/35254


    題名: 3.5G高速封包下載存取之服務品質先備式封包排程演算法
    其他題名: Packet scheduling algorithm with QoS provision in HSDPA
    作者: 樂承羿;Le, Cheng-yi
    貢獻者: 淡江大學資訊工程學系碩士在職專班
    黃仁俊;Hwang, Ren-junn
    關鍵詞: UMTS系統;高速封包存取;排程演算法;服務品質保証;UMTS;HSDPA;Packet Scheduling Algorithm;Quality-of-Service
    日期: 2008
    上傳時間: 2010-01-11 06:15:58 (UTC+8)
    摘要: 近來,隨著第三代行動通訊系統的完成,多媒體的應用和需求與日俱增。在資料頻寬上的要求更超過目前第三代無線細胞系統所能提供能力;為了支援如此大量資料傳輸量,進而引領出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.
    顯示於類別:[資訊工程學系暨研究所] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    0KbUnknown837檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋