Scheduling Policies in Time and Frequency Domains for LTE Downlink Channel: A Performance Comparison

A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or distinguished for each available subchannel. This mechanism allows for wide discretion in resource allocation, thus promoting the flourishing of several scheduling algorithms, with different purposes. It is therefore of great interest to compare the performance of such algorithms under different scenarios. Here, we carry out a thorough performance analysis of different scheduling algorithms for saturated User Datagram Protocol (UDP) and Transmission Control Protocol (TCP) traffic sources, as well as consider both the time- and frequency-domain versions of the schedulers and for both flat and frequency-selective channels. The analysis makes it possible to appreciate the difference among the scheduling algorithms and to assess the performance gain, in terms of cell capacity, users' fairness, and packet service time, obtained by exploiting the richer, but heavier, information carried by subchannel CQI. An important part of this analysis is a throughput guarantee scheduler, which we propose in this paper. The analysis reveals that the proposed scheduler provides a good tradeoff between cell capacity and fairness both for TCP and UDP traffic sources

Resource allocation for transmit hybrid beamforming in decoupled millimeter wave multiuser-MIMO downlink

This paper presents a study on joint radio resource allocation and hybrid precoding in multicarrier massive multiple-input multiple-output communications for 5G cellular networks. In this paper, we present the resource allocation algorithm to maximize the proportional fairness (PF) spectral efficiency under the per subchannel power and the beamforming rank constraints. Two heuristic algorithms are designed. The proportional fairness hybrid beamforming algorithm provides the transmit precoder with a proportional fair spectral efficiency among users for the desired number of radio-frequency (RF) chains. Then, we transform the number of RF chains or rank constrained optimization problem into convex semidefinite programming (SDP) problem, which can be solved by standard techniques. Inspired by the formulated convex SDP problem, a low-complexity, two-step, PF-relaxed optimization algorithm has been provided for the formulated convex optimization problem. Simulation results show that the proposed suboptimal solution to the relaxed optimization problem is near-optimal for the signal-to-noise ratio SNR <= 10 dB and has a performance gap not greater than 2.33 b/s/Hz within the SNR range 0-25 dB. It also outperforms the maximum throughput and PF-based hybrid beamforming schemes for sum spectral efficiency, individual spectral efficiency, and fairness index

Advanced Radio Resource Management for Multi Antenna Packet Radio Systems

In this paper, we propose fairness-oriented packet scheduling (PS) schemes with power-efficient control mechanism for future packet radio systems. In general, the radio resource management functionality plays an important role in new OFDMA based networks. The control of the network resource division among the users is performed by packet scheduling functionality based on maximizing cell coverage and capacity satisfying, and certain quality of service requirements. Moreover, multiantenna transmit-receive schemes provide additional flexibility to packet scheduler functionality. In order to mitigate inter-cell and co-channel interference problems in OFDMA cellular networks soft frequency reuse with different power masks patterns is used. Stemming from the earlier enhanced proportional fair scheduler studies for single-input multiple-output (SIMO) and multiple-input multipleoutput (MIMO) systems, we extend the development of efficient packet scheduling algorithms by adding transmit power considerations in the overall priority metrics calculations and scheduling decisions. Furthermore, we evaluate the proposed scheduling schemes by simulating practical orthogonal frequency division multiple access (OFDMA) based packet radio system in terms of throughput, coverage and fairness distribution among users. As a concrete example, under reduced overall transmit power constraint and unequal power distribution for different sub-bands, we demonstrate that by using the proposed power-aware multi-user scheduling schemes, significant coverage and fairness improvements in the order of 70% and 20%, respectively, can be obtained, at the expense of average throughput loss of only 15%.Comment: 14 Pages, IJWM

Recent advances in radio resource management for heterogeneous LTE/LTE-A networks

As heterogeneous networks (HetNets) emerge as one of the most promising developments toward realizing the target specifications of Long Term Evolution (LTE) and LTE-Advanced (LTE-A) networks, radio resource management (RRM) research for such networks has, in recent times, been intensively pursued. Clearly, recent research mainly concentrates on the aspect of interference mitigation. Other RRM aspects, such as radio resource utilization, fairness, complexity, and QoS, have not been given much attention. In this paper, we aim to provide an overview of the key challenges arising from HetNets and highlight their importance. Subsequently, we present a comprehensive survey of the RRM schemes that have been studied in recent years for LTE/LTE-A HetNets, with a particular focus on those for femtocells and relay nodes. Furthermore, we classify these RRM schemes according to their underlying approaches. In addition, these RRM schemes are qualitatively analyzed and compared to each other. We also identify a number of potential research directions for future RRM development. Finally, we discuss the lack of current RRM research and the importance of multi-objective RRM studies

Scheduling strategies for LTE uplink with flow behaviour analysis

Long Term Evolution (LTE) is a cellular technology developed to support\ud diversity of data traffic at potentially high rates. It is foreseen to extend the capacity and improve the performance of current 3G cellular networks. A key\ud mechanism in the LTE traffic handling is the packet scheduler, which is in charge of allocating resources to active flows in both the frequency and time dimension. In this paper we present a performance comparison of two distinct scheduling schemes for LTE uplink (fair fixed assignment and fair work-conserving) taking into account both packet level characteristics and flow level dynamics due to the random user behaviour. For that purpose, we apply a combined analytical/simulation approach which enables fast evaluation of performance measures such as mean flow transfer times manifesting the impact of resource allocation strategies. The results show that the resource allocation strategy has a crucial impact on performance and that some trends are observed only if flow level dynamics are considered

Packet scheduling under imperfect channel conditions in Long Term Evolution (LTE)

University of Technology, Sydney. Faculty of Engineering and Information Technology.The growing demand for high speed wireless data services, such as Voice Over Internet Protocol (VoIP), web browsing, video streaming and gaming, with constraints on system capacity and delay requirements, poses new challenges in future mobile cellular systems. Orthogonal Frequency Division Multiple Access (OFDMA) is the preferred access technology for downlink Long Term Evolution (LTE) standardisation as a solution to the challenges. As a network based on an all-IP packet switched architecture, LTE employs packet scheduling to satisfy Quality of Service (QoS) requirements. Therefore, efficient design of packet scheduling becomes a fundamental issue. The aim of this thesis is to propose a novel packet scheduling algorithm to improve system performance for practical downlink LTE system. This thesis first focuses on time domain packet scheduling algorithms. A number of time domain packet scheduling algorithms are studied and some well-known time domain packet scheduling algorithms are compared in downlink LTE. A packet scheduling algorithm is identified that it is able to provide a better trade-off between maximizing the system performance and guaranteeing the fairness. Thereafter, some frequency domain packet schemes are introduced and examples of QoS aware packet scheduling algorithms employing these schemes are presented. To balance the scheduling performance and computational complexity and be tolerant to the time-varying wireless channel, a novel scheduling scheme and a packet scheduling algorithm are proposed. Simulation results show this proposed algorithm achieves an overall reasonable system performance. Packet scheduling is further studied in a practical channel condition environment which assumes imperfect Channel Quality Information (CQI). To alleviate the performance degradation due to simultaneous multiple imperfect channel conditions, a packet scheduling algorithm based on channel prediction and the proposed scheduling scheme is developed in downlink LTE system for GBR services. It was shown in simulation results that the Kalman filter based channel predictor can effectively recover the correct CQI from erroneous channel quality feedback, therefore, the system performance is significantly improved

Packet scheduling algorithms in LTE systems

University of Technology Sydney. Faculty of Engineering and Information Technology.There has been a huge increase in demand towards improving the Quality of Service (QoS) of wireless services. Long Term Evolution (LTE) is a development of the Third-Generation Partnership Project (3GPP) with the aim to meet the needs of International Telecommunication Union (ITU). Some of its aspects are highlighted as follows: increase in data rate, scalable bandwidth, reduced latency and increase in coverage and capacity that result in better quality of service in communication. LTE employs Orthogonal Frequency Division Multiple Access (OFDMA) to simultaneously deliver multimedia services at a high speed rate. Packet switching is used by LTE to support different media services. To meet the QoS requirements for LTE networks, packet scheduling has been employed. Packet scheduling decides when and how different packets are delivered to the receiver. It is responsible for smart user packet selection to allocate radio resources appropriately. Therefore, packet scheduling should be cleverly designed to achieve QoS that is similar to fixed line services. eNodeB is a node in LTE network which is responsible for radio resource management that involves packet scheduling. There are two main categories of application in multimedia services: RT (Real Time) and NRT (None Real Time) services. RT services are either delay sensitive (e.g. voice over IP), loss sensitive (e.g. Buffered Video) or both (delay &loss sensitive) for example video conferencing. Best effort users are an example of NRT services that do not have exact requisites and have been allocated to spare resources. Reaching higher throughput has sometimes resulted in unfair allocation to users who are located far from the base station or users who suffer from bad channel conditions. Therefore, a sufficient trade-off between throughput and fairness is essential. The scarce bandwidth, fading radio channels and the QoS requirement of the users, makes resource allocation a demanding issue. Different scheduling approaches have been suggested for different service demands described briefly throughout the thesis. Initially, a comprehensive literature review of existing work on the packet scheduling topic has been accomplished in this thesis to realize the characteristics of packet scheduling and the resource allocation for the wireless network. Many packet scheduling algorithms developed to provide satisfactory QoS for multimedia services in downlink LTE systems. Several algorithms considered in this thesis include time and frequency domain algorithms and their way of approach has been investigated. The next objective of this thesis is to improve the performance of packet scheduling in LTE downlink systems. A new packet scheduling algorithm has been introduced in this thesis. A study on VoLTE (Voice over LTE), video streaming and best effort traffic under three different scheduling algorithms has been conducted. Heterogeneous traffic based on precise modelling of packets has been used in the simulation. The main resource allocation and assignment technique used in this work namely Dynamic Subcarrier Allocation scheme is shown to provide a solution to solve the cross layer optimisation problem. It depends on Channel Quality Information (CQI) and has been broadly investigated for single carrier and multicarrier wireless networks. The problem is based on the maximisation of average utility functions. Different scheduling algorithms in this method consider to be utility functions. The throughput, fairness and Packet Loss Ratio have been considered as the requirements for examining the performance of algorithms. Simulation results show that the proposed algorithm significantly increases the performance of streaming and best effort users in terms of PLR and throughput. Fairness has also been improved with less computational complexity compared to previous algorithms that have been introduced in this thesis

Hybrid Radio Resource Management with Co-scheduling for Relay Extended OFDMA Networks

In orthogonal frequency division multiple access networks buffer aided non-transparent in-band half duplex decode and forward relay nodes aim to improve coverage and capacity under fairness considerations. Existing centralized radio resource management and inter cell interference coordination schemes achieve these goals at the cost of heavy signalling overhead. Especially for frequency division duplex downlink transmission this is an critical issue. Fully decentralized schemes often focus on different types of frequency reuse schemes with less amount of necessary feedback. Here, it is often overseen that in a practical deployment, the backhaul link quality is the bottleneck of the two hop transmission and needs to be taken into account. Moreover, it is often modelled way too optimistic and necessary co-scheduling with single hop UE further limits the possible data rate. In order to minimize the required overhead this work proposes a hybrid radio resource management (RRM) scheme. The RRM includes synchronous adapted two-hop proportional frequency selective resource scheduling as the decentralized part. Asynchronous subband power allocation scheme with very limited feedback is proposed to maximize the wireless backhaul link quality with no loss for single hop UE. Comprehensive system level simulation results show stable fairness and throughput when minimizing the required feedback and improvements for the backhaul links based on the centralized adapted power allocation including no losses in the overall system. In addition possible energy savings for the shared channel are presented when applying the proposed scheme