Please use this identifier to cite or link to this item:
http://repository.futminna.edu.ng:8080/jspui/handle/123456789/14470
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | ASAKA, Osbert Tarlumun | - |
dc.date.accessioned | 2022-03-07T11:21:27Z | - |
dc.date.available | 2022-03-07T11:21:27Z | - |
dc.date.issued | 2021-10-21 | - |
dc.identifier.uri | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/14470 | - |
dc.description.abstract | Soft frequency reuse (SFR) techniques have been deployed to address the problem of interference experienced by users in cellular networks. In some of these techniques, resources allocations are based on the assumption that users are uniformly distributed.However, in a real network scenario where SFR is deployed for resource allocation, the distribution of users in the network regions is random. Analysis of the impact of random deployment of users in such network scenarios is essential for designing efficient networks. This research proposes a SFR algorithm (User-SFR), which intelligently adjusts resource allocation parameters according to the load distribution in the network. When compared with several results of a fixed SFR algorithm, the results for the proposed User SFR outperforms the fixed SFR.The Signal to interference plus noise ratio (SINR) of the users at the edge region improved by about 3.2% and the Capacity improved by over 202%.This implies that a more realistic and enhanced network is achieved when random distribution of the users in a network is considered against the assumed uniform distribution of users. | en_US |
dc.language.iso | en | en_US |
dc.title | USER DENSITY BASED SOFT FREQUENCY REUSE ALGORITHM FOR 5G CELLULAR NETWORKS | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | Masters theses and dissertations |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MTech Asaka Osbert Tarlumun.pdf | 1.44 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.