pith. sign in

arxiv: 1210.7837 · v3 · pith:YLV5XTBSnew · submitted 2012-10-29 · 🧮 math.OC · cs.NI

Scheduling Under Fading and Partial Channel Information

classification 🧮 math.OC cs.NI
keywords networkchannelinformationpartialschedulerschedulingthroughput-optimalunder
0
0 comments X
read the original abstract

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughput-optimal policy for the network under QoS constraints when real-time and rate-guaranteed data traffic may be present.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.