基于HSDPA的信道相关分组调度算法研究

针对HSDPA(高速下行分组接入)系统中几种支持非实时业务的经典分组调度算法Max C/I(最大载干比)和PF(正比公平)算法缺乏系统公平性的问题,提出一种基于HSDPA的快速公平分组调度算法。此算法在保证信道瞬时条件和系统吞吐量的前提下,旨在为那些平均吞吐量低于某一阈值的用户提供优先被服务的机会。仿真结果表明,此算法较之Max C/I和PF算法能够保证用户间的长期公平性。     

一种HSDPA系统中依赖负载的正比公平调度算法

研究和仿真了HSDPA系统中分组调度算法(RR,Max C/I和PF)的系统吞吐量和用户公平性,仿真结果与理论分析表明在HSDPA系统中RR算法调度结果的公平性略逊于PF算法.为了补偿正比公平调度算法公平性,提出了依赖负载的正比公平(LDPF)调度算法.该算法旨在通过低负载时牺牲系统吞吐量换取用户间公平性.然后用扩展了爱立信EUPLANE模块的NS2网络仿真软件对LDPF算法进行了仿真.仿真结果表明LDPF调度算法在系统低负载时有效地补偿了先前的低速率用户,通过这种低负载和高负载时的时间分集,改善用户间的长时公平性.     

前向分组数据业务中重传分组优先权的研究

该文研究了前向分组数据业务中应用的调度算法,在对常见的几种调度算法分析之后,提出一种新的调度算法。从理论和仿真两方面的性能分析显示,该算法通过适当改变重传分组的优先权,在保证满足公平性准则的前提下,提高了系统吞吐量,降低了平均分组时延,改善了分组时延分布。     

TD-LTE系统无线资源调度算法研究及性能分析

文章介绍了TD-LTE无线资源调度算法,包括轮询算法(Round Robin)、最大吞吐量算法(MaxTP)和比例公平算法(PF)等,并通过搭建的仿真平台仿真这几种算法的吞吐量及公平性,分析和比较各自的性能。     

HSDPA中支持实时业务的调度算法在吞吐量方面的仿真分析

随着移动通信技术的飞速发展,未来的移动通信系统将以数据业务为主,所以无线分组调度算法将成为影响系统性能和保证用户服务质量的关键所在。在HSDPA系统中无线资源管理是通过分组调度算法来实现的。理想的调度算法应满足各类业务的QoS要求和用户之间的公平性,使系统资源利用率达到最大。主要介绍了EXP算法和M-LWDF算法,并对两种算法在吞吐量方面进行了仿真分析,说明了M-LWDF算法具有更高的吞吐量。     

cdma2000 1x EV-DV前向系统中一种改进的调度算法

在分析cdma2000 1x EV-DV前向系统三种分组调度算法的基础上,提出了一种基于用户载干比分布的改进调度算法,并通过计算机仿真对各种调度算法进行了比较.仿真结果表明,该调度算法可以获得系统吞吐量和用户公平性间良好的折衷效果.     

HSDPA分组调度算法与小区吞吐率研究

分组调度是HSDPA的核心技术之一,对网络性能有重要影响。在HSDPA分组调度功能和实现的基础上,重点分析对比3种典型分组调度算法原理及其对系统的影响,并通过实际测试验证,明确了不同调度算法对小区吞吐率的影响。结论:MAXCI算法下能够得到最大的系统吞吐量,公平性最差;RR算法公平性最好,系统资源利用率最低,吞吐率最小;EPF算法既考虑了用户的公平性,也能从一定程度上保证比较高的系统吞吐量,是一种实用的调度方法。     

一种新型的OFDMA系统调度算法

近年来正交频分多址接入（OFDMA,Orthogonal Frequency Division Multiplexing Access）技术在无线通信中的应用越来越广泛。针对OFDMA系统中的资源调度问题,介绍和分析了OFDMA系统中常见的分组调度算法-轮询算法、最大载干比算法和比例公平算法,并且提出了一种结合了遗传搜索的自适应调度算法。最后在此基础上对这四种分组调度算法进行了仿真和分析,仿真结果表明,不管是系统吞吐量还是公平性,自适应调度算法都有较好的性能提升。     

改进的正比公平调度算法

3GPP从R6版本开始,开展了对高速上行分组接入(HSUPA)技术的研究和标准制定工作。基于基站(NodeB)的调度算法是HSUPA的三大技术之一,对它的研究能有效地改善HSUPA系统性能,使系统的上行资源得以更充分的利用。在简述HSUPA中基于NodeB的典型调度算法的基础上,它针对用户的公平性给出了三种改进的正比公平调度算法,并在吞吐量和公平性上与典型调度算法进行仿真对比,仿真验证了当各个信道的衰落特性差别很大时,与正比公平调度算法相比,改进的正比公平调度算法有效地提高了用户的公平度,改善了系统性能。     

基于非正交多址接入系统的多用户分组优化算法

用户分组算法作为非正交多址接入(NOMA)的关键部分,对系统吞吐量和用户公平性具有重要影响。当用户数量和可用的资源增加时,用户分组的最佳调度将变得不可行,该文提出一种子带间多用户分组优化算法。该算法首先根据用户信道增益差异和子带复用用户数限制条件进行多用户初始分组处理,减小用户搜索空间,然后逐步完成初始分组用户间的优化组合,以几何平均用户吞吐量最大为用户分组准则,进一步提升小区边缘用户的吞吐量。仿真结果表明,所提算法与传统的用户分组算法相比,系统总吞吐量和几何平均用户吞吐量性能提升均超过3%。     

HSDPA中M-LWDF实时业务分组调度算法的改进

HSDPA是UMTS的最新演进。HSDPA采用先进的技术包括AMC、HARQ和快速小区选择以提供更高的数据速率。在HSDPA系统中,无线资源管理功能主要是由分组调度算法来实现,研究先进的分组调度算法是提高数据业务吞吐量、保证用户间的公平性、满足业务QoS的根本。主要介绍了实时业务算法M-LWDF,针对其在公平性方面的缺陷进行了改进,并对上述2种算法在中断率和吞吐量上进行了试验分析。     

基于HTTP业务的TD-SCDMA系统仿真模型

文中建立了TD-SCDMA系统仿真平台.首先,给出了动态系统仿真的方案;然后,详细介绍了仿真平台的各个模块;最后,对三种典型的分组调度算法进行了仿真研究,从理论和仿真两方面对三种典型调度算法的系统吞吐量性能和用户公平性性能进行了分析和比较.     

一种适用于宽带无线城域网实时业务的分组调度算法

对宽带无线城域网（WMAN）而言,分组调度算法是保证用户服务质量（QoS）、平衡用户间公平性的关键。在研究比例公平调度算法（PF）算法与修正的最大加权时延优先算法（M-LWDF）的基础上,一种新的适用于宽带无线城域网实时业务的分组调度算法被提出,此算法引入了新的衡量服务队列负载的信息,能够实时地更新状态参数,提高了系统性能。仿真结果表明,此算法在保证系统吞吐量的同时,比M-LWDF算法具有更好的时延特性和公平性。     

CDMA2000 1xEV-DO中的分组调度算法

移动通信系统需要更好地支持分组数据业务，并满足高速分组数据业务的服务质置要求。这可以通过采用好的调度算法提高平均业务速率和系统整体稳定性实现。针对CDMA2000 1x EV-DO系统的有代表性的调度算法有3种：正比公平算法、速率受限的最大载干比算法、加权公平排队-正比公平（WFQ-PF）联合算法。正比公平调度算法是一种算法简单实用的调度方案，但不能满足用户的服务质景保证；速率受限的最大载干比算法具有比正比公平算法更高的平均吞吐量，可方便地在吞吐量和公平性之间获得很好的折衷；WFQ-PF联合算法具有良好的综合性能，但算法较复杂。     

Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels

For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data rate vector such that the expected rate vector over all fading states is proportional to the current queue state vector and is on the boundary of the ergodic capacity region of a fading BC. Utilizing the degradedness of BC for each fading state, QPS is formulated as a geometric program that can be solved with efficient algorithms. The GP formulation of QPS is also extended to orthogonal frequency-division multiplexing (OFDM) systems in a fading BC. The throughput optimality of QPS is proved, and it is shown that QPS can arbitrarily scale the ratio of each user's average queueing delay. Throughput, delay, and fairness properties of QPS are numerically evaluated in a fading BC and compared with other scheduling policies such as the well-known maximum weight matching scheduling (MWMS). Simulation results for Poisson packet arrivals and exponentially distributed packet lengths demonstrate that compared with MWMS, QPS provides a significant decrease in average queueing delay and has more desirable fairness properties.     

Scheduling schemes for multimedia service in wireless OFDM systems

Scheduling schemes play a key role in the system performance of broadband wireless systems such as WLANs/WMANs. Maximal SNR and round robin are two conventional scheduling strategies that emphasize efficiency and fairness, respectively. The proportional fair scheme provides a trade-off between efficiency and fairness, and has been well studied in TDMA and CDMA systems. In this article we extended the PF scheduling scheme to OFDM-based BWSs (OPF). In addition, we propose three variations: adaptive OPF (AOPF), multimedia AOPF (MAOPF), and normalized MAOPF (NMAOPF) in order to meet the QoS requirements for multirate services in multimedia systems. The adaptive modulation and coding schemes in time varying and frequency selective fading are considered. The system performances of the algorithms are compared in terms of efficiency (throughput and mean packet delay) and fairness (user satisfaction rate and average user rate). Joint physical and media access control layer simulation results show that AOPF and MAOPF can improve throughput at the cost of fairness, and NMAOPF can provide the highest throughput without losing fairness.     

A Low-Complexity QoS-Aware Proportional Fair Multicarrier Scheduling Algorithm for OFDM Systems

Orthogonal frequency-division multiplexing (OFDM) systems are the major cellular platforms for supporting ubiquitous high-speed mobile applications. However, a number of research challenges remain to be tackled. One of the most important challenges is the design of a judicious packet scheduler that will make efficient use of the spectrum bandwidth. Due to the multicarrier nature of the OFDM systems, the applicability and performance of traditional wireless packet-scheduling algorithms, which are usually designed for single-carrier systems, are largely unknown. In this paper, we propose a new quality-of-service (QoS)-aware proportional fairness (QPF) packet-scheduling policy with low complexity for the downlink of multiuser OFDM systems to allocate radio resources among users. Our proposed algorithm is based on a cross-layer design in that the scheduler is aware of both the channel (i.e., physical layer) and the queue state (i.e., data link layer) information to achieve proportional fairness while maximizing each user's packet-level QoS performance. The simulation results show that the proposed QPF algorithm is efficient in terms of average system throughput, packet-dropping probability, and packet delay, while maintaining adequate fairness among users with relatively low scheduling overhead.