Performance Guarantee under Longest-Queue-First Schedule in Wireless Networks
Bo Li, Cem Boyaci, Ye Xia

TL;DR
This paper analyzes the performance guarantees of the Longest-Queue-First scheduling algorithm in wireless networks, introducing larger achievable rate regions and revealing a counter-intuitive stabilization phenomenon related to increased arrival rates.
Contribution
It introduces three new achievable rate regions for LQF scheduling that surpass previous bounds and explains a surprising stabilization effect with higher arrival rates.
Findings
New larger rate regions including all extreme points of capacity region.
Counter-intuitive stabilization phenomenon with increased arrival rates.
Theoretical explanation of the stabilization effect.
Abstract
Efficient link scheduling in a wireless network is challenging. Typical optimal algorithms require solving an NP-hard sub-problem. To meet the challenge, one stream of research focuses on finding simpler sub-optimal algorithms that have low complexity but high efficiency in practice. In this paper, we study the performance guarantee of one such scheduling algorithm, the Longest-Queue-First (LQF) algorithm. It is known that the LQF algorithm achieves the full capacity region, , when the interference graph satisfies the so-called local pooling condition. For a general graph , LQF achieves (i.e., stabilizes) a part of the capacity region, , where is the overall local pooling factor of the interference graph and . It has been shown later that LQF achieves a larger rate region, , where …
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.
Taxonomy
TopicsAdvanced Wireless Network Optimization · Cooperative Communication and Network Coding · Advanced MIMO Systems Optimization
