att_abstract={{Proportional Fair (PF) scheduling algorithms are
 the de-facto standard cellular networks. They exploit the
 inusers’ channel state diversity (induced by fast-fading), and are
 optimal stationary channel state distributions and an infinite
 fortime-horizon. However, mobile users experience a non-stationary
 channel, due to slow-fading (on the order of seconds), and are
 associated with basestations for short periods. Hence, we develop
 the Predictive Finite-horizon PF Scheduling ((PF)2 S) Framework
that exploits mobility. We present extensive channel measurement
 results from a 3G network and characterize mobility-induced
 channel state trends. We show that a user’s channel state is highly
reproducible and leverage that to develop a data rate prediction
mechanism. We then present a few channel allocation estimation
algorithms that rely on the prediction mechanism. Our trace-
based simulations consider instances of the (PF)2S Framework
 composed of combinations of prediction and channel allocation
 estimation algorithms. They indicate that the framework can
 increase the throughput by 15%–55% compared to traditional
 PF schedulers, while improving fairness.
	att_authors={as5211, rj2124, va037f, ns2438},
	att_categories={C_CCF.1, C_NSS.7, C_NSS.18},
	att_copyright_notice={{This version of the work is reprinted here with permission of IEEE for your personal use. Not for redistribution. The definitive version was published in 2014. {{, 2014-12-01}}
	author={Ashwin Sridharan and Robert Margolies and Rittwik Jana and Vaneet Aggarwal and N Shankaranarayanan and Vinay Vaishampayan and Gil Zussman},
	institution={{IEEE/ACM Transactions on Networking}},
	title={{Exploiting Mobility in Proportional Fair Cellular Scheduling: Measurements and Algorithms