Font Size: a A A

Research On Resource Scheduling Under Carrier Aggregation

Posted on:2015-08-04Degree:MasterType:Thesis
Country:ChinaCandidate:Q ChenFull Text:PDF
GTID:2308330473453221Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the development of mobile communication systems, people are in more and more urgent need of transmission speed, aggregation technology came into beingin this context.Carrier aggregation is an aggregation technique which can gather up a series of discrete bandwidth, then it will complete resource scheduling in this scenario. By this, it allows the user or the base station to obtain a wider bandwidth, and accordingly transmission rating will be raised. This lead to a question, how to achieve the centralized resource scheduling? Currently, there are two mainstream scheduling structures, one is Joint Queue Scheduling, and another is Disjoint Queue Scheduling. In this paper, we will discuss the resource scheduling under both these scheduling structures.Firstly, in this paper, the author did a survey about research status of the carrier aggregation technology. Then, the two kinds of scheduling structure as well as the classic resource schedulingalgorithm are introduced in the LTE-A system.Ialso analyze the performance of this algorithm. On this basis, taking various factors into account in the LTE-A system, such as carrier characteristics, user characteristics, type of loading, which to finish resource scheduling in the carrier aggregation.For non-union queue scheduler, two common scenes were analyzed. One is the LTE-A users only existed in the system, another is that the LTE-A users and the LTE users coexisted in the system. Under this scenario, we did a research about resource scheduling problem, and present a carrier selection algorithm based on weighting factors to achieving the first layer scheduling,and the use of existing second layer PF scheduling algorithm, to complete the whole resource scheduling process. Simulation results show that the proposed method has better performance than LL algorithm in this article.For joint queue scheduler, this article together QoS priority with the utility functions of business to complete resource allocation by use of the concept of utility.In the final,weproposed a tentative resource scheduling algorithm for resource scheduling to meet various QoS priority cases. Simulation results show that the proposed method can reasonably schedule system resources to meet the various requirements of QoS services in this article.On this premise,as far as possible to maximize business utility function to make full use of the resource. Finally, in the condition of limited resource, we use an optimal method to complete resource scheduling.
Keywords/Search Tags:Carrier Aggregation, Scheduling structure, Weighting factor, Utility function, QoS resource allocation, Tentative allocation of resources
PDF Full Text Request
Related items