English  |  正體中文  |  简体中文  |  Items with full text/Total items : 70588/70588 (100%)
Visitors : 23208578      Online Users : 463
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/8749

    Title: 無線隨意行動網路上以TDMA為基礎具服務品質的繞徑協定;An Efficient On-demand Bandwidth Reservation QoS Routing Protocol for Mobile Ad Hoc Networks
    Authors: 童聖傑;Shen-Chien Tung
    Contributors: 資訊工程研究所
    Keywords: 分時多重存取;頻寬保留;無線隨意行動網路;服務品質繞徑協定;Bandwidth-reservation;QoS routing;TDMA;mobile ad hoc network(MANET)
    Date: 2003-06-19
    Issue Date: 2009-09-22 11:34:08 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 無線網路的蓬勃發展使得無線的即時傳輸日益重要,例如無線的視訊會議需要穩定的傳輸品質,而以往routing的演算法並沒有提供一個良好的方法去解決保留頻寬的問題。這篇論文的目的是為了在mobile ad-hoc network(MANET)的網路環境中提供高效率的 quality-of-service routing (QoS routing),每個行動裝置利用Time Division Multiple Access (TDMA)的方法。我們所提出的是On-Demand QoS Routing Protocol,每一個source要傳資料時才broadcast route request packet,在找路的同時計算每一條路徑平均的最小可用頻寬,在destination收到許多路徑後,從中選出平均頻寬最大的路徑,並沿著該路徑由destination回溯到source,分別對路徑上的每個link選擇適當的time slots。我們針對每個link可以使用的time slots,分別去計算該time slot對整體網路的影響力,並選擇影響最小的time slots保留起來,當成未來將要使用的time slots。 The QoS routing is an important issue in wireless mobile ad hoc networks. It is known that resource reservation is the best technique to guarantee QoS. Lots of the reservation-based QoS routing protocols have been proposed before. However, the effective bandwidth calculation problem and the bandwidth reservation problem have not been addressed seriously in the literature. Here, we proposed a bandwidth reservation QoS routing protocol for TDMA-based multihop ad hoc networks. We propose an algorithm to guide the destination to choose the route that is most likely to satisfy the QoS requirement and an algorithm to reserve the proper time slot and thus keeps more free time slots for future requests. Our protocol only requires the information of one-hop neighbors. Simulation results show that our protocol can achieve high route establishment probability and low packet loss rate with a reasonable cost.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    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 ©   - Feedback  - 隱私權政策聲明