Traffic Scheduling for LTE Advanced

Abstract: Long Term Evolution (LTE) is becoming the first choice of operators when constructingthe new network infrastructure, because of its high throughput and lowlatency. Although the LTE can offer high speed data service as a benefit of widebandapplication, the large bandwidth also results in huge control signaling cost.This thesis studies how the available radio resources should be allocated todifferent users for the particular purpose. Three proposals are presented in thisthesis. The first two aim at maximizing the overall net capacity. The factors ofchannel conditions and control signaling cost are considered in the first proposalwhereas power control is supplemented as an additional factor in the second one.The third proposal aims at achieving a tradeoff between subframe efficiency andaverage data rate. Channel conditions and control signaling cost are taken intoconsideration.Resource blocks scheduling under a control signaling cost constraint is feasiblewith the knowledge of the channel condition of users. This is obtained from channelstate information directly. The first proposal studies how this scheduling isdone. The second proposal takes power allocation scheme into account. In termsof computational complexity, the methods of internal water-filling and externalwater-filling are described in the second proposal. The simulation results illustratethat the net capacity in the first proposal can be enhanced by about 5% -60% in the second proposal. The exact percentage of increase depends on differentcontrol signaling penalty.The third proposal discusses how to implement flexible subframe length underthe Rayleigh fading channel condition in the LTE system. The objective is toachieve subframe efficiency as high as possible, while maintaining the maximumaverage data rate. The simulation results illustrate that the optimal subframelength depends on control signaling cost penalty as well as on Doppler frequency.Finally, the fairness of the first proposal is compared with the improved versionsof Round Robin, Dynamic Allocation and Proportional Fair scheduling algorithms.The simulation results show that Round Robin and Dynamic Allocationoutperform the first proposal under a certain condition.