Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems

Shahram Shahsavari, Farhad Shirani, Mohammad Ali Khojastepour, Elza ErkipIEEE JSAC 2022 · OpenReview

TL;DR

This paper tackles the challenge of maximizing data rates in full-duplex (FD) wireless systems by developing novel scheduling strategies that balance opportunistic mode selection with temporal fairness for users. The work introduces practical algorithms for both long-term and short-term fairness, demonstrating significant throughput gains, especially when users can cancel 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, achieving these gains is hindered by two main issues: self-interference (SI) at the FD device and inter-user interference (IUI) between simultaneous UL and DL transmissions. While previous work has explored FD with simplified assumptions (e.g., FD base stations with half-duplex users), this paper addresses a more complex and realistic scenario. It considers systems where not only the base station but also an arbitrary fraction of users can be FD-capable and can perform successive interference cancellation (SIC) to mitigate IUI. The core problem is how to intelligently select communication modes (HD-UL, HD-DL, FD-IN, FD-SIC, FD-SIM) and schedule users to maximize overall system throughput while ensuring that each user receives a fair share of resources over time, a crucial aspect for delay-sensitive applications.

Methods

The paper introduces two main types of scheduling strategies:

  • Threshold-Based Strategies (TBS) for Long-Term Temporal Fairness: These strategies aim to achieve fairness over an infinitely long time horizon. The core idea is to define "scheduling measures" for each potential user-mode pair, which combine the system utility (e.g., achievable rate) with user-specific thresholds. The scheduler then selects the pair with the highest measure. The paper proves that these TBSs are optimal for achieving maximum system utility under long-term fairness. A practical, low-complexity online algorithm is also proposed to estimate the optimal thresholds in real-time, without prior knowledge of channel statistics.
  • Augmented Threshold-Based Strategies (ATBS) for Short-Term Temporal Fairness: For fairness over a finite time window, the paper develops ATBS. These strategies build upon TBS but incorporate additional constraints to guarantee that users meet their temporal demands within the specified window. The ATBS operates in two phases: a TBS phase to maximize utility and a compensation phase to ensure fairness is met. The paper shows that the utility of ATBS converges to the optimal long-term utility as the window length increases.

The paper also rigorously characterizes the "feasible region" of temporal demands, defining the combinations of user UL/DL time allocations that are achievable under both long-term and short-term fairness constraints.

Datasets

Not discussed in the paper. The paper focuses on theoretical analysis and simulation-based evaluation using a defined system model and parameters.

Key Insights and Ideas

  • The Power of SIC and FD Users: The paper strongly demonstrates that enabling users to perform SIC and be FD-capable significantly enhances system throughput. This is particularly true in scenarios with high self-interference at the base station or when users are clustered.
  • Temporal Fairness is Achievable and Beneficial: The work provides a formal framework for temporal fairness in complex FD systems, showing that optimal schedulers can achieve fairness while maximizing utility. This is crucial for real-world deployments where predictable performance is as important as peak throughput.
  • Low-Complexity Online Algorithms are Practical: The development of an online algorithm for threshold optimization is a key practical contribution. It allows for adaptive scheduling in dynamic wireless environments without requiring complete knowledge of system statistics beforehand.
  • Feasible Demand Regions are Critical: Understanding the boundaries of achievable temporal demands is fundamental. The paper's characterization of these regions provides a theoretical basis for designing effective scheduling policies.

Key Results

  • Optimality of TBS for Long-Term Fairness: The paper proves that Threshold-Based Strategies (TBS) are optimal for maximizing system utility under long-term temporal fairness in FD systems.
  • Convergence of ATBS for Short-Term Fairness: Augmented Threshold-Based Strategies (ATBS) are shown to achieve near-optimal utility for short-term fairness, with performance converging to the long-term optimum as the fairness window length increases.
  • Significant Throughput Gains: Simulations show substantial average FD throughput gains over baseline HD systems, especially with higher levels of self-interference mitigation (SIM) and when SIC is available. For instance, gains can approach 100% in certain scenarios with FD-SIC.
  • Impact of User Distribution: The paper highlights that user distribution significantly affects performance. Clustered users (hotspots) benefit more from FD-SIC, while uniform distributions also see improvements, particularly when SIM is not extremely high.

Limitations and Future Work

  • Single-Cell Focus: The current work is limited to a single-cell scenario. The authors suggest that a natural extension is to investigate multi-cell scheduling in FD systems.
  • Limited Base Station Cooperation: The paper mentions that extending the work to FD systems with limited base station cooperation is an interesting avenue.
  • User FD Capability: The authors suggest exploring FD capability at users as a way to improve performance, especially in scenarios with concentrated user distributions where SIC might not be available.
  • Practical Implementation Details: While algorithms are proposed, the paper doesn't delve into the specific hardware or implementation challenges of SIC or FD capabilities at user devices.

Summary updated

Abstract

In-band full-duplex (FD) communication has emerged as one of the promising techniques to improve data rates in next generation wireless systems. Typical FD scenarios considered in the literature assume FD base stations (BSs) and half-duplex (HD) users activated either in uplink (UL) or downlink (DL), where inter-user interference (IUI) is treated as noise at the DL user. This paper considers more general FD scenarios where an arbitrary fraction of the users are capable of FD and/or they can perform successive interference cancellation (SIC) to mitigate IUI. Consequently, one user can be activated in either UL or DL (HD-UL and HD-DL modes), or simultaneously in both directions requiring self-interference mitigation (SIM) at that user (FD-SIM mode). Furthermore, two users can be scheduled, one in UL and the other in DL (both operating in HD), where the DL user can treat IUI as noise (FD-IN mode) or perform SIC to mitigate IUI (FD-SIC mode). This paper studies opportunistic mode selection and user scheduling under long-term and short-term temporal fairness in single-carrier and multi-carrier (OFDM) FD systems, with the goal of maximizing system utility (e.g. sum-rate). First, the feasible region of temporal demands is characterized for both long-term and short-term fairness. Subsequently, optimal temporal fair schedulers as well as practical low-complexity online algorithms are devised. Simulation results demonstrate that using SIC to mitigate IUI as well as having FD capability at users can improve FD throughput gains significantly especially, when user distribution is concentrated around a few hotspots.
BibTeX
@article{shahsavari2022opportunistic,
  author = {Shahram Shahsavari and Farhad Shirani and Mohammad Ali Khojastepour and Elza Erkip},
  title = {{Opportunistic Temporal Fair Mode Selection and User Scheduling in Full-Duplex Systems}},
  journal = {IEEE J. Sel. Areas Commun.},
  year = {2022},
  url = {https://openreview.net/forum?id=kb1XYHpXTK},
}
Figure