Improved Scheduler for Long Term Evolution (Lte) Downlink Transmission

Long term evolution (LTE) Network is often faced with the challenge of meeting up with the quality of service (QoS) requirement of the different services supported in the Network. Maintaining a trade-off between system throughput and fairness among users when making radio resources scheduling decisions is a very sensitive issue. Several algorithms have been proposed to this effect by different researchers in an attempt to manage the limited radio resources. One of well-known packet schedulers known as M-LWDF algorithm is known to support both real time and non-real time services. This algorithm has been found not to support real time services at a sufficient level. This is due to the fact that head of line (HOL) delay and packet delay not sufficient to balance the scheduling decision to real time services thereby degrading its performance. This research work was an attempt to improve the performance of MLWDF by incorporating bandwidth of flow,, which is directly proportional to flow weight and reserved rate .This approach used the uncertainty principle of fuzzy logic to calculate new weight for the different flows, by considering two input parameters from the network which are latency requirement for real time traffic and throughput for non-real time traffic .The performance of this algorithm was compared with PF,M-LWDF and EXP/PF schemes using system throughput, packet loss rate, delay and fairness as a performance indices in an LTE simulator. Results showed that when I-MLWDF was used, the aggregate throughput for video and VOIP increases considerably by 9.8% and 0.1% respectively when the cell was loaded by 60 users and the throughput for non- real time flow showed degraded performance of about 90%as against MLWDF. The improved scheme showed that the packet loss rate for video flow decreases by about 35.71% and 75% when compared with EXP/PF and MLWDF respectively. The acceptable packet loss rate for VOIP flow is under 3% for both algorithm and the improved scheme showing better result by about 20%compared to MLWDF. The packet loss rate for non-real time flow for I-MLWDF showed a poor performance of about 95% as against MLWDF.The delay for video, VOIP for the improved scheme is under 0.05s and 0.007s respectively as against MLWDF with delays under 0.07s and 0.02s for video and VOIP respectively, when the cell was loaded with 60 users. Also the delay for I-MLWDF showed higher delay of 98% as compared to MLWDF. Fairness index for video flow for I-MLWDF is 20% better than MLWDF. Both algorithms showed performance level between 98.5% and 99.5% for fairness index for VOIP flow with I-MLWDF showing improved performance of about 0.2% increase better than M-LWDF. However, the highest fairness index was presented by MLWDF and PF that reach a level above 99% whereas I-MLWDF showed the worst result that reach a level of about 93%.

Cellular communication was designed to ameliorate the flaws of traditional wireless and wired communication networks providing communication between moving units and/or stationary units and vice versa[1]. The moving units are referred to as mobile stations while the stationary units are referred to as land fixed units. Some of the flaws encountered in traditional wireless communication networks range from their inability to cope with the travelling speed of fast mobile units; to its low capacity and poor data rate.

Cellular communication divides its coverage region into small regions called cells; hence, the terminology “cellular”. This concept of cellular co mmunication began to appear in Bell System proposals during the late 1970s [1, 2]. Cell size is dynamic and is dependent on the population (traffic) in the region to be covered. However, it is set by the transmitter power and the frequency of operation of the cell. To manage scarce frequency resources and meet the requirement of users, cells apply techniques like frequency hopping, frequency re-use and cell splitting [3].