Priority-Based Resource Allocation for Downlink OFDMA Systems Supporting RT and NRT Traffics

Efficient radio resource management is essential in Quality-of-Service (QoS) provisioning for wireless communication networks. In this paper, we propose a novel priority-based packet scheduling algorithm for downlink OFDMA systems. The proposed algorithm is designed to support heterogeneous applications consisting of both real-time (RT) and non-real-time (NRT) traffics with the objective to increase the spectrum efficiency while satisfying diverse QoS requirements. It tightly couples the subchannel allocation and packet scheduling together through an integrated cross-layer approach in which each packet is assigned a priority value based on both the instantaneous channel conditions as well as the QoS constraints. An efficient suboptimal heuristic algorithm is proposed to reduce the computational complexity with marginal performance degradation compared to the optimal solution. Simulation results show that the proposed algorithm can significantly improve the system performance in terms of high spectral efficiency and low outage probability compared to conventional packet scheduling algorithms, thus is very suitable for the downlink of current OFDMA systems

Packet scheduling for AMC-based OFDMA wireless communication systems

In this thesis, we propose a basic priority and fairness (BPF) and a modified priority and fairness (MPF) based packet scheduling algorithms for adaptive modulation and coding (AMC) scheme based orthogonal frequency division multiple access (OFDMA) wireless communication systems supporting both real time (RT) and non-real time (NRT) traffics. In the AMC based OFDMA systems considered in this thesis, multiple access is achieved by assigning subchannels, each of which consists of a set of subcarriers, to individual users, and the modulation and coding scheme on each subchannel is determined adaptively according to the time-varying channel conditions. In the proposed packet scheduling algorithms, various traffics are transmitted in a sequence determined by their priorities on each subchannel, jointly considering the fairness among users and subchannels. Simulation results show that the proposed algorithms are able to satisfy various quality of service (QoS) requirements, like packet loss rate, delay, or throughput, for a variety of RT and NRT traffics such as voice, video, WWW and email. Also, the proposed BPF and MPF packet scheduling algorithms can support more users than some existing packet scheduling algorithms under the same QoS requirements

Performance analysis of EXP/PF and M-LWDF in downlink 3GPP LTE system

This paper investigates the performance of exponential/proportional fair (EXP/PF) and maximum-largest weighted delay first (M-LWDF) scheduling algorithms in the third generation partnership project long term evolution (3GPP LTE) providing packet-switched multimedia services. It, then, identifies a suitable packet scheduling algorithm on a basis of their performance evaluation. The performance evaluation is conducted in terms of system throughput, average real time (RT) and non-real time (NRT) throughput, packet loss for RT service and fairness for NRT service. A video streaming traffic is used to model the RT service, while a web-browsing traffic is modelled for NRT service. Simulation results show that at lower load M-LWDF algorithm provides better performance than EXP/PF while as the load increases the EXP/PF gives better performance. ©2009 IEEE

Enhanced exponential rule scheduling algorithm for real-time traffic in LTE network

Nowadays, mobile communication is growing rapidly and become an everyday commodity. The vast deployment of real-time services in Long Term Evolution (LTE) network demands for the scheduling techniques that support the Quality of Service (QoS) requirements. LTE is designed and implemented to fulfill the users’ QoS. However, 3GPP does not define the specific scheduling technique for resource distribution which leads to vast research and development of the scheduling techniques. In this context, a review of the recent scheduling algorithm is reported in the literature. These schedulers in the literature cause high Packet Loss Rate (PLR), low fairness, and high delay. To cope with these disadvantages, we propose an enhanced EXPRULE (eEXPRULE) scheduler to improve the radio resource utilization in the LTE network. Extensive simulation works are carried out and the proposed scheduler provides a significant performance improvement for video application without sacrificing the VoIP performance. The eEXPRULE scheduler increases video throughput, spectrum efficiency, and fairness by 50%, 13%, and 11%, respectively, and reduces the video PLR by 11%

이동통신 네트워크에서의 QoS 패킷 스케줄러 설계 및 고정 릴레이 관련 주파수 재사용 관리 기법 연구

학위논문 (박사)-- 서울대학교 대학원 공과대학 전기·컴퓨터공학부, 2017. 8. 박세웅.The main interest of this paper is to understand a basic approach to provide more efficient method to allocate radio resources in the mobile communication systems, especially in which radio resources could be allocated by both frequency and time division multiple access. So, we consider OFDMA system and the ideas described in this paper could be easily applied to the current and next generation mobile communication systems. This paper studies two basic research themesa QoS packet scheduler design and fixed relay resource management policies based on frequency reuse in mobile networks. This paper considers novel scheduler structures that are executable in the environments of multiple traffic classes and multiple frequency channels. To design a scheduler structure for multiple traffic classes, we first propose a scheduler selection rule that uses the priority of traffic class and the urgency level of each packet. Then we relax the barrier of traffic class priority when a high priority packet has some room in waiting time. This gives us a chance to exploit multiuser diversity, thereby giving more flexibility in scheduling. Our considered scheduler can achieve higher throughput compared to the simple extension of conventional modified largest weighted delay first (MLWDF) scheduler while maintaining the delay performance for QoS class traffic. We also design a scheduler structure for multiple frequency channels that chooses a good channel for each user whenever possible to exploit frequency diversity. The simulation results show that our proposed scheduler increases the total system throughput by up to 50% without degrading the delay performance. This paper also introduces radio resource management schemes based on frequency reuse for fixed relay stations in mobile cellular networks. Mobile stations in the cell boundary experience poor spectral efficiency due to the path loss and interference from adjacent cells. Therefore, satisfying QoS requirements of each MS at the cell boundary has been an important issue. To resolve this spectral efficiency problem at the cell boundary, deploying fixed relay stations has been actively considered. In this paper, we consider radio resource management policies based on frequency reuse for fixed relays that include path selection rules, frequency reuse pattern matching, and frame transmission pattern matching among cells. We evaluate performance of each policy by varying parameter values such as relay stations position and frequency reuse factor. Through Monte Carlo simulations and mathematical analysis, we suggest some optimal parameter values for each policy and discuss some implementation issues that need to be considered in practical deployment of relay stations. We also surveyed further works that many researchers have been studied to tackle the similar problems of QoS scheduling and resource management for relay with our proposed work. We expect that there would be more future works by priority-based approach and energy-aware approach for QoS scheduling. Also current trends such as the rising interest in IoT system, discussion of densification of cells and D2D communications in 5G systems make us expect that the researches in these topics related with relays would be popular in the future. We also think that there are many interesting problems regarding QoS support and resource management still waiting to be tackled, especially combined with recent key topics in mobile communication systems such as 5G standardization, AI and NFV/SDN.Chapter 1 Introduction 1 1.1 QoS Packet Scheduler 4 1.2 Fixed Relay Frequency Reuse Policies 6 Chapter 2 Scheduler Design for Multiple Traffic Classes in OFDMA Networks 10 2.1 Proposed Schedulers 10 2.1.1 Scheduler Structures 12 2.1.2 MLWDF scheduler for Multiple Traffic Classes 13 2.1.3 Joint Scheduler 13 2.2 System Model 18 2.3 Performance Evaluation 19 2.3.1 Schedulers for Multiple Traffic Classes 20 2.3.2 Impact of Scheduler Selection Rule 25 2.3.3 Frame Based Schedulers 27 2.3.4 Impact of Partial Feedback 30 2.3.5 Adaptive Threshold Version Schedulers 33 2.4 Conclusion 36 Chapter 3 Frequency Reuse Policies for Fixed Relays in Cellular Networks 40 3.1 System Model 40 3.1.1 Frame Transmission and Frequency Reuse Patterns among RSs 42 3.1.2 Positioning of RSs and Channel Capacity 44 3.1.3 Area Spectral Efficiency 45 3.2 Radio Resource Management Policies Based on Frequency Reuse 46 3.2.1 Path Selection Rule 46 3.2.2 Frequency Reuse and Frame Transmission Pattern Matchings among Cells 52 3.3 Monte Carlo Simulation and Results 53 3.4 Consideration of Practical Issues 80 3.5 Conclusion 81 Chapter 4 Surveys of Further Works 83 4.1 Further Works on QoS Schedulers 83 4.1.1 WiMAX Schedulers 85 4.1.2 LTE Schedulers 92 4.2 Further Works on Radio Resource Management in Relay Systems 98 4.3 Future Challenges 100 Chapter 5 Conclusion 104 Bibliography 107 초록 127Docto

Handover management strategies in LTE-advanced heterogeneous networks.

Doctoral Degree. University of KwaZulu-Natal, Durban.Meeting the increasing demand for data due to the proliferation of high-specification mobile devices in the cellular systems has led to the improvement of the Long Term Evolution (LTE) framework to the LTE-Advanced systems. Different aspects such as Massive Multiple-Input Multiple Output (MIMO), Orthogonal Frequency Division Multiple Access (OFDMA), heterogeneous networks and Carrier Aggregation have been considered in the LTE-Advanced to improve the performance of the system. The small cells like the femtocells and the relays play a significant role in increasing the coverage and the capacity of the mobile cellular networks in LTE-Advanced (LTE-A) heterogeneous network. However, the user equipment (UE) are faced with the frequent handover problems in the heterogeneous systems than the homogeneous systems due to the users‟ mobility and densely populated cells. The objective of this research work is to analyse the handover performance in the current LTE/LTE-A network and to propose various handover management strategies to handle the frequent handover problems in the LTE-Advance heterogeneous networks. To achieve this, an event driven simulator using C# was developed based on the 3GPP LTE/LTE-A standard to evaluate the proposed strategies. To start with, admission control which is a major requirement during the handover initiation stage is discussed and this research work has therefore proposed a channel borrowing admission control scheme for the LTE-A networks. With this scheme in place, resources are better utilized and more calls are accepted than in the conventional schemes where the channel borrowing is not applied. Also proposed is an enhanced strategy for the handover management in two-tier femtocell-macrocell networks. The proposed strategy takes into consideration the speed of user and other parameters in other to effectively reduce the frequent and unnecessary handovers, and as well as the ratio of target femtocells in the system. We also consider scenarios such as the one that dominate the future networks where femtocells will be densely populated to handle very heavy traffic. To achieve this, a Call Admission Control (CAC)-based handover management strategy is proposed to manage the handover in dense femtocell-macrocell integration in the LTE-A network. The handover probability, the handover call dropping probability and the call blocking probability are reduced considerably with the proposed strategy. Finally, the handover management for the mobile relays in a moving vehicle is considered (using train as a case study). We propose a group handover strategy where the Mobile Relay Node (MRN) is integrated with a special mobile device called “mdev” to prepare the group information prior to the handover time. This is done to prepare the UE‟s group information and services for timely handover due to the speed of the train. This strategy reduces the number of handovers and the call dropping probability in the moving vehicle.Publications and conferences listed on page iv-v

Traffic Scheduling in Point-to-Multipoint OFDMA-based Systems

The new generation of wireless networks (e.g., WiMAX, LTE-Advanced, Cognitive Radio) support many high resource-consuming services (e.g., VoIP, video conference, multiplayer interactive gaming, multimedia streaming, digital video broadcasting, mobile commerce). The main problem of such networks is that the bandwidth is limited, besides to be subject to fading process, and shared among multiple users. Therefore, a combination of sophisticated transmission techniques (e.g., OFDMA) and proper packet scheduling algorithms is necessary, in order to provide applications with suitable quality of service. This Thesis addresses the problem of traffic scheduling in Point-to-Multipoint OFDMA-based systems. We formally prove that in such systems, even a simple scheduling problem of a Service Class at a time, is NP-complete, therefore, computationally intractable. An optimal solution is unfeasible in term of time, thus, fast and simple scheduling heuristics are needed. First, we address the Best Effort traffic scheduling issue, in a system adopting variable-length Frames, with the objective of producing a legal schedule (i.e., the one meeting all system constraints) of minimum length. Besides, we present fast and simple heuristics, which generate suboptimal solutions, and evaluate their performance in the average case, as in the worst one. Then, we investigate the scheduling of Real Time traffic, with the objective of meeting as many deadlines as possible, or equivalently, minimizing the packet drop ratio. Specifically, we propose two scheduling heuristics, which apply two different resource allocation mechanisms, and evaluate their average-case performance by means of a simulation experiment

DESIGN AND DEVELOPMENT OF CARRIER ASSIGNMENT AND PACKET SCHEDULING IN LTE-A AND Wi-Fi

The highly competitive environment in today's wireless and cellular network industries is making the management of systems seek for better and more advance techniques to keep masses of data, complexity of systems and deadline constrains under control with a lower cost and higher efficiency. Therefore, the management is getting significant attentions by researchers in order to increase the efficiency of the resource usage to provide high quality services. Two of the cornerstones of the management system in wireless and cellular network are carrier assignment and packet scheduling. Therefore, this work focuses on analysis and development of carrier assignment and packet scheduling methods in multi-band Wi-Fi and LTE-A networks. First, several existing carrier assignment methods which are developed by considering different strategists in LTE and LTE-A are analyzed. Secondly, a new technique for the carrier assignment methods for LTE and LTE-A is developed to improve the efficiency of carrier assignment methods. Thirdly, a novel carrier assignment method is proposed by considering the behaviors of mobile users for LTE and LTE-A. Then, a novel architecture with packet scheduling scheme is proposed for next generation mobile routers in multi-band Wi-Fi environment as similar to LTE-A. Finally, the scheme is improved based on energy awareness. Results show that the developed methods improve the performance of the systems in comparison to existing methods. The proposed methods and related analysis should help network engineers and service providers build next generation carrier assignment and packet scheduling methods to satisfy users in LTE, LTE-A and Wi-Fi

Design and analysis of scheduling algorithms for next generation broadband wireless access systems

Efficient utilization of network resources is a key goal for emerging Broadband Wireless Access Systems (BWAS). This is a complex goal to achieve due to the heterogeneous service nature and diverse Quality of Service (QoS) requirements of various applications that BWAS support. Packet scheduling is an important activity that affects BWAS QoS outcomes. This thesis proposes a new packet scheduling mechanism that improves QoS in mobile wireless networks which exploit IP as a transport technology for data transfer between BWAS base stations and mobile users at the radio transmission layer. In order to improve BWAS QoS the new packet algorithm makes changes at both the IP and the radio layers. The new packet scheduling algorithm exploits handoff priority scheduling principles and takes into account buffer occupancy and channel conditions. The packet scheduling mechanism also incorporates the concept of fairness. The algorithm also offers an opportunity to maximize the carriers’ revenue at various traffic situations. Performance results were obtained by computer simulation and compared to the well-known algorithms. Results show that by exploiting the new packet scheduling algorithm, the transport system is able to provide a low handoff packet drop rate, low packet forwarding rate, low packet delay, ensure fairness amongst the users of different services and generates higher revenue for the telecom carriers. Furthermore this research proposes a new and novel measure named “satisfaction factor to measure the efficacy of various scheduling schemes and finally this s research also proposes four performance measurements metric for NodeB’s of Next Generation Wireless Network