Uplink Scheduling in CDMA Packet-Data Systems

Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness of service among users, hence reducing chances of buffer overflows for poorly located users. The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time, and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement. Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users, and the strongly recieved users at the base as “strong” users. Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton, NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management and scheduling issues in telecommunication networks. Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S. from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University, all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering.     

Opportunistic Scheduling with QoS Constraints for Multiclass Services HSUPA System

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long‐term quality of service (QoS) constraints for non‐realtime data users and short‐term QoS constraints for realtime multimedia users in multiclass service high‐speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi‐constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.     

An Upper Bound on Air Interface Blocking Probability in Multiservice CDMA Networks

We propose a novel approach to derive an upper bound for the air interface blocking probability in a multiservice CDMA network with soft handoff (SHO) as a function of network load. This method requires only general assumptions made for network design and dimensioning. We obtain an approximated upper bound and compare it with the calculated values for the upper bound and with real network simulation results to show that our method with a reduced computational complexity is also accurate.     

多用户多服务无线网络中感知用户体验的比例公平调度

The effective radio resource allocation algorithms, which satisfy diversiform requirements of mobile multimedia services in wireless cellular networks, have recently attracted more and more attention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score (MOS) is chosen as the unified metric of the Quality of Experience (QoE). As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Proportional Fair (PF) principle is adopted to achieve the trade-off between the network performance and user fairness. Then, an integer programming problem is formed and the QoE-aware PF scheduling principle is derived by solving the relaxed problem. Simulation results show that the proposed scheduling principle can perform better in terms of user fairness than the previous principle maximizing the sum of MOS. It also outperforms the max-min scheduling principle in terms of average MOS.     

A New MAC Protocol Ensuring the Multimedia Traffic QoS for CDMA Networks

This paper describes the CDMAC, a new Medium Access Control (MAC)protocol for multimedia traffic in CDMA wireless networks. Theprotocol intends to extract the maximum capacity and flexibilityout of the CDMA scheme and at the same time guarantee the expectedQoS of different service types. CDMAC is able to maintain QoSrequirements thanks to the shaping, policing and trafficdifferentiation performed by the scheduler. Moreover, an iterativealgorithm, applied at the beginning of each frame, is used to findthe optimal power vector for all mobiles present in the system,which maximize the system capacity. The basic constraint of thecapacity maximization process is that the BER QoS of eachconnection should be fulfilled. Finally a distributedimplementation, feasible in a practical scenario, is presented.     

机会波束成形系统中一种新的调度方案

主要研究机会波束成形系统中的调度算法,将宽带无线IP网络调度算法应用于机会波束成形系统。提出了一个保证用户QoS要求的新方案。数值分析表明,所提的方案较之传统的方案在保证系统吞吐量和用户间公平性的同时,也保证了用户的QoS。     

移动自组织网络QoS研究

由于自组网独特的特性,在该网络中支持QoS非常困难,需要进行系统研究。本文首先分析了自组网中QoS支持面临的挑战,接着从系统角度出发,结合自组网的特点,在QoS模型和QoS支持体系以及体系中具体的QoS技术等方面对自组网QoS支持做了详尽的分析与探讨,同时指出：定义自组网QoS模型需要综合考虑应用需求和网络特性;实现QoS模型可以采用分层QoS支持体系或跨层QoS支持体系,而后者将是今后研究的重点;结合路由层、MAC层和物理层的跨层QoS支持体系具有研究价值。     

Opportunistic scheduling for multiclass services with different QoS constraints in wireless data networks

In this letter, we focus on the problem with the objective to maximize the system performance, while guaranteeing specified QoS constraints for multiple user classes in wireless data networks. First, we propose two opportunistic scheduling algorithms that exploit time-varying channel conditions for the special two-constraint case, and then propose an opportunistic scheduling algorithm for the general case. Simulation results illustrate that the proposed scheduling algorithms guarantee the different constraints, and achieve high-system performance that is close to the true optimal value using a known general-purpose optimization package, lingo.     

具有双层系统的分扇区CDMA小区上行链路容量

码分多址系统与传统的时分多址和频分多址系统相比,在各方面都具有优势,尤其是能提供更好的服务质量和更大容量,因而成为第三代移动通信系统的核心技术。通过在小区中划分扇区能进一步提升系统容量,在扇区中又引入双层系统,可以显著提高该扇区内容量。由于CDMA系统是噪声受限系统,因此以信干比为标准,分析具有双层系统的分扇区CDMA小区系统的上行链路容量。最后通过仿真结果证明了该系统上行链路容量相对普通小区系统上行链路容量的提升。     

无线数据网络中机会调度理论模型的研究

机会通信作为一种对无线通信系统设计具有革命性意义的概念正在受到越来越多的关注.目前对机会调度算法的研究往往采用不同的模型进行性能评价,使得不同算法之间很难直接进行性能比较.本文主要将各种用于机会调度算法研究的理论模型进行分类和比较,对几种典型的机会调度算法在各类理论模型下的性能评价指标、方法和结果进行讨论,最后探讨了该领域未来的发展趋势并给出了一些有待研究的方向.     

BM-VF-SBD:一种支持QoS的光突发交换数据信道调度算法

在光突发交换(OBS)网络中,数据信道的调度算法是一个关键问题。然而,当前的调度算法大多只强调带宽利用效率,而忽略了QoS支持。该文提出了一个算法BM-VF-SBD,其基本思想为：若所有信道上没有一个Void能容纳新突发,则搬移一些突发到别的信道后,再为新突发分配信道资源;若还失败,则再选择性地丢弃一些低优先级的突发,重复前面操作,它是利用BM,VF和SBD 3种机制减少带宽碎片,支持QoS。若以平衡二叉树组织Void和突发相关信息,它的计算复杂度与LAUC-VF和ODBR接近,小于O((2w+1)log w)。仿真表明它在带宽碎片率和突发损失率(包括总的和各个优先级的)上优于LAUC-VF和ODBR。     

宽带CDMA IP网中实现区分服务的QoS结构

3G CDMA网提供高速无线IP服务,其业务主要包括数据、语音互式多媒体。为了能保证这些异构业务的QoS,并提供业务区分,将有线IP网的分区服务（DIFFSERV）QoS模型引入3G CDMA网络。针对无线网络的终端移动性、高丢失率、更低的网络带宽等特点,对原有的DIFFSERV结构进行了修改,给出了基于DIFFSERV的无线QoS结构,并简单描述了实现协议。还给出了有效带宽的录入控制策略和资源预留策略来实现QoS。通过仿真,研究了各种策略的性能。     

A Packet Scheduling Approach to QoS Support in Multihop Wireless Networks

Providing packet-level quality of service (QoS) is critical to support both rate-sensitive and delay-sensitive applications in bandwidth-constrained, shared-channel, multihop wireless networks. Packet scheduling has been a very popular paradigm to ensure minimum throughput and bounded delay access for packet flows. This work describes a packet scheduling approach to QoS provisioning in multihop wireless networks. Besides minimum throughput and delay bounds for each flow, our scheduling disciplines seek to achieve fair and maximum allocation of the shared wireless channel bandwidth. However, these two criteria can potentially be in conflict in a generic-topology multihop wireless network where a single logical channel is shared among multiple contending flows and spatial reuse of the channel bandwidth is possible. In this paper, we propose a new scheduling model that addresses this conflict. The main results of this paper are the following: (a) a two-tier service model that provides a minimum fair allocation of the channel bandwidth for each packet flow and additionally maximizes spatial reuse of bandwidth, (b) an ideal centralized packet scheduling algorithm that realizes the above service model, and (c) a practical distributed backoff-based channel contention mechanism that approximates the ideal service within the framework of the CSMA/CA protocol.     

CDMA移动网重点业务保障方案研究

重点业务保障方案作为中国电信移动网智能管道提供的应用场景,可以对自营业务与第三方合作CP/SP业务进行差异化QoS保障,也可结合PCC技术,实现用户、业务、网络流量的多维度智能管控与调度.对重点业务保障的关键技术与部署方案进行深入分析与研究,提出了满足中国电信cdma2000 1x Ev-Do移动网现网需求的重点业务保障方案.     

一种改善IP网络中基于类的数据服务QoS的调度方法

IP网络中基于类的数据服务QoS支持一般包括包的延时、吞吐量和丢失率,目前的研究成果大都集中于对其中某一个指标的确保或支持。该文提出一种在IP网络中一个网络路由器节点上同时考虑类间流量带宽、包丢失和延时区分的队列管理调度算法,称为动态比例自适应算法(Dynamic Proportional Adaptive Algorithm,DPAA)。该算法是针对比例区分服务PDS(Proportional Differentiated Services)中流量负载频繁变化的情况提出的。仿真实验通过与前人提出的基于比例区分服务模型的调度算法比较,证明了DPAA 算法的有效性。     

面向带宽碎片最小化和QoS保障的数据中心网络流量调度算法

随着数据中心网络流量的迅速增长,如何提高数据中心网络性能和服务质量成为了研究热点。然而现有的流量调度算法在网络负载加大时,一方面会导致网络带宽碎片化从而使得网络吞吐量降低,另一方面忽视了流量应用需求导致网络服务质量较差。为此,该文提出一种面向带宽碎片最小化和QoS保障的动态流量调度算法,算法综合考虑了带宽敏感的大流、时延与丢包敏感的小流的不同需求,首先根据待调度流的源地址和目的地址建立最短路径集,其次从中筛选出满足待调度流的带宽需求的所有路径,然后根据路径剩余带宽信息和小流应用需求情况为每条路径建立权重函数,最后根据权重函数值利用轮盘赌算法选择转发路径。实验仿真结果显示,与其它算法相比,所提算法降低了小流的丢包率和时延,同时在网络负载较大时提升了网络吞吐量。

     

A Distributed Packet Scheduling Scheme with Interference Avoidance for Non Real-Time Applications in CDMA Networks

In this paper, a packet scheduling scheme based on real-time channel conditions and dominant intercell interferer avoidance is proposed, studied and evaluated for reverse links in a time-slotted code division multiple access (CDMA) system. This scheme is implemented by distribution of tags by receivers among transmitters. Each base station issues M(1) tags to M mobile users based on the ranked reverse link gains in every slot. M=1 corresponds to spread-spectrum time division multiplexing mode operation and M1 corresponds to scheduling multiple simultaneous transmissions as in the traditional CDMA systems. The number of issued tags is a system parameter which depends on the expected traffic, the number of cells and the propagation conditions in the network. In the proposed scheme, users who not only have stronger channel gains to their respective home base stations but also cause relatively lower intercell interference are scheduled for transmissions. Different classes of tags can be issued and various scheduling decision rules can be implemented giving flexibility in interference management. Simulation results in shadow and multipath fading environment are presented to show the performance advantage of the proposed scheme.     

Effects of Array Weight Errors on Parallel Interference Cancellation Receiver in Uplink Synchronous and Asynchronous DS‐CDMA Systems

This paper investigates the impacts of array weight errors (AWE) in an antenna array (AA) on a parallel interference cancellation (PIC) receiver in uplink synchronous and asynchronous direct sequence code division multiple access (DS‐CDMA) systems. The performance degradation due to an AWE, which is approximated by a Gaussian distributed random variable, is estimated as a function of the variance of the AWE. Theoretical analysis, confirmed by simulation, demonstrates the tradeoffs encountered between system parameters such as the number of antennas and the variance of the AWE in terms of the achievable average bit error rate and the user capacity. Numerical results show that the performance of the PIC with the AA in the DS‐CDMA uplink is sensitive to the AWE. However, either a larger number of antennas or uplink synchronous transmissions have the potential of reducing the overall sensitivity, and thus improving its performance.