English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51756/86971 (60%)
造訪人次 : 8358243      線上人數 : 130
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/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 ©   - 回饋