Throughput Optimal Scheduling with Dynamic Channel Feedback
Mehmet Karaca, Yunus Sarikaya, Ozgur Ercetin, Tansu Alpcan, Holger, Boche

TL;DR
This paper introduces a scheduling algorithm that accounts for channel probing overhead, expanding the achievable rate region in wireless networks by efficiently balancing probing costs and throughput.
Contribution
It proposes the SDF algorithm that jointly schedules and probes channels, analytically proves its effectiveness in expanding the rate region considering overhead.
Findings
SDF supports over 1+ε of the full rate region with probing overhead.
For networks with more than 3 users, SDF guarantees rate region expansion.
Numerical simulations show less than 50% channel probing achieves significant throughput gains.
Abstract
It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into account the overhead associated with channel probing and feedback required to obtain the full channel state information at every slot. We adopt a channel probing model where fraction of time slot is consumed for acquiring the channel state information (CSI) of a single channel. In this work, we design a joint scheduling and channel probing algorithm named SDF by considering the overhead of obtaining the channel state information. We first analytically prove SDF algorithm can support fraction of of the full rate region achieved when all users are probed where depends on the expected number of users which are not probed. Then,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
