Hierarchical horizontally cross-tier scheduling for downlink in LTE-Advanced systems /
The mobile communication is tackled with a continuously growing demand for system with high date rate, wide coverage and bigger bandwidth with various network standards. However, the guarantee of high demand of data rate in the Long Term Evolution (LTE)-Advanced brings up vital challenges due to sim...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Kuala Lumpur :
Kulliyyah of Engineering, International Islamic University Malaysia,
2018
|
| Subjects: | |
| Online Access: | http://studentrepo.iium.edu.my/handle/123456789/4854 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The mobile communication is tackled with a continuously growing demand for system with high date rate, wide coverage and bigger bandwidth with various network standards. However, the guarantee of high demand of data rate in the Long Term Evolution (LTE)-Advanced brings up vital challenges due to simultaneous huge access of UEs. Generally, an intelligent radio resource allocation should be flexible to support all these exponentially increasing demands. The radio resource allocation in Long Term Evolution (LTE)-Advanced system is an active research area within the mobile telecommunication field. A lot of work has been done to overcome radio resource scheduling problems using different packet scheduling algorithms. Despite these achievements, there are still rooms for introducing new systems with advanced abilities to fulfill the requirements of the exponential growth of demands on the traffic with high data rate. This thesis presents hierarchical horizontally cross-tier scheduling algorithms for downlink (DL) in LTE-Advanced systems with carrier aggregation (CA). Its aim is to satisfy Quality of Service (QoS) requirements for a variety of applications by attempting to achieve an optimal trade-off between maximum system throughput and fairness. The proposed radio resource algorithms in the LTE-Advanced system with CA are a critical system component with a significant impact on system performance. The problem of radio resource scheduling was formulated and an efficient and an optimal joint proportional fair packet scheduling algorithms were proposed and their performance were optimized using linear balance factor and parallel particle swarm optimization scheme, respectively. The analytical model has been proposed for the a novel packet scheduling for DL in LTE-Advanced systems with CA algorithm which utilizes novel Efficient Joint Proportional Fair (EPF) and Joint Proportional Fair with Parallel Particle Swarm Optimization (JPF-PPSO) with a different number of the User Equipment (UEs) and different percentage of LTE-Advanced UEs. This analysis is carried out using objective and constraints equations to cover broad UEs number starting from 0 to 80 UEs per cell with various proportions of LTE-Advanced UEs. The average throughput and fairness characteristics of the algorithms were derived based on design parameters. Comparative analysis is conducted to compare results of the proposed algorithm and against other well kwon algorithms in the literature. The comparative analysis showed that the proposed algorithms strike a balance among different traditional algorithms and satisfy the fairness criterion inherent to scheduling algorithms while improving the throughput performance. Further, an optimal algorithm is proposed which utilizes a novel Modified-Largest Weight Delay First (M-LWDF) instead of the EPF and JPF-PPSO because of the novel M-LWDF supporting mixed traffic QoS requirements while the EPF cannot support Real Time traffic flow requirements. The MPSO algorithm considers different factors like queue characteristics, traffic characteristics and channel characteristics. For GBR services with strict QoS requirements, it shows that can be optimized by restricting allocation to realistic constraints and granting UE capacity maximization. For NGBR services, it is solved in such a manner that the minimum throughput of the UE to satisfy the requirements in guaranteed. Finally, the optimal algorithm results outperform the other algorithms in term of average UE throughput, PLR, delay and fairness performance. |
|---|---|
| Physical Description: | xxi, 151 leaves : illustrations ; 30cm. |
| Bibliography: | Includes bibliographical references (leaves 129-137). |