载波聚合下的资源调度研究

发布时间：2018-04-20 09:42

本文选题：载波聚合 + 调度结构　；参考：《电子科技大学》2014年硕士论文

【摘要】：随着移动通信系统的发展,人们对速度的需求越来越快,在这种背景载波聚合技术下应运而生。载波聚合是一种将离散的带宽聚集起来,然后集中进行分配的技术,它能让用户或者基站获得更宽的传输带宽,从而相应的提升传输速率。对于集中起来的资源如何实现调度,出现了两种主流的调度结构,即非联合队列调度器与联合队列调度器。本文将分别讨论这两种调度结构下的资源调度。本文首先对载波聚合技术的研究现状做了调研,并对LTE-A系统中的两种调度结构以及经典的资源调度算法进行了介绍,并进行性能分析与比较。在此基础上再结合LTE-A系统中载波特性,用户特性,业务类型等影响因素,从而综合多方面影响因素进行载波聚合下的资源调度。对于非联合队列调度器,本文针对系统中只有LTE-A用户以及系统中同时存在LTE-A、LTE用户时的资源调度问题进行了分析与研究,提出了一种基于权重因子的载波选择算法实现第一层调度,并利用现有的第二层PF算法调度,从而完成资源的整个调度过程。仿真结果显示本文所提出的基于权重因子的载波选择算法比LL算法有更好的性能。对于联合队列调度器,本文将QoS业务类型优先级与效用函数结合在一起,运用效用的理念进行资源分配。最终在满足各个QoS优先级的情况下,提出一种尝试性资源分配算法对资源进行分配,完成资源的调度过程。仿真结果显示,本文提出的尝试性资源分配算法,可以合理分配系统资源以满足各类QoS业务优先级需求在。此前提下尽可能最大化业务效用函数,使资源尽可能获得充分利用。最终在有限资源的条件下,最优利用资源实现调度。
[Abstract]:With the development of mobile communication system, the demand for speed is getting faster and faster. Carrier aggregation is a technique that aggregates discrete bandwidth and then distributes it centrally. It enables users or base stations to obtain wider transmission bandwidth and thus increases the transmission rate accordingly. There are two main scheduling structures for centralized resources, that is, unfederated queue scheduler and federated queue scheduler. In this paper, we will discuss the resource scheduling under these two scheduling structures. In this paper, the research status of carrier aggregation technology is investigated, and two scheduling structures and classical resource scheduling algorithms in LTE-A system are introduced, and the performance analysis and comparison are carried out. On this basis, combined with the carrier characteristics, user characteristics, service types and other influencing factors in LTE-A system, the resource scheduling under carrier aggregation can be carried out by synthesizing many factors. For the unfederated queue scheduler, this paper analyzes and studies the resource scheduling problem when there are only LTE-A users in the system and LTE-An LTE users in the system at the same time. A carrier selection algorithm based on weight factor is proposed to implement the first layer scheduling, and the existing second layer PF algorithm is used to complete the whole scheduling process of the resource. Simulation results show that the proposed carrier selection algorithm based on weight factor has better performance than LL algorithm. For the federated queue scheduler, this paper combines the QoS service type priority with the utility function, and applies the idea of utility to resource allocation. Finally, under the condition that each QoS priority is satisfied, a tentative resource allocation algorithm is proposed to complete the resource scheduling process. Simulation results show that the proposed tentative resource allocation algorithm can reasonably allocate system resources to meet the priority requirements of various QoS services. Under this premise, the utility function of business is maximized as far as possible, so that the resources can be fully utilized as much as possible. Finally, under the condition of limited resources, the optimal use of resources to achieve scheduling.
【学位授予单位】：电子科技大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN929.5

【相似文献】