HSDPA系统中分组调度算法研究

无线分组调度是保证无线传输业务服务质量的一个重要方面。本文研究了高速下行链路分组接入(HSDPA) 系统中适用的分组调度技术。讨论了Round Robin、Max C／I和Proportional Fairness三种调度算法,并通过计算机仿真,对其性能进行了分析、比较。结果表明,Proportional Fairness是一种适合于HSDPA系统的分组调度算法。     

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

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

一种基于队列线性等待的HSDPA分组调度算法

文中主要研究了适合TD-SCDMA增强技术HSDPA的分组调度算法,针对QoS要求不高的非实时业务的正比公平调度算法的比例关系,提出了一种适合非实时业务的简单的基于队列线性等待的HSDPA分组调度算法。通过仿真分析可知,该算法具有可行性,且比正比公平算法有着更好一些的性能。     

一种针对HSDPA中继系统的比例公平调度算法

由于系统在资源分配上的差异,现有的3GPP长期演进项目的后续演进(Long Term Evolution Advanced,LTE-A)中继系统中的调度算法并不能直接应用于高速下行链路分组接入(High Speed Downlink Packet Access,HSDPA)中继系统。提出了一种适合HSDPA中继系统的比例公平调度算法,并给出了算法流程。通过系统级仿真,比较了该算法与没有中继时的PF调度算法和两层比例公平(THPF)调度算法的性能。仿真结果表明,所提出的调度算法能够在提高用户吞吐率的同时更好地保证用户公平性要求。     

WCDMA系统中高速下行分组接入的接纳控制策略

高速下行分组接入(HSDPA)技术是WCDMA对于下行链路分组数据的增强,其分组数据的调度由基站(NodeB)中的MAC hs实体完成。在HSDPA的接纳控制中,数据业务的接纳控制由无线网络控制器(RNC)完成,其判决依据是当前资源的使用状况,这样就需要Node B能通过Iub接口向RNC提供详细的资源使用状况。通过针对HSDPA中流类业务、交互/后台类业务接纳控制的特点,分别从资源的分配、判别门限的设定等方面进行了分析和阐述,并给出了HSDPA中接纳控制的基本流程示意图。     

HSDPA中的分组调度算法

HSDPA系统采用了AMC、HARQ、快速调度等技术以支持有效的数据业务,因此对传统的调度算法提出了新的挑战,分组调度成为影响系统性能的一个重要因素.介绍了两种针对HSDPA系统的调度算法：自适应正比公平算法（APF）和M-LWDF算法,并简单分析了它们的性能.     

HSDPA中继系统实时业务调度算法研究

在传统的高速下行链路分组接入（HSDPA,HighSpeedDownlinkPacketAccess）系统中,对于实时业务的调度,主流算法是修正的最大加权时限优先（Modified—LargestWeightDeadlineFirst,M—LWDF）算法。但由于中继的引入,中继用户的延时增加必然会导致中继用户的丢包率增大,从而降低了系统的性能。基于此,本文提出了一种改进的M—LWDF算法,并通过VolP业务对该算法进行了仿真验证。结果表明该算法能够在保证用户QoS要求的前提下,提高系统吞吐量。     

WCDMA HSUPA技术中的Node B调度算法研究

HSUPA（High Speed Uplink Packet Access）是继HSDPA（High Speed Downlink Packet Access）后，WCDMA（Wideband Code Division Multiple Access）标准的又一次重要演进。阐述了HSUPA采用的三种主要技术之一的基于Node B（基站）的快速调度，讨论了HSUPA可以采用的几种分组调度算法，并对几种算法作了简要比较。     

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

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

分布式天线系统中的分组调度算法研究

文章研究了分布式天线系统中的分组调度算法,通过计算机仿真,模拟了轮询、最大载干比和正比公平调度算法在分布式天线系统下行信道中的吞吐量和时延性能,指出正比公平调度是一种适合于分布式天线系统的调度方法。     

Packet scheduling in 3.5G high-speed downlink packet access networks: breadth and depth

Forecasts for emerging mobile device markets anticipate that bandwidth will be squeezed by demanding applications like multimedia on demand. This will spur the need for data rates beyond what the upcoming 3G wireless cellular systems such as UMTS can offer. To boost the support for such high data rates, HSDPA, labeled as a 3.5G wireless system, has been introduced in Release 5 of UMTS technical specifications. HSDPA is a definite step toward meeting the "anywhere, anytime, and in any form" 4G communication concept. HSDPA promises a peak data rate of up to 10 Mb/s, five times larger than the data rate offered by 3G systems. In order to support such high data rates, HSDPA relies on many new technologies, among which is packet scheduling. In this article we provide breadth and depth related issues of packet scheduling in HSDPA, discuss state-of-the-art HSDPA scheduling algorithms in terms of their objectives, advantages, and limitations, and suggest further research issues that need to be addressed. In addition, we propose a packet scheduling algorithm for data traffic in HSDPA. Simulation results demonstrate the effectiveness of the proposed algorithm     

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

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

Ergodic capacity of multiuser scheduling in cognitive radio networks: analysis and comparison

This paper analyzes the ergodic capacity of secondary point‐to‐multipoint communications under the outage constraint of multiple primary user receivers (PU‐Rxs) and the secondary user (SU) maximum transmit power limit. We first derive analytical expressions of the ergodic capacity for three scheduling schemes, that is, round robin, Max‐signal‐to‐interference‐plus‐noise‐ratio (Max‐SINR) and Min‐SINR, and compare their performance. Numerical examples show that when the number of SU receivers (SU‐Rxs) increases in the presence of a single PU‐Rx and at high SINR, the Min‐SINR outperforms the Max‐SINR scheme. As the number of PU‐Rxs increases, the Max‐SINR performs better than the Min‐SINR scheduling. When the number of SU‐Rxs becomes large, the system capacity is enhanced but so is the feedback load. To exploit the Max‐SINR transmission while reducing the feedback load, we assume a threshold based on the channel quality where the SU‐Rxs with the instantaneous SINR above the threshold participate in the Max‐SINR scheduling; otherwise, an SU‐Rx is selected randomly. Then, an analytical expression of the average capacity is derived. Numerical results illustrate that the capacity with limited feedback is approximately the same as for the case of Max‐SINR with full feedback when the SU threshold for feedback condition is set to low and medium values. Copyright © 2016 John Wiley & Sons, Ltd.     

QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Achieving Max–Min lifetime and fairness with rate allocation for data aggregation in sensor networks

We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: (1) maximizing the minimum (Max–Min) lifetime of an aggregation cluster and (2) achieving fairness among all data sources. The two objectives are generally correlated with each other and usually, they cannot be maximized simultaneously. We adopt a lexicographic method to solve this multi-objective programming problem. First, we recursively induce the Max–Min lifetime for the aggregation cluster. Under the given Max–Min lifetime, we then formulate the problem of maximizing fairness as a convex optimization problem, and derive the optimal rate allocation strategy by iterations. We also present low-complexity algorithms that an aggregation cluster can use to determine the Max–Min network lifetime and the fair rate allocation. Our simulation results validate our analytical results and illustrate the effectiveness of the approach.     

基于TD-SCDMA的R4与HSDPA混合组网系统级性能研究

文章认为R4和高速下行数据接入(HSDPA)的混合组网方式是目前比较合理的组网方式,可以减少建设成本,并降低管理维护和优化的复杂度,是主流运营商倾向的组网方式。文章提出通过理论计算结合系统级仿真手段可以对基于TD-SCDMA的R4与HSDPA业务混合组网前后系统性能进行对比研究,并提出通过优化HSDPA业务信道发射功率、调度算法、无线资源管理(RRM)算法等多种手段可以提升混合组网后系统性能。