English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3980815      線上人數 : 495
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/77280

    題名: Resource Sharing and Bandwidth Allocation for WiMAX Mesh Networks Using Centralized Scheduling
    作者: Tang, Yu-Liang;Wu, Tin-Yu;Ding, Jen-Wen;Chen, Jun-Jie
    貢獻者: 淡江大學電機工程學系
    關鍵詞: WiMAX mesh networks;Route construction;Packet scheduling;Bandwidth allocation;Interference-aware routing
    日期: 2010-03-01
    上傳時間: 2012-06-14 10:28:06 (UTC+8)
    出版者: 臺北市:臺灣學術網路管理委員會
    摘要: IEEE 802.16, also known as WiMAX, is considered to be an important technology for next-generation wireless metropolitan area network (WMAN) and has received great attention for its potential applications. WiMAX supports two types of modes: point-to-multipoint mode and mesh mode. While the point-to-multipoint mode is well developed, the mesh mode still has many design issues to be addressed, such as routing and packet scheduling algorithms. This paper investigates the routing and packet scheduling algorithms of WiMAX mesh networks. Three sets of routing and packet scheduling algorithms are proposed: (1) interference-based optimal routing and parallel-relay-based packet scheduling, (2) link-prioritization-based routing and link-group-based packet scheduling, and (3) minimal-conflict-cost routing and deficiency-fair priority-based packet scheduling. The simulation results show that the proposed algorithms can make efficient use of radio resource.
    關聯: Journal of Internet Technology=網際網路技術學刊 11(2), pp.251-259
    DOI: 10.6138/JIT.2010.11.2.11
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數
    1607-9264_11(2)p251-259.pdf1161KbAdobe PDF225檢視/開啟



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