Title :
Approximate stochastic dynamic programming for opportunistic fair scheduling in wireless networks
Author :
Zhang, Zhi ; Moola, Sudhir ; Chong, Edwin K P
Author_Institution :
Dept. of Electr. & Comput. Eng., Colorado State Univ., Ft. Collins, CO, USA
Abstract :
We consider the problem of temporal fair scheduling of queued data transmission in wireless networks. Taking fairness constraints and the memory property of channels into consideration, we formulate the transmission scheduling problem as a discounted reward Markov decision process (MDP) with temporal fairness constraints. We derive and prove an explicit dynamic programming equation for the above constrained MDP, and give an optimal scheduling policy based on that equation. Furthermore, we develop an efficient approximation method-temporal fair rollout-to reduce the computational cost. The simulation results show that the scheme achieves significant performance improvement for both throughput maximization and delay minimization problems compared with other existing schemes.
Keywords :
Markov processes; approximation theory; constraint theory; decision making; dynamic programming; queueing theory; radio networks; scheduling; wireless channels; Markov decision process; approximation method; opportunistic scheduling; queued data transmission; stochastic dynamic programming; temporal fair rollout; temporal fairness constraint; transmission scheduling problem; wireless network; Computational efficiency; Data communication; Dynamic programming; Dynamic scheduling; Equations; Memory management; Optimal scheduling; Processor scheduling; Stochastic processes; Wireless networks;
Conference_Titel :
Decision and Control, 2008. CDC 2008. 47th IEEE Conference on
Conference_Location :
Cancun
Print_ISBN :
978-1-4244-3123-6
Electronic_ISBN :
0191-2216
DOI :
10.1109/CDC.2008.4739159