Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels

For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data rate vector such that the expected rate vector over all fading states is proportional to the current queue state vector and is on the boundary of the ergodic capacity region of a fading BC. Utilizing the degradedness of BC for each fading state, QPS is formulated as a geometric program that can be solved with efficient algorithms. The GP formulation of QPS is also extended to orthogonal frequency-division multiplexing (OFDM) systems in a fading BC. The throughput optimality of QPS is proved, and it is shown that QPS can arbitrarily scale the ratio of each user's average queueing delay. Throughput, delay, and fairness properties of QPS are numerically evaluated in a fading BC and compared with other scheduling policies such as the well-known maximum weight matching scheduling (MWMS). Simulation results fo...

• Type: Journal
• Year: 2006
• Where: JSAC
• Authors: Kibeom Seong, Ravi Narasimhan, John M. Cioffi
• Keywords: JSAC 2006, Queue Proportional Scheduling, Rate Vector, Throughput Optimal Scheduling