English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51835495      Online Users : 569
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/60243
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/60243


    Title: IEEE802.16j中具干擾感知之訊框排程的研究
    Interference-aware frame scheduling for IEEE 802.16j network
    Authors: 陳韋良
    Contributors: 張宏慶
    陳韋良
    Keywords: 中繼
    干擾
    排程
    relay
    interference
    scheduling
    Date: 2010
    Issue Date: 2013-09-04 17:06:42 (UTC+8)
    Abstract: IEEE 802.16標準中,有所謂Multi-hop Relay (MR)的概念,其中存在很多問題需要解決,所以在IEEE 802.16j標準中提出中繼傳輸站(Relay Station,RS)來延伸原來的涵蓋範圍及解決遮蔽效應造成訊號衰弱的問題。但在MR中由於多了中繼傳輸站來傳遞資料,網路拓樸變得相對複雜,資料從發送端到接收端的路徑變長了,在資料大量傳輸的狀況下,會因干擾及壅塞的問題變得嚴重而導致整個網路效能低落。本研究提出一套具干擾感知的排程方法,可有效提升網路效能。本方法分為三個部分,首先在允入控制階段盡可能選取高調變的連線,其次利用空間距離的分群概念提出TZG (Time Zone Grouping)方法,以逆時針的方式區分不同RS傳輸的時區,最後以調整分區內non-real time服務的頻寬需求,減少RS在access zone頻寬的浪費。我們利用NS2進行模擬實驗分析,驗證所提出的方法在利用分區傳送避免碰撞下,UGS的delay time相較於未分群的方法可有效改善約33%,ertPS可改善約29%,rtPS可改善約20%,而系統throughout相較於其他僅選擇最大access link的頻寬需求作為access zone大小的方法最多可提升約15.5%的效能。
    As we know, there is Multi-hop Relay concept in standard of IEEE 802.16. But there are still many problems unsolved in WiMAX, so IEEE 802.16j propose a new station type, relay station, to extend signal coverage and improve the signal intensity which affected by shadow fading. Since there are many relay stations in the coverage of base station, data transmission and path routing become more complexity. At the same time, the transmissions become close, more interference and network congestion will decrease the efficiency of data transmission in the network.
    This research proposes a frame scheduling with interference aware, which consist of three parts. First, we make the better modulation of links get higher priority; Second, we use concept of distance to proposed Time Zone grouping (TZG), which set RS into different group in counterclockwise way to reduce interference; Third, adjusting bandwidth allocation in access zone to decrease bandwidth waste in access zone. We implement our algorithm in NS2 simulator, the result shows that our method can improve delay of UGS about 33%, ertPS about 20%, rtPS about 20% than RTDS(Real time Distributed Scheduling ), and the system throughput can grow about 15.5% than the mechanism that just choose maximum requirement in access link of all BS/RS as access zone.
    Reference: [1] “IEEE Standard for Local and Metropolitan Area Networks, Part 16:Air Interface for Fixed Broadband Wireless Access Systems,” IEEE Std 802.16-2004, Oct. 2004.
    [2] “IEEE Standard for Local and Metropolitan Area Networks, Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems, Amendment for Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands,” IEEE 802.16e-2005, Feb. 2006.
    [3] “IEEE Standard for Local and Metropolitan Area Networks, Part 16:Air Interface for Broadband Wireless Access Systems Amendment 1: Multiple Relay Specification,” IEEE 802.16j-2009, June 2009.
    [4] V. Genc, S. Murphy, Y. Yu, and J. Murphy, “IEEE 802.16j Relay-Based Wireless Access Networks: An Overview,” in Wireless Communications 2008, IEEE, vol. 15, Issue 5, pp.56-63.
    [5] S.W. Peter and R.W. Heath, “The Future of WiMAX: Multihop Relaying with IEEE 802.16j,” Communications Magazine 2009, IEEE, vol. 47, Issue 1.
    [6] D. Ghosh, A. Gupta, and P. Mohapatra, “Adaptive Scheduling of Prioritized Traffic in IEEE 802.16j Wireless Networks,” Wireless and Mobile Computing, Networking and Communications 2009, IEEE, pp. 307-313.
    [7] D. Ghosh, A. Gupta, and P. Mohapatra, “Admission Control and Interference-Aware Scheduling in Multi-hop WiMAX Networks,” Mobile Ad-hoc and Sensor System 2007, pp. 1-9.
    [8] C. Nie, T. Korakis, an”A Multi-hop Polling Service with Bandwidth Request Aggregation in IEEE 802.16j Networks,” Vehicular Technology Conference 2008, IEEE, pp.2172-2176.
    [9] Y. Wang, K. Huang, and W. Huang, “An Adaptive Distributed Scheduling Scheme for IEEE 802.16j Networks,” International Wireless Communications and Mobile Computing Conference ACM proceeding 2010.
    [10] H. Baek and J. W. Jang, “Dynamic Frame Scheduling with Load Balancing for IEEE 802.16j,” Wireless Communication and Signal Processing, pp. 1-5.
    [11] G. Narlikar, G.Wilfong, and L. Zang, “Designing Multihop Wireless Backhaul Networks with Delay Guarantees,” International Conference on Computer Communications Infocom 2006 , IEEE, pp. 1-12.
    [12] C. Hsieh, J. Chen, and J. Weng, ”Cooperative Adaptive Partner Selection for Real-Time Services in IEEE 802.16j Multihop Relay Networks, ”Wireless Communications and Networking Conference 2010, IEEE, pp. 1-6.
    [13] A. F. Bayan and T. Wan, “A Scalable QoS Scheduling Architecture for WiMAX Multi-Hop Relay Networks,” Education Technology and Computer International Conference 2010 2nd, vol. 5, pp. 326-331.
    [14] K. Chu and T. Huang, “A Novel Bandwidth Request Mechanism for IEEE 802.16j Networks” Tamkang Journal of Science and Engineering 2010, vol. 13, No. 1, pp. 71-78.
    [15] Y. Lai and Y. Chen, ”Designing and Implementing an IEEE 802.16 Network Simulator for Performance Evaluation of Bandwidth Allocation Algorithm,” High Performance Computing and Communications 2009, IEEE, pp. 432-437.
    Description: 碩士
    國立政治大學
    資訊科學學系
    97753030
    99
    Source URI: http://thesis.lib.nccu.edu.tw/record/#G0097753030
    Data Type: thesis
    Appears in Collections:[資訊科學系] 學位論文

    Files in This Item:

    File SizeFormat
    303001.pdf5484KbAdobe PDF2633View/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