English  |  正體中文  |  简体中文  |  Items with full text/Total items : 74010/74010 (100%)
Visitors : 24664278      Online Users : 425
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8287

    Title: 802.16網路之上傳鏈路跨層排程設計;A Cross-Layer Scheduling Design for Uplink in 802.16 Network
    Authors: 余奕斌;Yi-bin Yu
    Contributors: 通訊工程研究所
    Keywords: scheduler;resource allocation;uplink;802.16;resource allocation;scheduler;802.16;uplink
    Date: 2008-06-24
    Issue Date: 2009-09-22 11:22:31 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 本篇論文提出一個在IEEE 802.16 uplink方向跨層排程設計BUF(Best user first),該設計由資源分配元件和頻寬需求管理元件所組成,資源分配元件使用的方法從第一條subchannel開始去尋找使用者,若該使用者擁有最佳使用率,則該使用者可以取得從此subchannel開始使用的分配權,這樣的方法可以有效解決BCF(best channel first)所造成的空隙問題,當現有頻寬資源無法滿所有使用者的需求時,則需求管理元件會利用階層架構以及評估連線滿足程度來刪減部份連線的頻寬請求,希冀維持QoS品質要求。 論文內容裡,首先介紹802.16規格內容,之後討論過去在資源分配及排程設計上出現的問題,最後提出一個跨層排程設計BUF,在第四章中以模擬數據來分析系統效能,發現BUF可以提供比RR+BCF更佳的資料傳輸量,並且可以提供每個SS公平的服務品質。 This thesis proposes a cross-layer scheduling design for uplink in 802.16 Network – BUF(Best user first),The scheduler is composed of resource allocation and bandwidth request management. Resource allocation allows subchannel from first one. If the user owns the best modulation from this subchannel, the system allows slot for the user from this subchannel. The way solves gap problem in BCF (Best channel first). If the bandwidth request is over the system total resource, the bandwidth request management would be called. In order to provide QoS (quality of service), the bandwidth request management decreases some bandwidth request of connections by hierarchical architecture and satisfaction degree of connection. In the thesis, the IEEE 802.16 standard is firstly described, and then discusses previous resource allocation and scheduler design problem. Furthermore, we propose a cross-layer scheduling design – BUF, Finally, the simulation results show the throughput of BUF more than RR+BCF and the BUF provides each SS with fairness service.
    Appears in Collections:[通訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明