Abstract
Existing researches on the theoretical analysis for Proportional Fair (PF) scheduling are mostly based on the full buffer assumption while the user always has a bursty traffic in reality. In this paper, an analytical framework for PF scheduling in an Orthogonal Frequency Division Multiple Access (OFDMA) wireless network is proposed, and the user traffic is set to follow a poisson arrival process. Detailed analysis for each user's Resource Block (RB) competition status is carried out, and an M/M/1 queuing model is adopted for the packet transmission process of each user, with which the analytical expressions for user throughput and packet latency are obtained. Simulation in a single-cell OFDMA network is carried out and the comparision between simulation and analysis results confirms the accuracy of our analysis.
Sign-in/Register to access full text options 
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
