Group scheduling in cellular networks
Metadata[+] Show full item record
With the ever increasing number of users and the usage of data in cellular networks, meeting the expectations is a very difficult challenge. To add to the difficulties, the available resources are very limited, so proper management of these resources is very much needed. Scheduling is a key component and having a scheduling scheme which can meet the Qos requirements such as Throughput, Fairness and Delay is important. A new dimension to scheduling known as Group Scheduling has been designed in this project. Common scheduling schemes, which include Maximum Carrier to Interference, Round Robin, Proportional Fair and Modified Largest Weighted Delay First, have been studied and analyzed. In a network where the users are divided into a number of groups, such as Public Safety which has Fire, Health and Police, the Group Scheduling scheme is designed to find the right balance between Throughput and Fairness. It allocates the resources to the best available group and the best available user inside that particular group based on a contention mechanism which takes into account the location of the user and the fast varying channel conditions for that user. The Proportional Fair scheme has been used as the basis for this Group Scheduling scheme and results have been simulated to show that it performs better than the other scheduling schemes studied for this project. Also, the scheme has been shown to be highly reliable.
Table of Contents
Introduction -- Background -- Code implementation -- Results and analysis