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.     

CDMA网络规划的上行功率迭代算法

该文提出了一种用于CDMA网络规划的的上行功率迭代算法。在迭代的过程中,移动台根据各个基站的负载情况,动态地选择所连接的基站,使发射功率最小,最终使移动台的发射功率和基站处的干扰功率收敛。对算法的收敛性给出了理论分析,仿真结果验证了理论分析的正确性。该算法便于计算机实现,可用于实际的网络规划。     

一种跨层设计的WiMAX上行链路调度算法

本文研究了WiMAX系统PMP(point to multi-point)模式下的调度算法,并综合考虑MAC层的队列状况/物理层的信道条件以及业务流的QoS要求,跨层设计了一种能够动态适应调制编码方案和信道干扰的上行链路调度算法--DMIA(dynamic MCS and intederence aware scheduling algorithm),最后利用NS2建模仿真,结果表明,与RR、WRR以及PQ+PF算法相比,本文提出的算法具有更高的吞吐量,更小的时延、时延抖动和丢包率,能满足各类业务的QoS要求.     

LTE系统上行链路调度算法研究

长期演进(Long Term Evolution,LTE)已经成为4G无线技术标准。目前,LTE分组调度的下行链路调度被大多数研究者研究,上行链路的研究相对较少。针对上行链路调度无法保证实时业务分组在延迟期限内传输,存在公平性较差、分组丢弃多的问题。因此,提出了一种新的上行链路调度算法。该算法根据实时业务的延迟约束条件建立目标整数线性规划模型,再根据目标整数线性规划模型进行调度。实验结果表明,该算法能保证实时业务分组在延迟期限内传输,适用于实时业务,能确保公平性,最小化分组丢弃,具有较好的适用性。     

Multichannel Estimation and Equalization Algorithm for Asynchronous Uplink DS/CDMA

This paper addresses the problem of channel estimation andequalization in asynchronous uplink DS/CDMA. We propose a completereceiver structure which contains a multichannel estimator suitablefor time-varying channels, a MMSE equalizer and a propagation delayestimator. The multichannel estimator is a stochastic gradientalgorithm which does not require any knowledge about the propagationdelays. It estimates a matrix which contains a linear combination ofthe impulse response of each channel and the propagation delays. Thisestimate is used to derive a MMSE equalizer. In the despreading stageknowledge on the integer part (chip period multiple) of thepropagation delays is needed. Two reduced complexity schemes forpropagation delay estimation are presented. The channel estimatorconvergence is studied in stationary conditions while the overallalgorithm performance is demonstrated by using simulations intime-varying channel conditions.     

A Weight-Based Resource Scheduling Algorithm for Uplink LTE-A Femtocell Network

Wireless Personal Communications - SC-FDMA is the most suitable option for the LTE-A uplink. Contiguity plagiarism characteristics are required for optimum channel scheduling in an SC-FDMA system....     

基于传输块调度的WCDMA上行负荷控制算法

在WCDMA系统中,小区的无线资源管理通常是在无线网络控制器(RNC)节点内完成.然而,专用传输信道上传输格式可以逐帧改变,基于传输格式的快速变化实际上构成一种无线资源控制能力。这种控制能力是由UE和Node B的MAC实体以及物理层协同完成的,完全不需要三层信令参与。该文根据WCDMA专用传输信道传输格式的快速变化能力,结合基于类的QoS策略,针对上行信道提出一种负荷控制算法,用以支持全分组业务。研究结果表明,在多业务环境下,各个用户能公平共享无线资源、同时能够实现实时业务时延保证。     

Traffic Aided Uplink Opportunistic Scheduling with QoS Support in Multiservice CDMA Networks

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real‐time (RT) and non‐realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross‐layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.     

CDMA多小区上行接纳控制

提出了一种在CDMA系统中基于多小区负荷因子增长估计的上行接纳控制算法。在新呼叫到达时,不仅考虑接纳小区的负荷因子增长,同时考虑相邻小区的负荷因子增长,通过理论分析给出了相邻小区负荷因子增长估计的方法。仿真结果表明,基于多小区负荷因子增长估计的接纳控制算法比基于单小区的接纳控制算法能更有效地提高判决精度,降低错误接纳概率和中断概率,保证已连接用户的QoS要求。     

Uplink Connection Scheduling for Flat-Rate Data Services in the UMTS Network

To attract more users to mobile packet services, universal mobile telecommunication system (UMTS) operators have been prompting flat-rate packet services. Since usage does not incur cost, flat-rate users tend to stay online longer and occupy most of the radio channel resources. We consider a UMTS network serving two types of user connections: normal user connections (NUCs) and flat-rate user connections (FRUCs). Our goal is to maximize the revenue of the operator by giving a priority to NUCs over FRUCs without discontenting the flat-rate users, in order not to lose the flat-rate users to other operators. Uplink FRUCs may be asked to subrate or suspend transmission when the radio network is fully utilized. Four combinations of scheduling techniques, including queueing, guard channels (GCs), preemption, and rate adaptation, have been studied, and analytic models using Markov processes were used to evaluate their performances. We proposed a cost function representing the revenue loss due to both blocked NUCs and lost flat-rate users. The system parameters used in our analysis are based on realistic operation data. Our analytic results indicate that the revenue loss can be minimized by using waiting queues (WQs) and preemption. Rate adaptation is ineffective in minimizing the revenue loss because subrated connections are less efficient in using the radio spectrum. GCs for NUCs are unnecessary when a WQ or preemption is used. This paper may be valuable for UMTS operators in serving flat-rate users.      

IEEE 802.16d上行链路调度服务优化算法

调度算法是宽带无线接入系统为分类业务提供QoS保证的重要手段和工具。本文提出一种用于IEEE802.16d宽带无线接入系统TDD模式下的跨层调度服务的改进算法I_DFPQ。仿真结果表明该算法在各个类型业务流的吞吐量、时延、丢包率和公平性方面相比于同类的其他算法具有更优的性能。     

基于强化学习的802.11ax上行链路调度算法

随着物联网(IoT)时代的到来,无线网络饱和的问题已经越来越严重。为了克服终端密集接入问题,IEEE标准协会(IEEE-SA)制定了无线局域网的最新标准—IEEE 802.11ax。该标准使用正交频分多址(OFDMA)技术对无线信道资源进行了更细致的划分,划分出的子信道被称为资源单元(RU)。为解决密集用户环境下802.11ax 上行链路的信道资源调度问题,该文提出一种基于强化学习的RU调度算法。该算法使用演员-评论家(Actor-Critic)算法训练指针网络,解决了自适应RU调度问题,最终合理分配RU资源给各用户,兼具优先级和公平性的保障。仿真结果表明,该调度算法在IEEE 802.11ax上行链路中比传统的调度方式更有效,具有较强的泛化能力,适合应用在密集用户环境下的物联网场景中。     

TCP-Aware Uplink Scheduling for IEEE 802.16

In IEEE 802.16 networks, a bandwidth request-grant mechanism is used to accommodate various QoS requirements of heterogeneous traffic. However, it may not be effective for TCP flows since (a) there is no strict QoS requirement in TCP traffic; and (b) it is difficult to estimate the amount of required bandwidth due to dynamic changes of the sending rate. In this letter, we propose a new uplink scheduling scheme for best-effort TCP traffic in IEEE 802.16 networks. The proposed scheme does not need any bandwidth request process for allocation. Instead, it estimates the amount of bandwidth required for a flow based on its current sending rate. Through simulation, we show that the proposed scheme is effective to allocate bandwidth for TCP flows     

智能天线对CDMA系统上行链路的影响

智能天线技术将信号处理由空域、时域、码域扩展到了空域，它已成为第3代移动通信系统的关键技术之一。本文结合IS－95和cdma2000系统的特点，仿真并分析智能天线对CDMA系统上行链路性能的影响。     

Framework for Analysis of Transmission Rate Scheduling for Wireless CDMA Data Networks

The optimal utilization of network resources and the capacity to fulfill quality of service requirements are key requirements for 3rd G networks operations. Several burst admission and transmission rate scheduling algorithms are proposed in the literature. In this study, we develop an analytical framework for the downlink transmission rate scheduling problem for CDMA networks employing discrete service bit rates. The framework uses the average downlink transmit power as the system state and develops a K-dimensional Markov chain representing all possible states in the system. In addition, the transition probabilities due to arrivals of burst requests are made a function of the power utilization and the average power required to support the new burst taking into account the path loss model. The study assumes a transmission rate assignment scheme where the maximum possible system bit rate is assigned given the current system state and the subscriber’s eligibility profile for particular system service rates. The analytical model provides performance metrics such as system throughput, average power utilization, average number of simultaneous transmissions, burst request blocking probability, and mean burst service time. While the developed model is applicable for a general CDMA based network with arbitrary discrete system service bit rates, the model is evaluated for the example of a cdma2000 1xRTT network. A comparison between simulation and analytic results to assess the accuracy of the model is provided.

长码CDMA系统上行链路多用户接收机设计

提出一种适用于长码CDMA移动通信系统上行链路的多用户接收机设计方案，包括多用户信道估计、多用户检测以及信道跟踪等算法。通过把用户传播时延的影响放入信道响应矩阵中，由信道估计间接得出各用户的传播时延。使用迭代运算的方式使得运算量分散，降低了对硬件平台的要求，使算法更为适用。增大观察窗的长度达到了更准确的用户信息比特判决，提高了接收机的性能。仿真结果表明文章提出的接收机设计方案具有很好的远近效应抑制能力，性能远高于传统的单用户Rake接收机。     

On Admission Control and Scheduling of Multimedia Burst Data for CDMA Systems

In order to support transmissions of multimedia data (high data rate and burst) with performance guarantees in a wideband CDMA system, it is crucial to design a judicious algorithm for burst data admission control and scheduling. However, in the current literature there are only simple techniques (such as first-come-first-served and equal sharing) suggested for tackling the problem. Indeed, these existing schemes are not designed for optimizing the precious bandwidth resources while providing performance guarantees (e.g., a user admitted with a certain data rate can enjoy the assigned rate without interruption). In this paper, we first present our novel integer programming formulation of the burst data admission control and scheduling problem. The objective of the optimization can be maximizing the utilization of the bandwidth resources or minimizing the delays of the user transmissions. Taking into account all the important factors such as mobility, power control, and soft handoff, our formulation induces an algorithm for generating an optimal admission control solution which consists of: (1) the burst data rate (in terms of the number of channels); (2) the burst duration; and (3) the burst start time. For practical implementation, we also suggest a near-optimal version of the algorithm, which is evaluated via static and dynamic simulations, and comparisons with two existing schemes.     

WiMax终端上行调度算法的研究与设计

在对WiMax终端的不同业务类型调度算法进行分析的基础上,提出了一种有效的上行调度算法实现策略.与传统的基于严格优先级的调度算法相比,本算法在保证各业务QoS参数的基础上,提高了不同业务之间的公平性,使优先级较低的业务也可以获得相应的调度机会.     

Uplink load in CDMA cellular radio systems

Well-operating resource-management algorithms are crucial in wireless networks for ensuring the quality of service and, perhaps more importantly, for securing stability when operating at high load. These algorithms benefit from accurate feedback of the current network load. In the uplink of a code-division-multiple-access cellular network, the load is strongly related to the uplink noise rise, i.e., the ratio between total received power and background-noise power. This paper is primarily concerned with characterizing and approximating the uplink load. Two different load definitions are made. These relate to the received and transmitted carrier powers, respectively. Bounds that can be established in practice, e.g., before a resource decision is made, are used to develop a procedure for approximating the uplink load in practice. Furthermore, a stochastic approach to link budgets is used to establish the uplink load's role in the tradeoff between coverage and individual user satisfaction. Simulations indicate that the average error of the proposed load approximations is small for all load levels expected to appear in practice.