Maximizing throughput with fairness in LTE

dc.contributor.authorUsman Pervaiz
dc.contributor.authorAdil Naseer
dc.contributor.authorTariq Sajjad
dc.date.accessioned2013-04-08T06:45:42Z
dc.date.available2013-04-08T06:45:42Z
dc.date.issued8/2/2012
dc.descriptionProject Advisor: Jawwad Nasar Chatthaen_US
dc.description.abstractWith an increase in the number of mobile users, capacity requirements on wireless communication systems has increased to a very high level especially in terms of data rates. This report proposes a feedback based resource scheduling technique for maximizing data rates from a quality of service point of view. This aims at having better mobility, improved coverage and fairness among wireless users. The proposed methodology results in increased throughput for the users without compromising on fairness and QoS. A sub optimal scheduling technique for wireless mobile users is proposed having a low implementation complexity without compromising on throughput for improved QoS. Performance of the proposed algorithms is evaluated by means of simulations. Comparison to theoretical achievable throughput is also presented. The investigation and results reveals the possibility of utilizing a suboptimal scheme to maximize user throughput, thereby pointing at directions to efficiently improve performance in system.en_US
dc.identifier.urihttps://escholar.umt.edu.pk/handle/123456789/741
dc.language.isoenen_US
dc.publisherUniversity of Management and Technologyen_US
dc.subjectBS Thesisen_US
dc.subjectWireless Communicationen_US
dc.subjectMaximizing Dataen_US
dc.titleMaximizing throughput with fairness in LTEen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Full View.htm
Size:
22.55 KB
Format:
Hypertext Markup Language
Description:
Loading...
Thumbnail Image
Name:
Summary.pdf
Size:
569.23 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: