淡江大學機構典藏:Item 987654321/77280
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62830/95882 (66%)
造访人次 : 4038276      在线人数 : 566
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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 PDF227检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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