中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/8524
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 78852/78852 (100%)
Visitors : 35045445      Online Users : 1327
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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://ir.lib.ncu.edu.tw/handle/987654321/8524


    Title: 在無線行動隨建即連網路下支援即時多媒體傳送的媒介存取協定;A Priority MAC Protocol to Support Real-time Multimedia Traffics in Ad Hoc Networks
    Authors: 劉耆勳;Chi-Hsun Liu
    Contributors: 資訊工程研究所
    Keywords: 無線行動隨建即連網路;載波感測多重擷取;媒介擷取控制;即時;多媒體;real-time;MANET;CSMA;MAC;multimedia
    Date: 2001-07-26
    Issue Date: 2009-09-22 11:29:18 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 載波感測多重擷取 (CSMA) 被廣泛的應用在無線行動隨建即連網路上。IEEE 802.11亦使用載波感測多重擷取及衝撞避免 (CSMA/CA) 的支術。但傳統的IEEE 802.11 基本的分散協調式功能 (Distributed Coordination Function,DCF) 並不支援即時多媒體的傳送。換句話說,IEEE 802.11 媒介存取控制的基本擷取方法無法保證即時資料的時限性,儘管是具有時限性的資料封包,一樣必須和一般的資料封包進入競爭視窗 (Contention Windows,CW) 來競爭頻道的使用權。 在這一篇論文中,我們提出了一個分散式的媒介存取協定。它能提供以優先權為主的多媒體存取協定。首先,每個網路成員若有資料要傳送須競爭頻道時,會先進入一個優先權機制來決定出相對最大的優先權。在此之後具有相同最大的成員們會再進入獲得傳送順序數字的機制,來得到唯一的順序號碼。一旦有了這個傳送順序,便可輪流來傳送資料。而具時限性封包要傳送的網路成員,則可依據此順序號碼來持續傳送封包,來限制資料封包的延遲時間。最後模擬的結果可是驗證我們定的協定可以有較佳的使用率和較少的平均封包延遲時間。 Carrier sense multiple access and its variants have been widely used in mobile ad hoc networks (MANET). However, it cannot guarantee the quality of real-time traffics. This thesis presents a distributed medium access control (MAC) protocol that provides priority based multimedia access to wireless ad-hoc networks. With this protocol, it has two phases to proceed. First, each station that wants to contend for access to the channel proceed the priority scheme, higher-priority packets (like real-time packets) have access priority over the lower-priority packets (like data packets). Second, after the priority scheme, the stations that have the same priority packets are assigned an unique ID (identity number) respectively in the contention period, and then (after the contention period) all stations that want to transmit packets depend on their ID sequence to access channel in turn. The simulation result used to verify this protocol, it can bounded real-time packet delay and has the high channel utilization.
    Appears in Collections:[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

    Files in This Item:

    File SizeFormat


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明