Efficient Interference Management Policies for Femtocell Networks
Kartik Ahuja, Yuanzhang Xiao, Mihaela van der Schaar

TL;DR
This paper introduces a novel interference management policy for femtocell networks that optimizes network performance for delay-sensitive applications, outperforming existing cyclic scheduling methods and achieving up to 130% improvement.
Contribution
It proposes a non-cyclic scheduling policy with an optimal interference graph construction, providing a low-complexity, decentralized solution with proven near-optimal performance.
Findings
Achieves up to 130% performance improvement over existing policies.
Provides a low-complexity algorithm with constant competitive ratio.
Enables decentralized implementation suitable for large networks.
Abstract
Managing interference in a network of macrocells underlaid with femtocells presents an important, yet challenging problem. A majority of spatial (frequency/time) reuse based approaches partition the users based on coloring the interference graph, which is shown to be suboptimal. Some spatial time reuse based approaches schedule the maximal independent sets (MISs) in a cyclic, (weighted) round-robin fashion, which is inefficient for delay-sensitive applications. Our proposed policies schedule the MISs in a non-cyclic fashion, which aim to optimize any given network performance criterion for delay-sensitive applications while fulfilling minimum throughput requirements of the users. Importantly, we do not take the interference graph as given as in existing works; we propose an optimal construction of the interference graph. We prove that under certain conditions, the proposed policy…
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.
