English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92429/122733 (75%)
Visitors : 26434890      Online Users : 225
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/69577
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/69577


    Title: QoS-constrained resource allocation scheduling for LTE network
    Authors: 張宏慶
    Hung-Chin Jang
    Contributors: 資科系
    Date: 2013-11
    Issue Date: 2014-09-02 17:18:47 (UTC+8)
    Abstract: Long Term Evolution (LTE) is the most promising technology for 4G mobile communication networks. The goal of LTE is to provide high data transmission rate, scalable bandwidth, low latency, and high-mobility. LTE employs Orthogonal Frequency Division Multiplexing (OFDM) and Single Carrier - Frequency Division Multiple Access (SC-FDMA) for downlink and uplink data transmission, respectively. As to SC-FDMA, there are two constraints in resource allocation. First, the allocated resource blocks (RB) should be contiguous. Second, these allocated resource blocks are forced to use the same modulation technique. This paper focuses on the resource allocation problem of LTE SC-FDMA system. The aim of this paper is to propose a QoS-constraint resource allocation scheduling to enhance data transmission on uplink SC-FDMA. The proposed scheduling is a three-stage approach. In the first stage, it uses a time domain scheduler to differentiate UE services according to different QoS service requirements. In the second stage, it uses a frequency domain scheduler to prioritize UE services based on channel quality. In the third stage, it limits the times of modulation downgrade in RBs allocation to enhance system throughput. In the simulations, the proposed method is compared to fixed sub-carrier dynamic resource allocation algorithm and adaptive dynamic sub-carrier resource allocation algorithm. Simulation results show that our method outperforms the other two methods in terms of throughput, transmission delay, packet loss ratio, and RB utilization.
    Relation: 2013 International Symposium on Wireless and Pervasive Computing (ISWPC)
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/ISWPC.2013.6707440
    DOI: 10.1109/ISWPC.2013.6707440
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File SizeFormat
    P10050.pdf3392KbAdobe PDF926View/Open


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


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback