Exploiting the ability of Self Organizing Networks for inter-cell interference coordination for emergency communications in cellular networks

Title from PDF of title page, viewed on June 15, 2015Thesis advisor: Cory BeardVitaIncludes bibliographic references (pages 56-57)Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2014In the current scenario, radio planning of wireless cellular networks and analysis of radio performance should be agile because it is expected that in the near future we will be reaching to the point where there will be as many mobile devices as people in the world. So, there should be a rapid revolution in technology which can aid in the management of resources and maximization of throughput to satisfy users effectively. LTE and LTE-Advanced is designed to meet high bit rate service requirements; however, the initial challenge of the wireless channel, such as limited spectrum, leads to frequency reuse but also irrevocable interference. This thesis gives a holistic conspectus of interference coordination in LTE cellular systems utilizing the ability of Self Organizing Networks (SON). LTE uses a universal frequency reuse concept and the only interference observed in LTE is inter-cell interference. In a network where users are randomly distributed over three cells, it manages resources between the base stations by restricting some resource blocks for Cell Edge Users (CEU) of the neighboring cell and other resource blocks for Cell Center Users (CCU). This is done in a semi-static approach by taking into account the location of the user and varying channel conditions. Cell edge users and cell center users are distinguished based upon the SINR level. The management of the resources are regulated as per the user requirements and coordinated by the neighboring cells. The results have been simulated in two different ambiances viz., normal traffic and the emergency condition to show its performance in exigency. The throughput of the CCUs and CEUs in normal traffic has been compared. Also, the approach and results are shown to be highly reliable.Introduction -- Background -- Our work -- MATLAB code implementation -- Results and analysis -- Conclusion and future scop

Group scheduling in cellular networks

Title from PDF of title page, viewed on March 12, 2013Thesis advisor: Cory BeardVitaIncludes bibliographic references (p. 45-47)Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2012With 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.Introduction -- Background -- Code implementation -- Results and analysi