English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 110944/141864 (78%)
Visitors : 48070120      Online Users : 732
RC Version 6.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
    政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 >  Item 140.119/32658
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/32658


    Title: IEEE 802.16網狀網路使用令牌桶之允入控制
    Call Admission Control Using Token Bucket for IEEE 802.16 Mesh Networks
    Authors: 王川耘
    Wang,Chuan-Yin
    Contributors: 蔡子傑
    Tsai,Tzu-Chieh
    王川耘
    Wang,Chuan-Yin
    Keywords: 無線網路
    網狀網路
    允入控制
    IEEE 802.16
    wireless mesh networks
    WiMax
    Date: 2006
    Issue Date: 2009-09-17 13:58:33 (UTC+8)
    Abstract: 本論文對IEEE 802.16 協調分散式之網狀網路提出一允入控制之演算法。在此類網路中,控制子訊框交換各站台之排程訊息,並預留資料子訊框之時槽作為實際資料傳輸之用。我們利用令牌桶機制來控制網路訊流之流量特徵,如此可簡單的估計各訊流所需之頻寬。我們使用了所提出的頻寬估計方法,並一起考慮各訊流之跳接數與延遲時間之需求,提出的允入控制演算法能夠保證即時性串流之延遲時間需求,且可避免低等級訊流發生飢餓情形。模擬結果顯示,所提出的允入控制方法可以有效的把超過延遲時間需求之即時性訊流封包數目降低,並且低等級訊流在網路負載大時仍然可以存取頻道。
    We propose a routing metric (SWEB: Shortest-Widest Efficient Bandwidth) and an admission control (TAC: Token bucket-based Admission Control) algorithm under IEEE 802.16 coordinated, distributed mesh networks. In such network architectures, all scheduling messages are exchanged in the control subframes to reserve the timeslots in data subframes for the actual data transmissions. The token bucket mechanism is utilized to control the traffic pattern for easily estimating the bandwidth of a connection. We apply the bandwidth estimation and take the hop count and delay requirements into consideration. TAC is designed to guarantee the delay requirements of the real-time traffic flows, and avoid the starvation of the low priority ones. Simulation results show that TAC algorithm can effectively reduce the number of real-time packets that exceed the delay requirements and low priority flows still can access the channel when the network is heavily-loaded.
    Reference: [1] IEEE, "IEEE Standard for Local and metropolitan area networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems", IEEE standard.
    [2] IEEE, "IEEE Standard for Local and metropolitan area networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems", IEEE standard, October 2004.
    [3] D. Aguayo et al., “MIT Roofnet: Construction of a Community Wireless Network,” Proc. of MIT Student Oxygen Workshop, 2003
    [4] Tzu-Chieh Tsai, Chi-Hong Jiang, and Chuang-Yin Wang, "CAC and Packet Scheduling Using Token Bucket for IEEE 802.16 Networks", in Journal of Communications (JCM, ISSN 1796-2021), Volume : 1 Issue : 2, 2006. Page(s): 30-37. Academy Publisher.
    [5] Harish Shetiya and Vinod Sharma, "Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks", Proceedings of the 1st ACM workshop on Wireless multimedia networking and performance modeling WMuNeP `05. Pages: 140-149
    [6] Fuqiang LIU, Zhihui ZENG, Jian TAO, Qing LI, and Zhangxi LIN, "Achieving QoS for IEEE 802.16 in Mesh Mode",8th International Conference on Computer Science and Informatics, Salt Lake City, USA.
    [7] Hung-Yu Wei, Samrat Ganguly, Rauf Izmailov, and Zygmunt J. Haas, "Interference- Aware IEEE 802.16 WiMax Mesh Networks", in Proceedings of 61st IEEE Vehicular Technology Conference (VTC 2005 Spring), Stockholm, Sweden.
    [8] Min Cao, Qian Zhang, Xiaodong Wang, and Wenwu Zhu, "Modelling and Performance Analysis of the Distributed Scheduler in IEEE 802.16 Mesh Mode", Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing. Urbana-Champaign, IL, USA.
    [9] Dave Beyer, Carl Eklund, Mika Kasslin, and Nico van Waes ,Presentation ("Tutorial: 802.16 MAC Layer Mesh Extensions Overview"): Comment contribution ,02/03/07
    [10] Douglas S. J. De Couto, Daniel Aguayo, John Bicket , and Robert Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing”, ACM MobiCom ’03, September 14–19, 2003, San Diego, California, USA
    [11] R. Draves, J. Padhye, and B. Zill, “Routing in Multi-Radio, Multi-hop wireless mesh networks”, ACM MobiCom 2004.
    [12] Girija Narlikar, Gordon Wilfong and Lisa Zhang, “Designing Multihop Wireless Backhaul Networks with Delay Guarantees”, Proc. Infocom 2006.
    Description: 碩士
    國立政治大學
    資訊科學學系
    93753022
    95
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0093753022
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File Description SizeFormat
    75302201.pdf53KbAdobe PDF21422View/Open
    75302202.pdf63KbAdobe PDF21134View/Open
    75302203.pdf15KbAdobe PDF21559View/Open
    75302204.pdf12KbAdobe PDF2977View/Open
    75302205.pdf307KbAdobe PDF21486View/Open
    75302206.pdf139KbAdobe PDF21743View/Open
    75302207.pdf197KbAdobe PDF21284View/Open
    75302208.pdf914KbAdobe PDF21293View/Open
    75302209.pdf130KbAdobe PDF21181View/Open
    75302210.pdf16KbAdobe PDF2987View/Open
    75302211.pdf21KbAdobe PDF21057View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback