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

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/58493

    题名: An efficient scheduling algorithm for radio resource reuse in IEEE 802.16j multi-hop relay networks
    作者: Liao, Wen-Hwa;Shih, Kuei-Ping;Liu, Chen;Avinash Kumar Dubey;Arora, Sagar;Sital Prasad Kedia
    贡献者: 淡江大學資訊工程學系
    日期: 2011-07
    上传时间: 2011-10-01 12:00:38 (UTC+8)
    摘要: The IEEE 802.16j standard for WiMAX introduced the concept of relay station in order to increase the service area and decrease the deployment cost of the network. In this paper, we have proposed an efficient scheduling scheme for IEEE 802.16j networks, which maximizes the number of connections that are scheduled in a particular time slot. The proposed scheme schedules the connections based on their priority, which is decided by the quality of service (QoS) requirement of the connections. A selected connection can be scheduled in the current timeslot only if it is not having interference with any of the already scheduled connections. Our algorithm considers scheduling of lower priority connections even if any higher priority connection is not scheduled due to interference. Thus, the delay for lower priority connections is reduced without increasing the delay for higher priority connections. In addition, our algorithm achieves higher frame utilization and higher system throughput by reducing the length of the schedule.
    關聯: Computers and Electrical Engineering 37(4), pp.511–525
    DOI: 10.1016/j.compeleceng.2011.05.002
    显示于类别:[資訊工程學系暨研究所] 期刊論文


    档案 大小格式浏览次数



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