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


    題名: A decentralized minislot selection (DMS) scheme for uplink and downlink traffic in IEEE 802.16 wireless mesh networks
    其他題名: 基植於IEEE 802.16 無線網狀網路上設計一同時考量上傳及下載資料流之分散式時槽選擇機制
    作者: 蔣季陶;Chiang, Chi-tao
    貢獻者: 淡江大學資訊工程學系碩士班
    石貴平;Shih, Kuei-ping
    關鍵詞: 無線網狀網路;集中式排程;分時多重存取;Wireless Mesh Network;IEEE 802.16;WiMAX;Centralized Scheduling;Time Division Multiple Access (TDMA)
    日期: 2008
    上傳時間: 2010-01-11 06:02:00 (UTC+8)
    摘要: 本論文考量在IEEE 802.16 無線網狀網路傳輸環境中,針對規格書所定義的集中式排程(Centralized Scheduling) 機制下提出一個分散式時槽選擇機制。此機制的目的在於有效地分配Minislots 資源使其能充分的利用,期望能夠使用最少的Minislots 來滿足網路中節點的需求。基於此目的,本論文先使用整數線性規劃 (Integer Linear Programming, ILP) 的方式來建構此排程問題的模型。此數學模型考慮傳輸對在不會互相影響的前提下,Minislot 的最佳使用數量及排程方式。然而ILP 求解屬於NP-complete 之問題,因此本論文進一步探討分散式時槽選擇機制以符合IEEE 802.16 無線網狀網路之真實情況。本論文首先探討不當的選擇Minislot 將會衍生出的三大造成整體網路執行效能下降問題:隱藏節點問題 (Hidden Terminal Problem) 、本身繞徑Minislot 不足問題 (Minislot Shortage Problem for Self-Route, MSP-SR) 及相鄰繞徑Minislot 不足問題 (Minislot Shortage Problem for Neighboring-Route, MSP-NP)。有鑑於此,本論文對於網路中節點使用Minislots 傳輸方式提出Minislots 使用限制政策(Minislots Inhibited Policies, MIPs)與Minislots 決定政策(Minislots Decision Policies, MDPs),並且同時考慮資料傳輸路徑上Minslots 的衝突問題及Minislots 的重覆使用,提出一分散式Minislot時槽選擇之機制。本論文透過此分散式Minislot 選擇機制,致使多對傳輸對可在同時間內進行傳輸,並能夠避免碰撞的發生,藉以提高網路的整體效能。由模擬實驗結果的數據得知,此分散式Minislot 選擇機制相較於IEEE 802.16 通訊協定能有較高網路整體效能與較低的傳輸延遲時間。
    This thesis proposes a Decentralized Minislot Selection (DMS) scheme with bandwidth guarantee based on centralized scheduling in IEEE 802.16 mesh networks. The goals of this scheme are to increase spatial reuse and achieve high system throughput. Based on the above goals, this thesis first develops an Integer Linear Programming (ILP) model for determining optimum minislot scheduling to minimize the used minislots accounting for the effect of interference and variable-rate transmission. However, solving the ILP problem is an NP-complete problem. Therefore, a Decentralized Minislot Selection (DMS) scheme is proposed in the thesis. This scheme contains two main policies: Minislot Inhibited Policies (MIPs) and Minislot Decision Policies (MDPs), for determining which minislots are valid to use and which minslots in the valid minislots can be used
    actually, respectively. In MDPs, three heuristic policies, 3BDP, LCFP and MRFP, are proposed to increase the successful rate of transmission and alleviate the minislot shortage problems. By the simulation result, the proposed scheme not only increases network throughput but also avoids the occurrences of collision and minislot shortage problems.
    顯示於類別:[資訊工程學系暨研究所] 學位論文

    文件中的檔案:

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

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

    TAIR相關文章

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