Throughput Maximization in Uncooperative Spectrum Sharing Networks
Thomas Stahlbuhk, Brooke Shrader, Eytan Modiano

TL;DR
This paper develops algorithms for throughput maximization in wireless networks with uncooperative legacy systems by estimating their queue backlogs through learning, enabling effective scheduling despite limited cooperation.
Contribution
It introduces a novel approach to infer uncooperative users' queue states using POMDP-based learning and integrates this into a scheduling policy, expanding the applicability of throughput optimization.
Findings
The algorithms successfully estimate uncooperative users' queue backlogs.
The proposed scheduling policy achieves throughput stability.
Simulation results validate the theoretical throughput region.
Abstract
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves optimality by adaptively scheduling transmissions relative to each user's stochastic traffic demands. To implement the method, users must report their queue backlogs to the network controller and must rapidly respond to the resulting resource allocations. However, many currently-deployed wireless systems are not able to perform these tasks and instead expect to occupy a fixed assignment of resources. To accommodate these limitations, adaptive scheduling algorithms need to interactively estimate these uncooperative users' queue backlogs and make scheduling decisions to account for their predicted behavior. In this work, we address the problem of…
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.
