Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems

Shahram Shahsavari, Farhad Shirani, Mohammad Ali Amir Khojastepour, Elza Erkip

TL;DR

This paper tackles the challenge of maximizing data rates in full-duplex (FD) wireless systems by proposing novel scheduling strategies that balance opportunistic gains with temporal fairness. They introduce algorithms for both long-term and short-term fairness, demonstrating that their methods can achieve optimal system utility while ensuring predictable performance, especially in scenarios with significant interference.

What Problem Does This Paper Address?

Full-duplex (FD) communication, which allows simultaneous uplink (UL) and downlink (DL) transmissions on the same frequency, promises a significant boost in wireless system capacity. However, a major hurdle is inter-user interference (IUI) – the signal from an active UL user interfering with a DL user. To harness FD's potential, efficient scheduling is crucial to manage this IUI and exploit multiplexing gains. This paper focuses on a specific aspect of scheduling: temporal fairness. In delay-sensitive applications, it's not just about maximizing throughput, but also about ensuring predictable latency and resource allocation over time. The paper addresses the problem of designing scheduling strategies that achieve high system utility while guaranteeing that users receive their allocated resources within certain timeframes, both in the long run and over shorter, defined windows.

Methods

The paper introduces two main types of scheduling strategies:

  • Threshold-Based Strategies (TBS) for Long-Term Fairness: These strategies aim to achieve optimal system utility while satisfying temporal fairness constraints over an infinitely long horizon. The core idea is to define thresholds for UL and DL transmissions. A virtual user (a pair of UL and DL users) is selected for transmission if its "scheduling measure" (a combination of its utility and the thresholds) exceeds a certain value. The paper proves that these TBSs achieve optimal utility and provides an iterative algorithm to construct them.
  • Augmented Threshold-Based Strategies (ATBS) for Short-Term Fairness: To address fairness over finite time windows, the ATBS approach is proposed. This strategy has two phases: a TBS phase (similar to the long-term strategy) and a compensation phase. The compensation phase ensures that the temporal fairness constraints are met within the specified window, even if it means sacrificing some immediate utility. The paper shows that the utility of ATBS converges to the optimal long-term utility as the window length increases.

Key techniques include:

  • Derivation of Feasible Temporal Demand Regions: The paper mathematically defines the conditions under which temporal fairness constraints can be met for both long-term and short-term scenarios.
  • Optimization Framework: The problem is framed as maximizing system utility subject to fairness constraints.
  • Iterative and Online Algorithms: Practical algorithms are provided for constructing optimal TBSs and ATBSs, with the TBS algorithm being an online approach that adapts to channel conditions over time.
  • Successive Interference Cancellation (SIC): The paper highlights the significant benefit of using SIC at the DL receiver to cancel IUI, especially in scenarios with strong interference.

Datasets

Not discussed in the paper. The paper uses simulated scenarios based on defined channel models and parameters.

Key Insights and Ideas

  • Temporal Fairness is Crucial for Predictability: The paper emphasizes that for delay-sensitive applications, temporal fairness is as important as maximizing throughput. Predictable latency and resource allocation are key benefits.
  • TBS Achieves Optimal Long-Term Utility: The theoretical result that Threshold-Based Strategies can achieve optimal system utility under long-term temporal fairness is a significant finding.
  • ATBS Bridges Short-Term and Long-Term Fairness: The ATBS strategy effectively bridges the gap between short-term fairness requirements and the optimal long-term performance, showing convergence as the observation window grows.
  • SIC is a Game-Changer for IUI: The simulations strongly suggest that Successive Interference Cancellation (SIC) dramatically improves FD gains, particularly when inter-user interference is high. This is a critical practical insight.
  • Online Algorithm for Practical Implementation: The development of an online algorithm for TBS threshold optimization is vital for real-world deployment, as it doesn't require prior knowledge of channel statistics.

Key Results

  • Theoretical Guarantees: The paper provides theoretical proofs for the optimality of TBS under long-term fairness and the convergence of ATBS to optimal utility under short-term fairness.
  • Algorithm Performance: Simulations demonstrate that the proposed TBS and ATBS algorithms effectively satisfy temporal fairness constraints.
  • FD Gains with SIC: Simulations show that FD systems with SIC can achieve significant throughput gains (up to 100% in some scenarios) compared to traditional HD systems, especially with high self-interference mitigation (SIM).
  • Impact of User Distribution: The study investigates how user distribution (uniform vs. hotspot) affects FD performance, showing that hotspot scenarios can be more challenging for FD without SIC.
  • Convergence of ATBS: Figure 5 illustrates that the system utility of ATBS approaches the optimal long-term utility as the fairness window-length increases, confirming theoretical predictions.

Limitations and Future Work

  • Single-Cell Assumption: The current work focuses on a single-cell scenario. The authors suggest that extending these methods to multi-cell scheduling in FD systems is a natural and important next step.
  • Limited Base Station Cooperation: For multi-cell FD systems, they propose investigating scenarios with limited base station cooperation.
  • FD Capability of Users: The paper explores scenarios where users might have FD capability. An avenue for future work is to consider FD capability for users, which could significantly improve performance in scenarios where user distribution is concentrated and SIC is not available.
  • Practical Channel Models: While simulations use established channel models, real-world wireless environments are complex. Further validation with more realistic and dynamic channel models would be beneficial.

Summary updated

Abstract

In-band full-duplex (FD) communications - enabled by recent advances in antenna and RF circuit design - has emerged as one of the promising techniques to improve data rates in wireless systems. One of the major roadblocks in enabling high data rates in FD systems is the inter-user interference (IUI) due to activating pairs of uplink and downlink users at the same time-frequency resource block. Opportunistic user scheduling has been proposed as a means to manage IUI and fully exploit the multiplexing gains in FD systems. In this paper, scheduling under long-term and short-term temporal fairness for single-cell FD wireless networks is considered. Temporal fair scheduling is of interest in delay-sensitive applications, and leads to predictable latency and power consumption. The feasible region of user temporal demand vectors is derived, and a scheduling strategy maximizing the system utility while satisfying long-term temporal fairness is proposed. Furthermore, a short-term temporal fair scheduling strategy is devised which satisfies user temporal demands over a finite window-length. It is shown that the strategy achieves optimal average system utility as the window-length is increased asymptotically. Subsequently, practical construction algorithms for long-term and shortterm temporal fair scheduling are introduced. Simulations are provided to verify the derivations and investigate the multiplexing gains. It is observed that using successive interference cancellation at downlink users improves FD gains significantly in the presence of strong IUI.
BibTeX
@inproceedings{shahsavari2019opportunistic,
  author = {Shahram Shahsavari and Farhad Shirani and Mohammad Ali Amir Khojastepour and Elza Erkip},
  title = {{Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems}},
  booktitle = {PIMRC Workshops},
  year = {2019},
  url = {https://openreview.net/forum?id=i8LkzrBPhgW},
}
Figure