Abstract
The fast evolution of the number of wireless users and the emergence of new multimedia services have motivated third-generation partnership project (3GPP) to develop new radio access technologies. Thus, the carrier aggregation (CA) was introduced from version 10 long-term evolution (LTE), known as long-term evolution-advanced (LTE-A), to meet the increasing demands in terms of throughput and bandwidth and to ensure the Quality of Service (QoS) for different classes of bearers in LTE networks. However, such solution stills inefficient until implementing good resources management scheme. Several scheduling mechanisms have been proposed in the literature, to guarantee the QoS of different classes of bearers in LTE-A and 5G networks. Nevertheless, most of them promote high-priority bearers. In this study, a new approach of uplink scheduling resources has been developed. It aims to ensure service fairness of different traffic classes that allocates bearers over LTE-A and 5G networks. Also, it raises the number of admitted users in the network by increasing the number of admitted bearers through a dynamic management of service priorities. In fact, the low-priority traffic classes, using low-priority bearers, are favoured during a specific time interval, based on the average waiting time for each class. Simulation results show that the QoS parameters were much improved for the low-priority classes without significantly affecting the QoS of high priority ones.
Highlights
Long-term evolution-advanced (LTE-A) and 5th generation (5G) networks have become the most promising telecommunication technologies, thanks to the aggregation of carrier components. is offers a greater bandwidth with a higher throughput, meets the growing demands of mobile traffic, and maximizes the number of admitted users in the network
Mathematical Model of the New Courteous Scheduling System. is section describes the mathematical model we developed corresponding to the new courteous algorithm, which improves the network resources scheduling over the long-term evolution (LTE)-A and 5G networks
Three simulation scenarios were performed. e first scenario is related to the simulation of the scheduling scheme without applying any courteous algorithm; this is known as the basic scenario, where the handoff traffic will have the higher priority and will be served according to the Priority Queuing (PQ) politic. e second scenario, called the first conception, implements the case of applying the new courteous algorithm for the RT traffic only, which gives the higher priority to this traffic
Summary
Long-term evolution-advanced (LTE-A) and 5th generation (5G) networks have become the most promising telecommunication technologies, thanks to the aggregation of carrier components. is offers a greater bandwidth with a higher throughput, meets the growing demands of mobile traffic, and maximizes the number of admitted users in the network. E solution given in [8] improves the QoS for low-priority traffics by restraining the number of accepted new calls when their admitted threshold number is met In this last approach, the blocking probability of handoff calls and new calls are selected based on threshold values. Our paper proposes a new approach of uplinkscheduling resources It aims to ensure service fairness for different traffic classes allocating different bearers over LTEA and 5G networks. It presents the algorithm developed in this study and describes the mathematical model of our new scheme.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
