English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49521/84656 (58%)
Visitors : 7590376      Online Users : 55
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/94425


    Title: 無線感知網路之排程策略
    Other Titles: Scheduling mechanism in wireless cognitive network
    Authors: 陳俊碩;Chen, Chun-Shuo
    Contributors: 淡江大學資訊工程學系碩士班
    葛煥昭;Keh, Huan-Chao
    Keywords: 感知網路;公平性;排程;延遲;飢餓;緊急佇列;Cognitive;Fairness;scheduling;Latency;Starvation;Emergency Queue
    Date: 2013
    Issue Date: 2014-01-23 14:37:53 (UTC+8)
    Abstract: 本論文中,筆者首先介紹了有關感知網路和其相關技術研究。本研究包含了一個應用於感知網路的可適性排程機制(簡稱ASCN),在動態頻譜偵測的運作下設計一個新型排程器讓次要使用者能有有效運用頻道裡主要使用者沒有運用的閒置資源,即時傳輸和非即時傳輸均在本論文的考慮範圍內。同時建立了優先權的排序方法,以延遲程度和資源獲取做為依據、用動態調整優先權的方式來降低系統的延遲程度。最後提出緊急佇列的概念,視各個連線的狀況來判斷是否需要進入緊急佇列以避免飢餓狀態的發生並且維持連線傳輸間的公平性。本論文的主要貢獻即是考量次要使用者於感知網路資源缺乏的情況下能夠兼顧傳輸效能外能妥善分配閒置資源並且符合傳輸的公平性、降低平均延遲程度、減少飢餓的情形。
    Recent advances in cognitive networks have increased the importance of scheduling. This study sought to enhance the fairness and decrease latency of cognitive networks by introducing and efficient scheduling algorithm capable of starvation and latency without sacrificing lower priority connections. Numerical results demonstrate that compare with others algorithm, it truly improved the starvation and latency problems. It helps real time connection with the lack of resources.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML107View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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