A preemption‐based scheduling algorithm for WiMAX networks

Several scheduling techniques were designed for the base station (BS) of IEEE 802.16e wireless interoperability of microwave access networks. However, depending on the BS scheduler alone to determine the servicing order of each connection might affect the accuracy of the scheduling process because the BS does not necessarily have enough up‐to‐date information about the current state of the connections at the subscriber station. In this paper, we propose a preemption‐based scheduling algorithm that focuses on improving the quality of service requirements of real‐time service flow classes. The proposed algorithm incorporates two schedulers, one at the BS and another one at the subscriber station. We have implemented and integrated the proposed algorithm with the network simulator NS2 using the Network and Distributed Systems Laboratory wireless interoperability of microwave access module. Simulation results have shown that the proposed approach outperforms other scheduling algorithms in terms of enhancing the throughput and the average delay of real‐time quality of service classes. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance evaluation of utility‐based scheduling schemes with QoS guarantees in IEEE 802.16/WiMAX systems

One of the most important benefits that WiMAX technology brings, the ability to provide differentiated quality of service (QoS) guarantees, could also prove to be the largest problem for system designers, because scheduling mechanisms able to cope with these demands have not been explicitly defined in the standard. In order to facilitate the understanding of how various scheduling schemes perform in a real system, we present here a detailed performance evaluation of some utility‐based scheduling algorithms, covering aspects like fairness and QoS provisioning. Through a series of extensive simulations, we analyse the ability of the scheduling schemes considered to strike a balance between fairness among users, or more restrictively, user QoS requirement satisfaction, and system efficiency maximization. Further, we show how several simple algorithms could be used as building blocks, constructing a powerful mechanism that allows the system designer to obtain any desired system behaviour, or even to dynamically change from one profile to another, depending on specific network‐related conditions. More specifically, by combining the benefits of proportional fair (PF) scheduling with the highly desirable system capacity maximization, and also taking into account a peak‐to‐average (PTA) channel quality metric, we are able to define a rule that outperforms traditional scheduling schemes, copes with various network conditions and provides graceful service degradation. Our results indicate that, by exploiting the intrinsic properties of orthogonal frequency division multiple access (OFDMA) as well as the mechanisms of the WiMAX system that are not regulated by the standard, one could increase the system efficiency, while fully respecting the QoS guarantees imposed. The use of algorithms that provide graceful performance degradation is highly advisable, in order to be able to employ a non‐conservative call admission control (CAC) mechanism, which further improves the overall spectral efficiency by maintaining the system close to saturation at all times. Copyright © 2009 John Wiley & Sons, Ltd.     

一种IEEE 802.16无线网络的优化带宽调度策略

提出了一种基于预测的自适应实时轮询业务带宽分配机制:SS依据当前带宽需求和以往的实际分配带宽,对实时业务数据包所需求的确切带宽进行预测并调度.给出了数学分析模型和仿真,结果表明,与传统的带宽分配机制相比,该自适应的带宽分配算法能更好地改善系统性能,提高吞吐量,减少时延,减少缓冲区需求.     

An energy‐saving‐centric downlink scheduling scheme for WiMAX networks

This study proposes an energy‐saving‐centric downlink scheduling scheme to support efficient power utilization and to satisfy the QoS requirements. The base station considers the queue lengths of mobile stations with real‐time and non‐real‐time connections and considers their QoS requirements to determine the sleeping parameters when the mobile stations issue sleep requests. The proposed scheme appropriately reschedules the sleep‐requesting mobile station to transmit its queued packets for optimal power‐saving efficiency. The QoS requirement is considered as the constraint during traffic rescheduling. The treatment of real‐time connections generally requires a trade‐off of the delay requirement and the longer sleep window, and the non‐real‐time connections must concern the packet drop and minimum data rates when performing the energy‐centric scheduling. Two rescheduling algorithms, that is, whole and partial reschedules, are proposed and analyzed in this paper. The whole‐reschedule scheme provides improved energy‐saving performance at the cost of tolerable longer delay and computing complexity when compared with the partial‐reschedule scheme. Our simulation results indicated that both schemes not only guarantee the desired QoS but also achieve superior energy‐saving efficiency to that of traditional scheduling. Copyright © 2012 John Wiley & Sons, Ltd.     

支持实时多媒体业务QoS醮LTE下行调度研究

日益增长的多媒体业务要求下一代移动通信系统支持具有不同QoS要求的业务。针对LTE下行链路资源分配和调度问题,介绍了支持实时多媒体业务QoS调度算法的最新成果与进展,并对未来研究方向进行了分析展望。     

Low complexity resource allocation and scheduling algorithms for downlink SDMA systems

The downlink zero-forcing beamforming strategy in the case of random packet arrivals is investigated. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. It has been shown that allocating resources to maximize a queue-length-weighted sum of the rates is a stabilizing policy. However, the high complexity of user selection and the feasible rates determination for optimal scheme may prevent the real-time scheduling operation. Two low complexity algorithms are provided taking the channel state, queue state and orthogonality into account. In particular, the authors pick the first user with the largest product between channel gain and queuing length, and select the remaining users to construct candidate user set based on the greedy user selection method or channel orthogonal user selection method. Then, the power and rate allocation for the selected users are implemented based on the modified water-filling method. The complexity of the proposed algorithms is analyzed. The average delay and average throughput are studied in homogeneous scenarios and heterogeneous scenarios, respectively. Simulation results show that the proposed algorithms can take full advantage of the multi-user diversity gain and provide average delay (or throughput) and fairness improvement compared with channel-aware-only schemes.     

Adaptive scheduling mechanism for IPTV over WiMAX IEEE 802.16j networks

A WiMAX technology is a very promising Broadband Wireless Access technology that is able to transmit different service types. This latter can have different constraints such as traffic rate, maximum latency, and tolerated jitter. The IEEE 802.16 Medium Access Control specifies five types of QoS classes: UGS, rtPS, ertPS, nrtPS, and BE. However, the IEEE 802.16 standard does not specify the scheduling algorithm to be used. Operators have the choice among many existing scheduling techniques. Also, they can propose their own scheduling algorithms. In this paper, we propose a scheduling strategy (Adaptive Weighted Round Robin, AWRR) for various Internet Protocol Television (IPTV) services traffic over 802.16j networks. Our scheme adapts dynamically the scheduler operation to according queue load and quality of service constraints. In particular, the proposed mechanism gives more priority to high definition television and standard definition television traffic by using two schedulers. The proposed scheduling algorithm has been simulated using the QualNet network simulator. The experimental results show that our scheduler schemes AWRR have a better performance than the traditional scheduling techniques for rtPS traffic, which allows ensuring QoS requirements for IPTV application. Copyright © 2012 John Wiley & Sons, Ltd.     

基于WiMax的无线回程容量开销分析

文章主要分析讨论了基于802．16e版本的WiMax用于点对点无线回程传输的头部开销及容量大小。重点分析了信头中FCH（控制帧头）以及下行DL—MAP（下行接入消息）在回程传输中需要的资源大小，再依据这些大小限制进行下行PUSC（部分占用子信道）配置最终估算出容量大小。     

QoS-oriented packet scheduling scheme for opportunistic networks

The unique characteristics of opportunistic networks (ONs), such as intermittent connectivity and limited network resources, makes it difficult to support quality of service (QoS) provisioning, particularly to guarantee delivery ratio and delivery delay. In this paper, we propose a QoS-oriented packet scheduling scheme (QPSS) to make decisions for bundle transmissions to satisfy the needs for the delivery ratio and delivery delay constraints of bundles. Different from prior works, a novel bundle classification method based on the reliability and latency requirements is utilized to decide the traffic class of bundles. A scheduling algorithm of traffic class and bundle redundancy is used to maintain a forwarding and dropping priority queue and allocate network resources in QPSS. Simulation results indicate that our scheme not only achieves a higher overall delivery ratio but also obtains an approximate 14% increase in terms of the amount of eligible bundles.     

EPON和WiMAX融合架构下带宽分配和调度机制的研究

以太网无源光网络(EPON)和IEEE 802.16(WiMAX)的融合网络在固定移动混合接入网中被认为是很有前景的接入方式.文中提出了3种WiMAX无线网络与EPON网络系统融合架构,融合系统同时具有光网络的高带宽和无线网络的灵活性.为了在接入网中支持QoS,本文为融合结构提出了一种动态带宽分配算法(DBA)和调度机...     

Hybrid scheduling mechanisms for Next-generation Passive Optical Networks based on network coding

Network coding (NC) integrated into Passive Optical Networks (PONs) is regarded as a promising solution to achieve higher throughput and energy efficiency. To efficiently support multimedia traffic under this new transmission mode, novel NC-based hybrid scheduling mechanisms for Next-generation PONs (NG-PONs) including energy management, time slot management, resource allocation, and Quality-of-Service (QoS) scheduling are proposed in this paper. First, we design an energy-saving scheme that is based on Bidirectional Centric Scheduling (BCS) to reduce the energy consumption of both the Optical Line Terminal (OLT) and Optical Network Units (ONUs). Next, we propose an intra-ONU scheduling and an inter-ONU scheduling scheme, which takes NC into account to support service differentiation and QoS assurance. The presented simulation results show that BCS achieves higher energy efficiency under low traffic loads, clearly outperforming the alternative NC-based Upstream Centric Scheduling (UCS) scheme. Furthermore, BCS is shown to provide better QoS assurance.     

支持移动无线接入的IP网络QoS保证技术

针对服务质量(QoS)保证技术问题,从移动性、无线链路特性和IP网络传统的QoS保证技术的改进几个方面出发,对下一代支持多种移动无线接入的IP网络中,QoS保证技术的相关研究热点及技术现状进行了分析和总结,并提出了本研究方向QoS分层模型和进一步的研究建议。     

Design of the QoS framework for the IEEE 802.16 mesh networks

IEEE 802.16 (WiMax) technology is designed to support broadband speeds over wireless networks for the coming era of broadband wireless access (BWA). IEEE 802.16 is expected to provide transmission of high‐rate and high‐volume multimedia data streams for fixed and mobile applications. As an extension of point‐to‐multipoint (PMP) configuration, the IEEE 802.16 mesh mode provides a quicker and more flexible approach for network deployment. Multimedia networking requires quality‐of‐service (QoS) support, which demands elaborate mechanisms in addition to the four service types defined in the specification. By examining standard centralized and distributed scheduling/routing schemes in the mesh mode from QoS aspect, a BS‐controlled and delay‐sensitive scheduling/routing scheme is proposed in the paper. Associate mechanisms including admission control, flow setup and link state monitoring are also proposed. Integration of the proposed mechanisms is presented as a complete QoS framework. Simulation study has demonstrated that the average delay as well as the delay jitters per hop in the proposed scheme is smaller than that of the distributed scheme and much smaller than that of the centralized scheme. Furthermore, proposed mechanisms can also achieve higher throughput than the contrasts and generate much smaller signaling overhead, making the proposed framework a promising scheme for multimedia support in the IEEE 802.16 mesh network. Copyright © 2009 John Wiley & Sons, Ltd.     

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.     

An Improved Round Robin Packet Scheduler for Wireless Networks

Scheduling algorithms are important components for providing quality-of-service (QoS) guarantees in wireless networks. The design of such algorithms need to take into account bursty errors and location-dependent channel capacity that are characteristics of wireless networks. In this paper, a new scheduling algorithm for packet cellular networks, wireless deficit round robin (WDRR), is proposed. WDRR is a round robin scheduler that has low implementation complexity and offers a low delay bound, tight fairness index, and good isolation property. In error-prone channels, the algorithm provides short-term fairness among sessions that perceive a clean channel, long-term fairness among all sessions, ability to meet specified throughput objectives for all sessions, and graceful service degradation among sessions that received excess service. Both analysis and simulation are used to verify the WDRR properties.     

Energy-Efficient, Collision-Free Medium Access Control for Wireless Sensor Networks

The traffic-adaptive medium access protocol (TRAMA) is introduced for energy-efficient collision-free channel access in wireless sensor networks. TRAMA reduces energy consumption by ensuring that unicast and broadcast transmissions incur no collisions, and by allowing nodes to assume a low-power, idle state whenever they are not transmitting or receiving. TRAMA assumes that time is slotted and uses a distributed election scheme based on information about traffic at each node to determine which node can transmit at a particular time slot. Using traffic information, TRAMA avoids assigning time slots to nodes with no traffic to send, and also allows nodes to determine when they can switch off to idle mode and not listen to the channel. TRAMA is shown to be fair and correct, in that no idle node is an intended receiver and no receiver suffers collisions. An analytical model to quantify the performance of TRAMA is presented and the results are verified by simulation. The performance of TRAMA is evaluated through extensive simulations using both synthetic- as well as sensor-network scenarios. The results indicate that TRAMA outperforms contention-based protocols (CSMA, 802.11 and S-MAC) and also static scheduled-access protocols (NAMA) with significant energy savings. This work was supported in part by the NSF-NGI grant number ANI-9813724 and by the Jack Baskin Chair of Computer Engineering at UCSC. Venkatesh Rajendran received the B.E. degree in Electronics and Communication Engineering from the Anna University in 2001, and M.S. in Computer Engineering from the University of California, Santa Cruz (UCSC) in 2003. He is currently working towards his Ph.D at UCSC. He is a graduate student researcher at the Inter-networking Research Lab (INRG). His research interests are in wireless communication system design, energy-aware media access control protocols for wireless ad hoc networks, smart sensor networks, reliable multi-casting, wireless multi-carrier communications, digital signal processing, adaptive modulation, and smart antenna systems. Katia Obraczka received the B.S. and M.S. degrees in electrical and computer engineering from the Federal University of Rio de Janeiro, Brazil, and the M.S. and Ph.D. degrees in computer science from the University of Southern California (USC). She is an Assistant Professor of Computer Engineering at the University of California, Santa Cruz. Before joining UCSC, she held a research scientist position at USC's Information Sciences Institute and a research faculty appointment at USC's Computer Science Department. Her research interests include computer networks, more specifically, network protocol design and evaluation in wire-line as well as wireless (in particular, multi-hop ad hoc) networks, distributed systems, and Internet information systems. J.J. Garcia-Luna-Aceves received the M.S. and Ph.D. degrees in electrical engineering from the University of Hawaii, Honolulu, HI, in 1980 and 1983, respectively. He is the Baskin Professor of Computer Engineering at the University of California, Santa Cruz (UCSC). Dr. Garcia-Luna-Aceves directs the Computer Communication Research Group (CCRG), which is part of the Information Technologies Institute of the Baskin School of Engineering at UCSC. He has been a Visiting Professor at Sun Laboratories and a consultant on protocol design for Nokia. Prior to joining UCSC in 1993, he was a Center Director at SRI International (SRI) in Menlo Park, California. Dr. Garcia-Luna-Aceves has published a book and more than 250 refereed papers and three U.S patents, and has directed more than 18 Ph.D. theses at UCSC. He has been Program Co-Chair of ACM MobiHoc 2002 and ACM Mobicom 2000; Chair of the ACM SIG Multimedia; General Chair of ACM Multimedia '93 and ACM SIGCOMM '88; and Program Chair of IEEE MULTIMEDIA '92, ACM SIGCOMM '87, and ACM SIGCOMM '86. He has served in the IEEE Internet Technology Award Committee, the IEEE Richard W. Hamming Medal Committee, and the National Research Council Panel on Digitization and Communications Science of the Army Research Laboratory Technical Assessment Board. HE has been on the editorial boards of the IEEE/ACM Transactions on Networking, the Multimedia Systems Journal, and the Journal of High Speed Networks. He received the SRI International Exceptional-Achievement Award in 1985 and 1989, and is a senior member of the IEEE.     

Effective resource scheduling scheme considering scheduling relevancy for downlink joint transmission system

Coordinated multi-point(CoMP) transmission is a promising technique to improve both cell average and cell edge throughput for long term evolution-advanced(LTE-A).For CoMP joint transmission(CoMP-JT) in heterogeneous scenario,if joint transmission(JT) users are firstly scheduled,other non-JT users will not be allocated sufficient resources,i.e.,scheduling relevancy exists in the users under different cells in the same coordination cluster.However,the CoMP system throughput will decline remarkably,if the impact of scheduling relevancy is not considered.To address this issue,this paper proposes a novel scheduling scheme for CoMP in heterogeneous scenario.The principles of the proposed scheme include two aspects.Firstly,this scheme gives priority to user fairness,based on an extended proportional fairness(PF) scheduling algorithm.Secondly,the throughput of the coordination cluster should be maintained at a high level.By taking the non-CoMP system as a baseline,the proposed scheme is evaluated by comparing to random PF(RPF) and orthogonal PF(OPF) scheme.System-level simulation results indicate that,the proposed scheme can achieve considerable performance gain in both cell average and cell edge throughput.     

基于SLNR准则的MU-MIMO下行链路的预编码与用户调度

在多用户MIMO（MU-MIMO）系统的下行链路中,为了降低用户端的处理复杂度,发射端预编码的设计对多用户MIMO系统的性能非常重要,基于信漏噪比（SLNR）准则的预编码技术由于同时考虑了共信道干扰（CCI）和噪声,提高了系统的性能,但基站同时服务的用户有限,基于信漏噪比最大的用户调度能够合理地选择用户,提高了多用户分级增益,使系统获得更高的系统容量和系统性能。仿真结果表明,基于SLNR准则的多用户预编码在系统容量和误码率方面要优于单一考虑CCI的迫零预编码（ZF）和单一考虑噪声的最大化每个用户接收到信号的信噪比预编码（MRT）。在采用SLNR预编码的条件下,信漏噪比最大的用户调度系统性比轮询调度和最大信道增益调度好,并且随着待选用户数的增多,不会给系统的调度策略带来很大的影响。     

Channel-Aware Earliest Deadline Due Fair Scheduling for Wireless Multimedia Networks

Providing delay guarantees to time-sensitive traffic in wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the variety of real-time applications expected to be handled by such networks. We propose and evaluate the performance of a channel-aware scheduling discipline and a set of policies that are capable of providing such delay guarantees in TDM-based wireless networks. First, we introduce the Channel-Dependent Earliest-Due-Date (CD-EDD) discipline. In this discipline, the expiration time of the head of line packets of users' queues is taken into consideration in conjunction with the current channel states of users in the scheduling decision. This scheme attempts to guarantee the targeted delay bounds in addition to exploiting multiuser diversity to make best utilization of the variable capacity of the channel. We also propose the violation-fair policy that can be integrated with the CD-EDD discipline and two other well-known scheduling disciplines [1, 2]. In this policy, we attempt to ensure that the number of packets dropped due to deadline violation is fairly distributed among the users. The proposed schemes can provide statistical guarantees on delays, achieve high throughput, and exhibit good fairness performance with respect to throughput and deadline violations. We provide extensive simulation results to study the performance the proposed schemes and compare them with two of the best known scheduling disciplines [1, 2] in the literature. Khaled M. F. Elsayed (S90-M95-SM02) received his B.Sc. (honors) in electrical engineering and M.Sc. in engineering mathematics from Cairo University in 1987 and 1990 respectively. He received his Ph.D. in computer science and computer engineering from North Carolina State University in 1995. He is now an Associate Professor in Cairo University, Egypt and is an independent telecommunications consultant. Between 1995 and 1997, he was a member of scientific staff with Nortel Wireless Systems Engineering in Richardson, TX.Dr. Elsayed was the editor for the Internet technology series of the IEEE Communications Magazine from 1998 until 2002. He has served on technical program committees for several IEEE, IFIP, and ITC conferences. He was the technical co-chair for IFIP MWCN 2003 conference in Singapore. He also served as an expert evaluator for the European Commission FP5 and FP6 programmes. His research interest is in the area of performance evaluation of communication networks including IP, wireless and optical networks. Ahmed Khattab received his B.Sc. (honors) and MS.C in Electronics and Communications Engineering from Cairo University in 2002 and 2004 respectively. Since August 2005, he is pursuing his PhD degree at Rice University, Texas. His research interests are in wireless networking and radio resource management.