Cooperative CoMP Adaptive QoS-based Scheduling and Min-Max Radio RB Allocation for Maximizing Reliability and Throughput in 4G LTE-A Networks

碩士 === 國立雲林科技大學 === 資訊工程系碩士班 === 101 === The Long Term Evolution-Advanced (LTE-A) specifications have been specified by 3GPP as the 4-th generation cellular communication. LTE-A proposes several key features, including increasing data rate by using 8x8 MIMO, improving signal quality for edge users,...

Full description

Bibliographic Details
Main Authors: Chun-chieh Wang, 王俊傑
Other Authors: Ben-jye Chang
Format: Others
Language:en_US
Published: 2013
Online Access:http://ndltd.ncl.edu.tw/handle/84194657153484091797
Description
Summary:碩士 === 國立雲林科技大學 === 資訊工程系碩士班 === 101 === The Long Term Evolution-Advanced (LTE-A) specifications have been specified by 3GPP as the 4-th generation cellular communication. LTE-A proposes several key features, including increasing data rate by using 8x8 MIMO, improving signal quality for edge users, increasing service range while not increasing much deployment cost of eNBs, etc. Although the supreme mechanisms have been depicted in related studies, some critical issues need to be addressed efficiently: 1) requiring a cooperative cross-layer scheduling for intra- and inter-eNB, 2) requiring an efficient CoMP-based scheduling for inter-eNB and inter-eNB-Relays, 3) needing an efficient RB resource allocation, etc. Thus, this paper proposes the Cooperative CoMP adaptive QoS-based scheduling and the Min-Max radio resource block(RB) allocation for 4G LTE-A, namely CCMM. CCMM consists of three key phases: 1) Adaptive CoMP JT Initiation/Termination rules(ACJT), 2) Dynamic Division of RBs(DDRB), and 3) Hierarchical Scheduling with Min-Max RB allocation(HSMM). Numerical results demonstrate that the proposed CCMM approach outperforms the compared approaches in system capacity, network throughput, average packet delay and average dropping probability. Additionally, the computation complexity of CCMM is analyzed and it shows that CCMM needs (K‧C) or (K‧B)of running time, where K is number of UEs, C is number of traffic classes and B is number of RBs within a TTI.