Abstract

Modern wireless communication depends on moving. This means that there is an increasing demand for wireless applications with high data rates and low errors while the user is moving. This is because of the increasing use of online gaming, web browsing, and exchanging data within the network. This increasing demand with the increasing users in the network leads to having a heavy network in some areas and an empty one in other areas. the problem here is that if the new network does not have an available channel to be used, the user performs scheduling to wait until it has a channel to connect. Because of this, studying scheduling algorithms depend on the Quality-of-Service (QoS) of the network becomes an important topic to research. In this paper, three user scheduling algorithms are used to evaluate the performance of a Multi-User Single-Input Single-Output (MU-SISO) network based on the Block Error Rate (BLER) and throughput. The three algorithms are the Maximum Throughput, Round Robin (RR), and Proportional Fair (PF) algorithms. The study is performed under changing the bandwidth of the network and the number of users that connected to the single antenna. The carrier frequency used is the 2.6 GHz to satisfy the Vehicular Long Term Evolution (LTE-V) with the high-speed scenario. The simulation results show that the RR is suitable to use when the highway scenario is used in case of attention to the error rates while the maximum throughput is useful to use when maximizing the network throughput is important.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.