Wireless Packet Scheduling Algorithm for OFDMA System Based on Time‐Utility and Channel State

In this paper, we propose an urgency‐ and efficiencybased wireless packet scheduling (UEPS) algorithm that is able to schedule real‐time (RT) and non‐real‐time (NRT) traffics at the same time while supporting multiple users simultaneously at any given scheduling time instant. The UEPS algorithm is designed to support wireless downlink packet scheduling in an orthogonal frequency division multiple access (OFDMA) system, which is a strong candidate as a wireless access method for the next generation of wireless communications. The UEPS algorithm uses the time‐utility function as a scheduling urgency factor and the relative status of the current channel to the average channel status as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics while satisfying quality‐of‐service (QoS) requirements of RT traffics. The simulation study shows that the UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modifiedlargest weighted delay first (M‐LWDF), while satisfying the QoS requirements of RT traffics such as average delay and packet loss rate under various traffic loads.     

A novel scheduling scheme for multiple traffic classes

In this paper, a novel scheduling scheme is proposed for multiple traffic classes to exploit multiuser diversity of the non-real-time (NRT) traffic. The proposed scheduling algorithm consists of two stages, i.e. at the first scheduling stage, the inter-traffic scheduler dynamically allocates the bandwidth resources to each traffic class by a periodic and triggered way with the objective of maximizing a room for NRT traffic while guaranteeing the quality of service (QoS) requirements of real-time (RT) traffics; at the second scheduling stage, the intra-traffic scheduler is used to schedule different users' packets within each traffic class simultaneously. The proposed algorithm not only enhances the system throughput but also satisfies the QoS requirements of RT traffic. Simulation results validate the effectiveness and good performance of the proposed scheme.     

蜂窝网络中全双工D2D通信功率控制

在蜂窝网络中,采用全双工传输的设备直通(D2D)通信可以共享蜂窝通信的信道资源,提升频谱利用率和系统吞吐量.针对单对全双工D2D用户复用单个蜂窝用户的上行信道资源时,用户之间会产生同频干扰的问题,提出了一种低复杂度的功率控制算法.该算法在保证全双工D2D用户和蜂窝用户(CU)的服务质量(QoS)的前提下,最大化全双工D2D链路的吞吐量.仿真结果表明,该算法能够提高全双工D2D链路的吞吐量;全双工D2D链路吞吐量取决于蜂窝用户的QoS要求、相对距离以及自干扰消除数量的限制.     

Cross layer scheduling for real-time traffic in multiuser MIMO-OFDMA systems

A novel cross layer scheduling algorithm is proposed for real-time (RT) traffic in multiuser downlink multiple-input multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) wireless systems. The algorithm dynamically allocates resources in space, time and frequency domain based on channel state information (CSI), users' quality of service (QoS) requirements and queue state information (QSI). To provide higher data rate and spectrum efficiency, adaptive modulation and coding (AMC) is employed. The proposed algorithm can improve cell throughput and increase the number of users that can be supported while guaranteeing users' QoS requirements and fairness among all users. Simulation results indicate that the proposed algorithm can achieve superior performance.     

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.     

Optimal resource allocation in multiservice CDMA networks

This paper addresses the problem of dynamic resource allocation in a multiservice direct-sequence code-division multiple-access (DS-CDMA) wireless network supporting real-time (RT) and nonreal-time (NRT) communication services. For RT users, a simple transmission power allocation strategy is assumed that maximizes the amount of capacity available to NRT users without violating quality of service requirements of RT users. For NRT users, a joint transmission power and spreading gain (transmission rate) allocation strategy, obtained via the solution of a constrained optimization problem, is provided. The solution maximizes the aggregate NRT throughput, subject to peak transmission power constraints and the capacity constraint imposed by RT users. The optimization problem is solved in a closed form, and the resulting resource allocation strategy is simple to implement as a hybrid CDMA/time-division multiple-access strategy. Numerical results are presented showing that the optimal resource allocation strategy can offer substantial performance gains over other conventional resource allocation strategies for DS-CDMA networks.     

An Iterative Approach to the Power Control Problem in Multi-Service CDMA Systems: Distributed Algorithms and their Convergence

In this paper we present two decentralized Iterative Power Control Algorithms (IPCAs) for the uplink and downlink communication in multi-service CDMA wireless environments in order to expand the system capacity while at the same time satisfy the various QoS requirements. The proposed dynamic IPCAs are decentralised in the sense that they can be implemented in a distributed mode at the individual cell sites and mobile stations based on local measurements and information, and without the need of co-ordination between the different cells. The main feature of these two power control algorithms is that they combine the allocation as well as the correction of power in a multi-service wireless system. For the algorithms presented here whenever power settings exist for which all users meet the QoS requirements we prove and demonstrate exponentially fast convergence to the optimal power values. Finally we present some numerical results to assess the performance of our algorithms by applying them in some test cases.     

Cross-layer resource allocation for QoS guarantee with finite queue constraint in multirate OFDMA wireless networks

Efficient radio resource allocation is essential to provide quality of service （QoS） for wireless networks. In this article, a cross-layer resource allocation scheme is presented with the objective of maximizing system throughput, while providing guaranteed QoS for users. With the assumption of a finite queue for arrival packets, the proposed scheme dynamically a/locates radio resources based on user＇s channel characteristic and QoS metrics derived from a queuing model, which considers a packet arrival process modeled by discrete Markov modulated Poisson process （dMMPP）, and a multirate transmission scheme achieved through adaptive modulation. The cross-layer resource allocation scheme operates over two steps. Specifically, the amount of bandwidth allocated to each user is first derived from a queuing analytical model, and then the algorithm finds the best subcarrier assignment for users. Simulation results show that the proposed scheme maximizes the system throughput while guaranteeing QoS for users.     

A scheme for throughput maximization in a dual-class CDMA system

This work focuses on the problem of efficient exploitation of the available bandwidth in order to provide high bit rates on the wireless link, as will be required in future wireless systems interfacing to broadband fixed networks. In particular, the uplink of a CDMA system with two user classes is considered. One of the classes consists of delay-intolerant users requiring support for a constant information bit rate, while the other consists of delay-tolerant users needing support for an information bit rate larger than a given value. It is assumed that when not transmitting information, synchronization contact is maintained with the base station at a given rate. The objective is to maximize the throughput of the delay tolerant users, while ensuring that the interference to other cells is as low as possible by minimizing the sum of all of the transmit powers used by the mobiles. Two transmission modes for the delay-tolerant users are considered. In the first mode, all of the users are allowed to transmit information when they wish. In the second mode, the transmissions of the delay-tolerant users are scheduled, so that only a limited number of them are transmitting information at any given time instant. It is shown that the second transmission mode, which is a time-scheduled scheme for the delay-tolerant users (with hybrid CDMA/TDMA as a special case), affords a better throughput while imposing the same average power requirements as conventional transmission. The results in this paper can be interpreted using results from previous work based on information theory     

基于决策理论的CDMA网络中多类业务的准入控制策略

准入控制是码分多址(CDMA)蜂窝网络中服务质量保证的一个关键技术。该文提出了一个基于半马尔可夫决策过程理论的最优准入控制策略来支持有服务质量要求的多类业务的无线CDMA网络。用线性规划方法求解最优策略,从而在满足服务质量约束要求的同时最大化信道利用率。另外,还使用了加权公平阻塞约束来灵活地实现服务质量要求。数值结果表明此最优策略可以获得比基于阈值的准入控制方案更好的性能。     

Power Control Using Two-Level Channel Inversion for Data Traffic in a Cellular CDMA System: Performance and Optimal Design

In this paper, we propose and analyze a simple adaptive uplink power control scheme, called two-level channel inversion, for data traffic in a cellular CDMA system. The basic idea is to reduce out-cell interference by reducing the rate of, or even suspending, transmission when the wireless channel is in a bad condition. We first describe the scheme in detail, and then present a probabilistic analysis model for evaluating the system performance. With this model, we determine the queueing delay and system throughput. Numerical results show that in comparison with the traditional channel inversion scheme, the two-level channel inversion scheme can substantially improve system throughput at a moderate cost of extra queueing delay. Finally, we present a design algorithm to optimize the overall performance while maintaining each user's quality of service (QoS).     

Channel assignment with QoS guarantees for a multiclass multicode CDMA system

In a wireless system that supports multimedia services, each traffic requires different quality of service (QoS) at both communication on radio links and connection admission. We initially derive the uplink capacity satisfying the QoS constraint on radio links in a multiclass multicode code-division multiple-access (CDMA) system. Based on the derived capacity, the number of channel elements, which is one of the system resources, is determined. Then, we define the QoS parameters associated with connection processes. To guarantee the defined QoS at the connection level, under given channel elements, we propose a channel-assignment scheme with dynamic priority adjustment (DPA). The proposed scheme gives multipriority to different traffic classes. Real-time classes can preempt non-real-time classes with restricted preemptive priority. Such restriction is regulated by preemption-free code channels and a buffer threshold for non-real-time classes. Among real-time classes, different priorities are assigned to each traffic class by code reservation parameters. These multipriority parameters are dynamically adjusted in order to guarantee different QoS requirements. We analyze the DPA scheme by the matrix-geometric method, and evaluate the performance of each traffic class. The results show that the proposed scheme flexibly guarantees QoS depending on traffic loading condition and achieves high channel utilization.     

基于IEEE 802.16e的跨层上行调度架构设计

对IEEE 802.16标准的上行链路调度架构进行了研究,并联合MAC层和物理层,设计了一种跨层的上行调度结构,在满足移动性要求的同时增强了系统的QoS保障能力,使频谱利用率和吞吐量得到提高.     

Space‐time diversity‐enhanced QoS provisioning for real‐time service over MC‐DS‐CDMA based wireless networks

In order to support the quality‐of‐service (QoS) requirements for real‐time traffic over broadband wireless networks, advanced techniques such as space‐time diversity (STD) and multicarrier direct‐sequence code division multiple access (MC‐DS‐CDMA) are implemented at the physical layer. However, the employment of such techniques evidently affects the QoS provisioning algorithms at the medium access control (MAC) layer. In this paper, we propose a space‐time infrastructure and develop a set of cross‐layer real‐time QoS‐provisioning algorithms for admission control, scheduling, and subchannel‐allocations. We analytically map the parameters characterizing the STD onto the admission‐control region guaranteeing the real‐time QoS. Our analytical analyses show that the proposed algorithms can effectively support real‐time QoS provisioning. Also presented are numerical solutions and simulation results showing that the STD can significantly improve the QoS provisioning for real‐time services over wireless networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Power control and channel allocation for real‐time applications in cellular networks

The next‐generation packet‐based wireless cellular network will provide real‐time services for delay‐sensitive applications. To make the next‐generation cellular network successful, it is critical that the network utilizes the resource efficiently while satisfying quality of service (QoS) requirements of real‐time users. In this paper, we consider the problem of power control and dynamic channel allocation for the downlink of a multi‐channel, multi‐user wireless cellular network. We assume that the transmitter (the base‐station) has the perfect knowledge of the channel gain. At each transmission slot, a scheduler allots the transmission power and channel access for all the users based on the instantaneous channel gains and QoS requirements of users. We propose three schemes for power control and dynamic channel allocation, which utilize multi‐user diversity and frequency diversity. Our results show that compared to the benchmark scheme, which does not utilize multi‐user diversity and power control, our proposed schemes substantially reduce the resource usage while explicitly guaranteeing the users' QoS requirements. Copyright © 2007 John Wiley & Sons, Ltd.     

An FDD wideband CDMA MAC protocol with minimum-power allocation and GPS-scheduling for wireless wide area multimedia networks

A frequency division duplex (FDD) wideband code division multiple access (CDMA) medium access control (MAC) protocol is developed for wireless wide area multimedia networks. In order to reach the maximum system capacity and guarantee the heterogeneous bit error rates (BERs) of multimedia traffic, a minimum-power allocation algorithm is first derived, where both multicode (MC) and orthogonal variable spreading factor (OVSF) transmissions are assumed. Based on the minimum-power allocation algorithm, a multimedia wideband CDMA generalized processor sharing (GPS) scheduling scheme is proposed. It provides fair queueing to multimedia traffic with different QoS constraints. It also takes into account the limited number of code channels for each user and the variable system capacity due to interference experienced by users in a CDMA network. To control the admission of real-time connections, a connection admission control (CAC) scheme is proposed, in which the effective bandwidth admission region is derived based on the minimum-power allocation algorithm. With the proposed resource management algorithms, the MAC protocol significantly increases system throughput, guarantees BER, and improves QoS metrics of multimedia traffic.     

Maximization of user satisfaction in OFDMA systems using utility‐based resource allocation

In order to keep and/or expand its share of the wireless communication market and decrease churn, it is important for network operators to keep their users (clients) satisfied. The problem to be solved is how to increase the number of satisfied non‐real time (NRT) and real time (RT) users in the downlink of the radio access network of an orthogonal frequency division multiple access system. In this context, the present work proposes a method to solve the referred problem using a unified radio resource allocation (RRA) framework based on utility theory. This unified RRA framework is particularized into two RRA policies that use sigmoidal utility functions based on throughput or delay and are suitable for NRT and RT services, respectively. It is demonstrated by means of system‐level simulations that a step‐shaped sigmoidal utility function combined with a channel‐aware opportunistic scheduling criterion is effective toward the objective of user satisfaction maximization. Copyright © 2014 John Wiley & Sons, Ltd.     

Resource scheduling scheme with QoS support in two-hop relay-enhanced OFDMA systems

As the system performance is obviously improved by introducing the concept of relay into the traditional orthogonal frequency division multiple access(OFDMA)systems,resource scheduling in relay-enhanced OFDMA systems is worthy of being studied carefully.To solve the optimization problem of achieving the maximum throughput while satisfying the quality of service(QoS)and guaranteeing the fairness of users,a novel resource scheduling scheme with QoS support for the downlink of two-hop relay-enhanced OFDMA systems is proposed.The proposed scheme,which is considered both in the first time sub-slot between direct link users and relay stations,and the second time sub-slot among relay link users,takes QoS support into consideration,as well as the system throughput and the fairness for users.Simulation results show that the proposed scheme has good performance in maximizing system throughput and guaranteeing the performance in the service delay and the data loss rate.     

Dynamic resource scheduling (DRS): a multimedia QoS framework for W‐CDMA

Multi‐media support is an important feature of third generation (3G) wireless communication systems, and Quality of Service (QoS) is a crucial issue, as in any other networking environment. In this paper, the QoS issues in the wireless last‐mile is investigated for 3G systems based on Wideband‐Code division multiple access (W‐CDMA). Supporting multiple rates in the CDMA environment introduces the power assignment problem, which is coupled with the bandwidth and error QoS parameters. Also, multi‐media traffic flows should be classified and serviced in such a way to provision delay guarantees. In this paper, a new framework, namely dynamic resource scheduling (DRS), is described and extensively studied. In order to serve multi‐media services with different requirements, a family of nine algorithms has been developed within the DRS framework. These algorithms can be categorized with respect to single or prioritized queuing architectures, fixed or variable rate bandwidth and power allocation, and variable spreading gain or multi‐code spreading strategies. The paper presents the performance of the DRS algorithms in comparison with each other and with conventional scheduled‐CDMA (S‐CDMA) and proposed schemes in the W‐CDMA standard. The performance for error and throughput QoS provisioning and power control dynamics are explored; advantages, disadvantages and limitations of the algorithms are discussed. The DRS framework is concluded to be a promising QoS architecture, with a simple, flexible, scalable structure that can be configured according to a given traffic scenario. Copyright © 2004 John Wiley & Sons, Ltd.     

Adaptive admission/congestion control policies for CDMA‐based wireless internet

Radio resource management (RRM) is vital for the next generation wireless networks. RRM comprises many functionalities and this paper focuses on the investigation of the performance of several adaptive call admission/congestion control policies based on a window‐measurement estimation of the status of the buffer at the base station under the hybrid TDMA/CDMA access scheme. In our study, we interrelate the physical limitations of the base stations (i.e. the number of transmission and reception modems), call and burst level traffic, instantaneous buffer conditions and end‐to‐end bit error performance in one queuing problem. Subsequently, a window‐measurement estimator is implemented to estimate the likelihood of buffer congestion at the base station. Accordingly, the traffic loads shall be controlled. We use event‐driven simulation to simulate the multimedia integrated CDMA networks where heterogeneous traffic users are multiplexed into a simple TDMA frames. The simulation results show outstanding performance of the proposed call admission/congestion control policies in guaranteeing QoS requirements. Copyright © 2005 John Wiley & Sons, Ltd.