Simulation Results of User Behavior-Aware Scheduling Based on Time-Frequency Resource Conversion

Hangguan Shan, Yani Zhang, Weihua Zhuang, Aiping Huang, Zhaoyang ZhangarXiv 2016 · arXiv

Introduction

In modern LTE-type cellular networks, efficient resource management is critical to meeting increasing demand. Time-Frequency Resource Conversion (TFRC) is a promising strategy that dynamically swaps time and frequency resources to enhance network flexibility. For example, by allocating more frequency bandwidth to a user, a task can be completed faster, freeing up time slots for other users. However, implementing TFRC is computationally intensive, often facing the "curse of dimensionality" and NP-hard complexity in joint allocation problems. This paper presents practical, low-complexity scheduling algorithms that leverage user behavior context to bridge the gap between theoretical TFRC benefits and real-world deployment.

Proposed Scheduling Framework

The study introduces a suite of algorithms designed for different operational contexts:

  1. DSFRB (Deflation and Sequential Fixing Based): An offline scheduling algorithm that serves as a high-performance benchmark. It uses a deflation strategy to reduce problem complexity to polynomial time.
  2. Online Algorithms (MSR and MEC): Practical solutions for real-time deployment where future traffic is unknown. These include the Modified Smith Ratio (MSR) and Modified Exponential Capacity (MEC).
  3. Context-Aware Penalty Function: A novel function designed to prioritize request completion before deadlines, moving beyond simple throughput maximization.

Simulation Environment

The algorithms were evaluated through extensive numerical simulations mimicking an LTE-type cell. The setup included 5 users, 32 subchannels (15 KHz each), and Rayleigh fading. Traffic followed a Poisson process ($\lambda_u$), with data sizes and lifetimes following uniform and exponential distributions, respectively.

Performance Analysis

Impact of Traffic Load

A key finding is that TFRC-enabled scheduling consistently outperforms traditional methods, particularly as network congestion increases.

Impact of request arrival rate on system reward and service completion.

As shown in Figure 1, the performance gap between TFRC-enabled and TFRC-disabled algorithms widens with higher request arrival rates. For instance, at $\lambda_u = 0.1$, the online MSR and MEC algorithms achieved significant improvements in total system reward compared to standard benchmarks. This demonstrates that TFRC is most valuable when the network is under heavy stress.

Impact of Request Size

The flexibility of TFRC also allows the system to handle larger data requests more effectively.

Impact of average request size on system reward and service completion.

Figure 3 illustrates that as the average request size increases, TFRC-enabled algorithms maintain higher system rewards and completion ratios. By utilizing user behavior-aware information, the scheduler can find optimal resource allocations that traditional, rigid schedulers might miss.

Key Insights

  • Contextual Advantage: Knowing which connections a user is focused on allows the scheduler to prioritize resources more effectively.
  • Synergy with Channel Quality: TFRC-enabled scheduling "harvests" more benefit from improved Signal-to-Noise Ratio (SNR) than standard scheduling.
  • Resilience: The system fully exploits cell capacity as request lifetimes increase, with performance converging once mean lifetimes exceed 40 seconds.

Conclusion

The proposed TFRC-oriented scheduling framework demonstrates significant gains in both operator revenue (system reward) and user experience (service completion). While the current study focused on a 5-user scenario, the low-complexity nature of the DSFRB, MSR, and MEC algorithms suggests potential for scaling to more dense network environments. Future work will involve testing these algorithms against real-world traffic traces and hardware implementation.

Summary updated

Abstract

Integrating time-frequency resource conversion (TFRC), a new network resource allocation strategy, with call admission control can not only increase the cell capacity but also reduce network congestion effectively. However, the optimal setting of TFRC-oriented call admission control suffers from the curse of dimensionality, due to Markov chain-based optimization in a high-dimensional space. To address the scalability issue of TFRC, in [1] we extend the study of TFRC into the area of scheduling. Specifically, we study downlink scheduling based on TFRC for an LTE-type cellular network, to maximize service delivery. The service scheduling of interest is formulated as a joint request, channel and slot allocation problem which is NP-hard. An offline deflation and sequential fixing based algorithm (named DSFRB) with only polynomial-time complexity is proposed to solve the problem. For practical online implementation, two TFRC-enabled low-complexity algorithms, modified Smith ratio algorithm (named MSR) and modified exponential capacity algorithm (named MEC), are proposed as well. In this report, we present detailed numerical results of the proposed offline and online algorithms, which not only show the effectiveness of the proposed algorithms but also corroborate the advantages of the proposed TFRC-based schedule techniques in terms of quality-of-service (QoS) provisioning for each user and revenue improvement for a service operator.
BibTeX
@misc{shan2016simulation,
  author = {Hangguan Shan and Yani Zhang and Weihua Zhuang and Aiping Huang and Zhaoyang Zhang},
  title = {{Simulation Results of User Behavior-Aware Scheduling Based on Time-Frequency Resource Conversion}},
  year = {2016},
  eprint = {1602.04900},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1602.04900},
}
Figure