Performance of Separate Random User Scheduling (srus) and Joint User Scheduling (jus) in the Long Term Evolution – Advanced
نویسنده
چکیده
Carrier aggregation (CA) is one of the main features in Long Term Evolution– Advanced (LTE-A). CA will allow the target peak data rates in excess of 1 Gbps in the downlink and 500 Mbps in the uplink to be achieved and the users can have access to the total bandwidth of up to 100 MHz. The system bandwidth may be continuous or system consisting of several parts of non-continuous aggregated bandwidth. This paper provides a summary of the supported CA scenarios as well as an overview of the advanced functionality of CA-LTE with particular emphasis on the basic concept, control mechanisms, and the performance aspects of (CA). This paper also demonstrates how CA can be used as an enabler for simple yet effective frequency domain interference management schemes. In particular, the interference management is to provide the intervention made significant gains in heterogeneous networks, envisioning intrinsically uncoordinated deployments from the home base stations. Then, we compared the quality of service (QoS) performances of two different multi-user scheduling schemes in CA based LTE-A systems, separated random user scheduling (SRUS) and joint user scheduling (JUS). The former is simpler but less efficient, whereas the latter is optimal but with higher overheadsignaling. Moreover, only one single component carrier (CC) is required to access for user equipment (UE) in the case of SRUS, while all the CCs must be connected in the case of JUS. Some technical challenges for implementing carrier scheduling schemes technique in LTE-A systems, are discussed and highlighted.
منابع مشابه
Performance analysis on carrier scheduling schemes in the long-term evolution-advanced system with carrier aggregation
Carrier aggregation (CA) is one of the promising techniques for the further advancements of the third-generation (3G) long-term evolution (LTE) system, referred to as LTE-Advanced. When CA is applied, a well-designed carrier scheduling (CS) scheme is essential to the LTE-Advanced system. Joint user scheduling (JUS) and separated random user scheduling (SRUS) are two straightforward CS schemes. ...
متن کاملFair Joint User Scheduling Based on Best Cqi for Carrier Aggregation in Lte-advanced
Carrier Aggregation (CA) is one of the main features in Long Term Evolution– Advanced (LTE-A). CA allows the target peak data rates in excess of 1 Gbps in the downlink and 500 Mbps in the uplink to be achieved by aggregating multiple component carriers (CCs) of 20 MHz for each CC. When CA is being put to use, it is vital to complement LTE-A systems with a robust and suitable resource scheduling...
متن کاملTask Scheduling Algorithm Using Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in Cloud Computing
The cloud computing is considered as a computational model which provides the uses requests with resources upon any demand and needs.The need for planning the scheduling of the user's jobs has emerged as an important challenge in the field of cloud computing. It is mainly due to several reasons, including ever-increasing advancements of information technology and an increase of applications and...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کاملMulti-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect
This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance. First the problem is encoded with a...
متن کامل