Radio resource management for OFDMA systems under practical considerations.

Orthogonal frequency division multiple access (OFDMA) is used on the downlink of broadband wireless access (BWA) networks such as Worldwide Interoperability for Microwave Access (WiMAX) and Long Term Evolution (LTE) as it is able to offer substantial advantages such as combating channel impairments and supporting higher data rates. Also, by dynamically allocating subcarriers to users, frequency domain diversity as well as multiuser diversity can be effectively exploited so that performance can be greatly improved. The main focus of this thesis is on the development of practical resource allocation schemes for the OFDMA downlink. Imperfect Channel State Information (CSI), the limited capacity of the dedicated link used for CSI feedback, and the presence of a Connection Admission Control (CAC) unit are issues that are considered in this thesis to develop practical schemes. The design of efficient resource allocation schemes heavily depends on the CSI reported from the users to the transmitter. When the CSI is imperfect, a performance degradation is realized. It is therefore necessary to account for the imperfectness of the CSI when assigning radio resources to users. The first part of this thesis considers resource allocation strategies for OFDMA systems, where the transmitter only knows the statistical knowledge of the CSI (SCSI). The approach used shows that resources can be optimally allocated to achieve a performance that is comparable to that achieved when instantaneous CSI (ICSI) is available. The results presented show that the performance difference between the SCSI and ICSI based resource allocation schemes depends on the number of active users present in the cell, the Quality of Service (QoS) constraint, and the signal-to- noise ratio (SNR) per subcarrier. In practical systems only SCSI or CSI that is correlated to a certain extent with the true channel state can be used to perform resource allocation. An approach to quantifying the performance degradation for both cases is presented for the case where only a discrete number of modulation and coding levels are available for adaptive modulation and coding (AMC). Using the CSI estimates and the channel statistics, the approach can be used to perform resource allocation for both cases. It is shown that when a CAC unit is considered, CSI that is correlated with its present state leads to significantly higher values of the system throughput even under high user mobility. Motivated by the comparison between the correlated and statistical based resource allocation schemes, a strategy is then proposed which leads to a good tradeoff between overhead consumption and fairness as well as throughput when the presence of a CAC unit is considered. In OFDMA networks, the design of efficient CAC schemes also relies on the user CSI. The presence of a CAC unit needs to be considered when designing practical resource allocation schemes for BWA networks that support multiple service classes as it can guarantee fairness amongst them. In this thesis, a novel mechanism for CAC is developed which is based on the user channel gains and the cost of each service. This scheme divides the available bandwidth in accordance with a complete partitioning structure which allocates each service class an amount of non-overlapping bandwidth resource. In summary, the research results presented in this thesis contribute to the development of practical radio resource management schemes for BWA networks

Resource management in QoS-aware wireless cellular networks

2011 Summer.Includes bibliographical references.Emerging broadband wireless networks that support high speed packet data with heterogeneous quality of service (QoS) requirements demand more flexible and efficient use of the scarce spectral resource. Opportunistic scheduling exploits the time-varying, location-dependent channel conditions to achieve multiuser diversity. In this work, we study two types of resource allocation problems in QoS-aware wireless cellular networks. First, we develop a rigorous framework to study opportunistic scheduling in multiuser OFDM systems. We derive optimal opportunistic scheduling policies under three common QoS/fairness constraints for multiuser OFDM systems--temporal fairness, utilitarian fairness, and minimum-performance guarantees. To implement these optimal policies efficiently, we provide a modified Hungarian algorithm and a simple suboptimal algorithm. We then propose a generalized opportunistic scheduling framework that incorporates multiple mixed QoS/fairness constraints, including providing both lower and upper bound constraints. Next, taking input queues and channel memory into consideration, we reformulate the transmission scheduling problem as a new class of Markov decision processes (MDPs) with fairness constraints. We investigate the throughput maximization and the delay minimization problems in this context. We study two categories of fairness constraints, namely temporal fairness and utilitarian fairness. We consider two criteria: infinite horizon expected total discounted reward and expected average reward. We derive and prove explicit dynamic programming equations for the above constrained MDPs, and characterize optimal scheduling policies based on those equations. An attractive feature of our proposed schemes is that they can easily be extended to fit different objective functions and other fairness measures. Although we only focus on uplink scheduling, the scheme is equally applicable to the downlink case. Furthermore, we develop an efficient approximation method--temporal fair rollout--to reduce the computational cost

A new genetic algorithm based scheduling algorithm for the LTE Uplink

Tese (Doutorado)Long Term Evolution has become the de facto technology for the 4G networks. It aims to deliver unprecedented data transmission rates and low latency for several types of applications and services. In this context, this thesis investigates the resource allocation in the LTE uplink. From the principle that resource allocation in the uplink is a complex optimization problem, the main contribution of this thesis is a novel scheduling algorithm based on Genetic Algorithms (GA). This algorithm introduces new operations of initialization, crossover, mutation and a QoS-aware fitness function. The algorithm is evaluated in a mixed traffic environment and its performance is compared with relevant algorithms from the literature. Simulations were carried out in ns-3 and the results show that the proposed algorithm is able to meet the Quality of Service (QoS) requirements of the applications, while presenting a satisfactory execution time

Fairness-Oriented and QoS-Aware Radio Resource Management in OFDMA Packet Radio Networks: Practical Algorithms and System Performance

During the last two decades, wireless technologies have demonstrated their importance in people’s personal communications but also as one of the fundamental drivers of economic growth, first in the form of cellular networks (2G, 3G and beyond) and more recently in terms of wireless computer networks (e.g. Wi-Fi,) and wireless Internet connectivity. Currently, the development of new packet radio systems is evolving, most notably in terms of 3GPP Long Term Evolution (LTE) and LTE-Advanced, in order to utilize the available radio spectrum as efficiently as possible. Therefore, advanced radio resource management (RRM) techniques have an important role in current and emerging future mobile networks. In all wireless systems, the data throughput and the average data delay performance, especially in case of best effort services, are greatly degraded when the traffic-load in the system is high. This is because the radio resources (time, frequency and space) are shared by multiple users. Another big problem is that the transmission performance can vary heavily between different users, since the channel state greatly depends on the communication environment and changes therein. To solve these challenges, new major technology innovations are needed. This thesis considers new practical fairness-oriented and quality-of-service (QoS) -aware RRM algorithms in OFDMA-based packet radio networks. Moreover, using UTRAN LTE radio network as application example, we focus on analyzing and enhancing the system-level performance by utilizing state-of-the-art waveform and radio link developments combined with advanced radio resource management methods. The presented solutions as part of RRM framework consist of efficient packet scheduling, link adaptation, power control, admission control and retransmission mechanisms. More specifically, several novel packet scheduling algorithms are proposed and analyzed to address these challenges. This dissertation deals specifically with the problems of QoS provisioning and fair radio resource distribution among users with limited channel feedback, admission and power control in best effort and video streaming type traffic scenarios, and the resulting system-level performance. The work and developments are practically-oriented taking aspects like finite channel state information (CSI), reporting delays and retransmissions into account. Consequently, the multi-user diversity gain with opportunistic frequency domain packet scheduling (FDPS) is further explored in spatial domain by taking the multiantenna techniques and spatial division multiplexing functionalities into account. Validation and analysis of the proposed solutions is performed through extensive system level simulations modeling the behavior and operation of a complete multiuser cell in the overall network. Based on the obtained performance results, it is confirmed that greatly improved fairness can be fairly easily built in to the scheduling algorithm and other RRM mechanisms without considerably degrading e.g. the average cell throughput. Moreover, effective QoS-provisioning framework in video streaming type traffic scenarios demonstrate the effectiveness of the presented solutions as increased system capacity measured in terms of the number of users or parallel streaming services supported simultaneously by the network

A Review of MAC Scheduling Algorithms in LTE System

The recent wireless communication networks rely on the new technology named Long Term Evolution (LTE) to offer high data rate real-time (RT) traffic with better Quality of Service (QoS) for the increasing demand of customer requirement. LTE provide low latency for real-time services with high throughput, with the help of two-level packet retransmission. Hybrid Automatic Repeat Request (HARQ) retransmission at the Medium Access Control (MAC) layer of LTE networks achieves error-free data transmission. The performance of the LTE networks mainly depends on how effectively this HARQ adopted in the latest communication standard, Universal Mobile Telecommunication System (UMTS). The major challenge in LTE is to balance QoS and fairness among the users. Hence, it is very essential to design a down link scheduling scheme to get the expected service quality to the customers and to utilize the system resources efficiently. This paper provides a comprehensive literature review of LTE MAC layer and six types of QoS/Channel-aware downlink scheduling algorithms designed for this purpose. The contributions of this paper are to identify the gap of knowledge in the downlink scheduling procedure and to point out the future research direction. Based on the comparative study of algorithms taken for the review, this paper is concluded that the EXP Rule scheduler is most suited for LTE networks due to its characteristics of less Packet Loss Ratio (PLR), less Packet Delay (PD), high throughput, fairness and spectral efficiency