English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62822/95882 (66%)
造访人次 : 4016203      在线人数 : 556
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/94432


    题名: 在無線感知網路下以排程為基礎之資源分配研究
    其它题名: Resource allocation in wireless cognitive network based on a new scheduling mechanism
    作者: 李鎮亞;Lee, Chen-Ya
    贡献者: 淡江大學資訊工程學系碩士班
    葛煥昭;Keh, Huan-Chao
    关键词: 無線感知網路;公平性;排程;資源分配;Wireless Cognitive Network;Fairness;scheduling;resource allocation
    日期: 2013
    上传时间: 2014-01-23 14:38:21 (UTC+8)
    摘要: 由於現今的無線頻譜資源是採用固定的方式規劃頻譜使用區段,造成頻譜資源使用效率不佳,而行動通訊服務的需求日益增加,在有限頻譜資源下滿足連線服務品質保證亦為重要考量議題。為了增進頻譜的使用效率,因此利用無線感知網路技術(Wireless Cognitive Network)以妥善分配閒置的頻譜資源。主要頻譜(Primary Band)和次要頻譜(Secondary Band)使用的差異化是無線感知系統特有的法則,本論文利用無線頻譜上的感知(Spectrum Sensing)方式,當主要頻譜被占用的情況下,尋找可使用的次級頻譜,妥善配置空閒頻譜資源並設計有效之排程機制及資源分配方法。在強調連線公平性的優先權調整之下,動態調整優先權,以避免低優先權的連線出現延遲(Latency)或者飢餓(Starvation)的情況,並在五種資源分配的情況下作整體效能分析及探討。模擬實驗證明本論文中所提出的Adaptive Scheduling Scheme of Cognitive Network(ASCN)排程機制及資源分配方法與Maximum Rate(Max-Rate)以及Round Robin(RR)演算法比較,在五種資源分配情況下,皆可改善延遲及避免飢餓情況。
    Nowadays, the resource of wireless spectrum is limited because of using fixed bandwidth allocation, and inefficient use of spectrum is become a serious problem. At the moment, in order to increase the efficient use of spectrum, the Wireless Cognitive Network is presented to address this issue. Spectrum sensing collects remaining available resources which allow other users to be able to access, and use of designed scheduler to improve spectrum utilize efficiency. The designed scheduler makes different services correspond to different data streams to provide different Quality of Service with various applications. Priority adjustments and resource allocation were taken into account when the scheduler was designed in this paper. Limiting users with lower priority settings in the scheduling algorithm is efficacious for regulating the order of resource allocations made to the users. The goal is to achieve the highest system performance by enhancing transmission efficacy and satisfying the fairness of resource allocation at the same time. Finally, the scheduling avoids connection latency and starvation related to lower priority resource allocation.
    显示于类别:[資訊工程學系暨研究所] 學位論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML199检视/开启

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

    TAIR相关文章

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