Adaptive Max SNR Packet Scheduling for OFDM Wireless Systems

In this paper, we consider scheduling and resource allocation for a downlink in a wireless OFDM system. If each broadcast sub channel is allocated to a user according to max SNR selection, optimal system throughput is obtained for the cost of a significant loss in fairness among users. As a solution to resolve this issue and in an attempt at reaching a compromise between fairness and throughput, we propose to add to the max SNR scheme a weak control based on user QoS requirements. In this work, user latency between two successive channel accesses is considered as a parameter for the control. The feedback of quantized channel state information (CSI) is proposed to reduce the feedback burden. Performance analysis of the proposed scheme has been presented to illustrate the capacity-fairness-feedback trade-off of the considered scheme compared to max SNR and proportional fair algorithms used as benchmark.

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.     

QoS Support by Using CDF-Based Wireless Packet Scheduling in Fading Channels

In this paper, we provide an efficient quality-of-service (QoS)-guarantee scheme using the cumulative-distribution-function-based scheduling (CS) algorithm in wireless fading channels. We first extend the CS algorithm such that it can encompass the practical environment with discrete user transmission rates. The extended CS algorithm can allocate the time fractions to users in arbitrary manner, and render an exact estimation of user average throughputs, through which it can provide differentiated QoS to each user. We also introduce the effective-capacity concept to describe the delay-constrained capacity of the CS algorithm, both in time-independent and time-correlated channels. In contrast to other existing scheduling algorithms, the CS algorithm enables calculating the effective capacity analytically, rather than estimating it by measurement on the queueing behavior. Using the effective capacity, we can check the feasibility of the user-specified QoS effectively in wireless time-varying channels     

Packet Scheduling with QoS Differentiation

This article focuses on the Quality of Service (QoS) achieved by packet scheduling. A packet scheduling algorithm, which can differentiate the QoS among user and service classes, is presented. The algorithm can be tuned from signal to interference ratio (C/I) based scheduling to Round Robin and beyond. Thus, an operator can choose between optimizing the spectral efficiency or giving a fair QoS distribution among the users within a user and traffic class. By combining the two effects, different strategies can be used for different user and service classes. Simulation results for the downlink shared channel (DSCH) are presented and implementation issues are also discussed.     

Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems

Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD.     

IEEE 802.16系统的QoS分组调度算法

文章基于IEEE 802.16宽带无线城域网接入标准中定义的QoS架构,对上行分组调度UPS进行了具体的设计,将其分为信息模块、调度数据库模块和服务分配模块三个部分。并且提出了一种基于严格优先级的调度服务原则,为不同类型的服务流提供QoS支持,分别给出了rtPS、nrtPS和BE三种服务的调度算法。文章最后通过具体仿真验证出所提出的策略能够为实时业务提供QoS支持。     

Time Synchronization Algorithms in Low-Cost Wireless Sensor Network Systems

Time synchronization is an essential building block of sensor network systems. In this paper, we present a comprehensive study of least squares algorithms for time synchronization in sensor networks, with a focus on continuous monitoring and data collection applications. We propose a set of algorithms to address a number of issues in practical implementation on typical low-cost sensor network platforms, including a scaled signal model to achieve numerical stability in an ill-conditioned problem, sequential estimators for the scaled signal model to reduce computational complexity, a fast initialization scheme to improve energy efficiency, and outlier detection algorithms to improve robustness in long-term autonomous operations. The proposed algorithms are implemented and a measurement-based simulation method is employed to study the performance.     

战术IP通信中的分组调度算法

现行的战术通信网络大多采用IP报文来交换信息,由于战场环境的影响,通信速率受到很大地限制。考虑到战术通信环境下的特殊性,已有的一些分组调度算法不能很好的适应战时通信需求,本文就战术通信环境下的分组调度算法进行讨论。     

IEEE 802.16宽带无线接入系统中基于QoS的调度算法

本文介绍并评估了几种支持IEEE 802.16标准QoS要求的包调度算法,并将它们的重要性能进行了比较.     

Class-Based Packet Scheduling to Improve QoS for IP Video

An important issue for video transmission over IP networks is the preservation of perceived video quality despite packet loss. Packet loss can be detrimental to compressed video. However, reducing packet loss to a very low level is difficult with current techniques. Furthermore, even a very low objective loss probability can still seriously distort perceived video quality. This paper presents a packet scheduling scheme at a router which addresses the loss issues of networked video. Experiments using real video data show that the proposed scheme can significantly improve the visual quality of video and network efficiency. Moreover, it can provide different classes of videos with different levels of loss guarantees, while maintaining service fairness among the same class of videos.     

分组调度算法的仿真与分析

介绍了现有分组调度算法的发展概况，主要探讨并分析了常见的几种无线分组调度算法的适用性及其存在的问题，并且对分组调度算法进行了仿真和分析．最后指出了分组调度算法的发展方向．     

分组网络中包调度算法研究

下一代因特网要支持QoS(quality of service)实现,而包调度又是QoS实现的关键技术之一。文中对现有的包调度算法进行了分类,分析和比较了各类算法的技术特点与性能优劣,讨论了包调度算法研究今后的发展方向。     

Downlink Wireless Packet Scheduling with Deadlines

Next-generation cellular wireless communication networks aim to provide a variety of quality-of-service (QoS)-sensitive packet-based services to downlink users. Included among these are real-time multimedia services, which have stringent delay requirements. Downlink packet scheduling at the base station plays a key role in efficiently allocating system resources to meet the desired level of QoS for various users. In this paper, we employ dynamic programming (DP) to study the design of a downlink packet scheduler capable of supporting real-time multimedia applications. Under well-justified modeling reductions, we extensively characterize structural properties of the optimal control associated with the DP problem. We leverage intuition gained from these properties to propose a heuristic scheduling policy, namely, Channel-Aware Earliest Due Date (CA-EDD), which is based on a "quasi- static" approach to scheduling. The per-time-slot implementation complexity of CA-EDD is only O(K) for a system with K downlink users. Experimental results show that CA-EDD delivers up to 50 percent of performance gains over benchmark schedulers. CA-EDD achieves these performance gains by using channel and deadline information in conjunction with application layer information (relative importance of packets) in a systematic and unified way for scheduling.     

Delay-Sensitive Packet Scheduling for a Wireless Access Link

As the delay is a critical QoS factor, packet scheduling over a wireless access link that often becomes congested needs to have the objective of meeting each user's delay requirement. To incorporate the delay into the scheduler design, we consider the objective of maximizing the total utility (U_T). However, since a utility-based scheduler that concerns delay requires high complexity, we introduce the concept of marginal utility. Representing the objective as minimizing the total marginal utility (M_T), we develop some related properties for maximizing U_T and minimizing M_T. For the case with fixed service time, we show that the outcome of M_T minimization becomes equivalent to that of U_T maximization. For the more complicated case of varying service time, the M_T minimization sheds light on the design of a simple scheduler. Overall, the marginal utility requires significantly low complexity for packet scheduling compared to the ordinary utility. Through simulations, we confirm that the marginal utility gives a way of flexible scheduling in meeting various delay requirements.     

Delay Analysis of Packet Scheduling with Multi-Users Diversity in Wireless CDMA Systems

There have been a number of studies that investigate efficient packet scheduling schemes to support quality of service of multiple real-time data users and to increase capacity of non-real-time users sharing a wireless channel. We consider the problem of scheduling transmissions of multiple data users sharing the same wireless channel so as to satisfy delay or throughput and present a general packet scheduling, called MBCS (Multi-users Best Channel Scheduling) which takes advantage of the multi-user diversity of a mobile wireless system. In this paper, a queuing model that represents radio resource management for supporting packet data services is developed for the purpose of evaluating the performance of wireless CDMA systems. Numerical results show that delay performance of the proposed scheduler is higher than that of the Single-user Best Channel Scheduler (SBCS) depending on the time-varying channel status.Sungkyung Kim is a Ph. D. student in the collage of information & Communications at University of Korea, Seoul, Korea. She received her B.S. and M.S. degree in electrical engineering from Korea University in 1999 and in 2001, respectively. From March 2001 to August 2004, she worked at the Electronics Telecommunications Research Institute, Daejeon, Korea, as a member of research engineer. Her research interests include MAC protocol, radio resource control, packet scheduling, and system performance evaluation at system level in wireless access networks.Chung Gu Kang received his B.S. degree in Electrical Engineering from the University of California, San Diego in 1987 and his M.S. and Ph.D. degrees both in Electrical and Computer Engineering from the University of California, Irvine, in 1989 and 1993, respectively. While working on his Ph.D. dissertation from June 1991 to May 1992, he also was with the Aerospace Corporation in El Segundo, California, as a part-time member of technical staff (MTS). After graduation in 1993, he joined Rockwell International in Anaheim, California, where he has been working on the signaling system no. 7 and other telecommunication systems development. Since March 1994, he has been with College of Information & Communications at the Korea University, Seoul, Republic of Korea, as a full professor. His research interests include next generation mobile radio communication system and broadband wireless networks, with special emphasis on physical layer/medium access control layer design and performance analysis. During the academic year of 2000, he has been a visiting scholar at Center for Wireless Communication and also a visiting professor at Department of Electrical & Computer Engineering in University of California at San Diego (UCSD). He is a member of IEEE COMSOC, IT, and VT, and a member of KICS and KITE.     

分组交换网络调度算法概述

为了合理利用网络资源,提高网络吞吐率,降低通信时延,需要采取有效的调度算法实现输入端和输出端的匹配.基于VOQ的输入排队交换结构是当前分组交换网络最常用的结构.本文介绍了几种基于VOQ的调度算法:用于单级crossbar的PIM、iRRM和iSLIP算法,以及适用于三级Clos网络的RD和CDDR算法.对每种算法,介绍其基本原理和性能,以及与其他算法的区别.     

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

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

Joint Downlink Scheduling and Radio Resource Allocation for User-Individual QoS in Adaptive OFDMA Wireless Communication Systems

1Introduction Futurewirelessandmobilecommunicationsystems areexpectedtoofferhigherdatarates,tosupporta largenumberofsubscribersandtoensurethefulfillment ofQualityofService(QoS)requirements,giventhe limitedavailabilityoffrequencyspectrumandtimevary ingchan…     

基于OFDM的无线分组调度机制研究

采用OFDM技术的无线接口是新一代移动通信系统的候选方案之一,然而OFDM技术的特点也给面向多媒体应用并采用全IP网络结构的未来移动通信系统带来了新的问题.在探讨了OFDM无线链路的特性及其对于调度机制的影响之后,分析了PF、ODRR、MRR和Maximum C/I等主流无线调度机制与OFDM技术相结合的性能特点并指出不足之处,最后展望了基于OFDM的无线分组调度机制的发展趋势.     

Robust Packet Scheduling in Wireless Cellular Networks

This paper addresses the following robust scheduling problem: Given that only coarse-grained channel state information (i.e., bounds on channel errors, but not the fine-grained error pattern) is available, how to design a robust scheduler that ensures worst-case optimal performance? To solve this problem, we consider two coarse-grained channel error models and take a zero-sum game theoretic approach, in which the scheduler and the channel error act as non-cooperative adversaries in the scheduling process. Our results show that in the heavy channel error case, the optimal scheduler adopts a threshold form. It does not schedule a flow if the price (the flow is willing to pay) is too small, in order to maximize the system revenue. Among the scheduled flows, the scheduler schedules a flow with a probability inversely proportional to the flow price such that the risk of being caught by the channel error adversary is minimized. We also show that in the mild channel error model, the robust scheduling policy exhibits a balanced trade-off between a greedy decision and a conservative policy. The scheduler is likely to take a greedy decision if it evaluates the risk of encountering the channel error adversary now to be small. Therefore, robust scheduling does not always imply conservative decision. The scheduler is willing to take “risks” to expect higher gain in some scenarios. Our solution also shows that probabilistic scheduling may lead to higher worst-case performance compared to traditional deterministic policies. Finally, the current efforts show the feasibility to explore a probabilistic approach to cope with dynamic channel error conditions.