Abstract

"Scheduling and Policing are two mechanisms very hard to be co-ordinated in wireless communication systems. In this paper the general frequency domain packet scheduling (FDPS) problem is formalized. The constraint of selecting only one MIMO mode per user in each transmission time interval (TTI) increases the hardness of this problem. Then an approximation algorithm with constant approximation ratio is proposed solving the FDPS problem. The proposed algorithm’s performance is then compared with existing efficient packet scheduler termed as the Proportional Fair Scheduler along with the MatLab simulated result. "

Authors and Affiliations