Maximizing the Set Cardinality of Users Scheduled for Ultra-Dense uRLLC Networks

Shiwen He, Jun Yuan, Zhenyu An, Yunshan Yi, Yongming Huang

This paper, titled "Maximizing the Set Cardinality of Users Scheduled for Ultra-dense uRLLC Networks," presents a new approach to resource allocation in the next generation of wireless networks. Instead of focusing on raw speed, the authors focus on how to squeeze as many reliable connections as possible into a crowded network.

TL;DR

Researchers have developed a new optimization algorithm for ultra-reliable low-latency communication (uRLLC) that prioritizes the number of users served over total system throughput. By using finite blocklength theory and successive convex approximation, their method achieves near-optimal scheduling performance with significantly lower computational complexity than exhaustive search methods.

What Problem Does This Paper Address?

In traditional 4G and 5G mobile broadband, the goal is usually to maximize the "sum rate"—making the total data pipe as fat as possible. However, for uRLLC (used in things like factory automation or autonomous vehicles), the requirements are different: we need 99.999% reliability and sub-1ms latency.

In these "ultra-dense" scenarios, the bottleneck isn't how much data one person can download, but how many devices the base station can talk to simultaneously without breaking the strict reliability and power constraints. This is a "set cardinality" problem—maximizing the count of users. Mathematically, this is a nightmare to solve because it involves "mixed-integer programming," which is typically NP-hard (meaning it takes exponentially longer to solve as you add more users).

Furthermore, standard formulas for network capacity (Shannon capacity) assume you have infinite time to send data. In uRLLC, packets are tiny and must be sent instantly. This paper uses Finite Blocklength (FBL) theory, which provides a more realistic (and conservative) model for these short-burst communications.

Methods

The authors propose a joint optimization of User Scheduling (US) and Beamforming (BF). Here is how they tackle the complexity:

  1. Indicator Variables: They introduce a variable ($\kappa_k$) that acts as a switch (0 or 1) for each user.
  2. Mathematical Transformation: To avoid the "all-or-nothing" nature of integer programming, they transform the discrete "switch" into a continuous range between 0 and 1, adding a penalty function to push the values toward the edges.
  3. Successive Convex Approximation (SCA): The core of the algorithm uses SCA to turn a jagged, non-convex optimization landscape into a series of smoother, "convex" problems that are much easier for computers to solve iteratively.
  4. The "Tuning" Process: They include a clever post-processing step. If the algorithm stops but there is still leftover power, it resets the beamforming for unscheduled users and tries again to see if one more device can be squeezed into the schedule.

Datasets

The study relies on simulated channel data rather than a static dataset.

  • Environment: A single base station with 4 antennas serving up to 18 users within a 300m radius.
  • Parameters: They modeled a Rayleigh fading environment with a path loss exponent of 3, using a standard 256-bit packet size ($D$) and a target Signal-to-Noise Ratio (SNR) of 10 dB.
  • Benchmarks: They compared their results against an Exhaustive Search (ES)—which finds the perfect answer by trying every possible combination—and a baseline using traditional Shannon capacity.

Key Insights and Ideas

  • Quantity over Quality (of Rate): In uRLLC, the "minimum rate" is a hard requirement. Once a user meets that threshold, there is no benefit to giving them more speed. The "aha moment" here is that the system's "profit" should be measured in the number of satisfied users, not the total bits per second.
  • The Shannon Trap: The paper demonstrates that if you use standard Shannon capacity formulas to schedule uRLLC users, you will fail. Shannon is too optimistic; it thinks you can support more users than you actually can, leading to dropped packets and failed reliability in real-world short-packet scenarios.
  • Complexity Reduction: Their algorithm scales at $O((KN_t)^3)$, whereas an exhaustive search scales exponentially. This makes their approach viable for real-time scheduling in dense 6G environments.

Key Results

  • Near-Optimal Performance: The "Algorithm 1 with tuning" performed almost as well as the Exhaustive Search but finished in a fraction of the time.
  • Impact of Blocklength: As the allowed blocklength ($n$) increases (meaning the system has slightly more time/resources), the number of scheduled users grows significantly. For example, at $n=1024$, the system could schedule nearly double the users compared to $n=64$.
  • Reliability Trade-off: There is a clear link between error tolerance ($\epsilon$) and capacity. As you allow for a slightly higher error rate (e.g., from $10^{-8}$ to $10^{-2}$), the base station can successfully juggle more users.

Limitations and Future Work

  • User Fairness: The current algorithm is "greedy" for cardinality—it wants the highest number of users. This could mean that a user with a very poor signal might never get scheduled because they "cost" too much power. The authors note that future work needs to integrate "Round Robin" or other fairness-aware scheduling.
  • Static Channels: The model assumes a "slow time-varying channel," meaning the environment doesn't change much during the transmission. In high-speed mobility scenarios (like connected cars), the math would need to be even more robust.
  • Multi-cell Coordination: The paper looks at a single base station. In a real city, interference from neighboring base stations would add another layer of complexity to the optimization.

Summary updated

Abstract

Ultra-reliability and low latency communication has long been an important but challenging task in the fifth and sixth generation wireless communication systems. Scheduling as many users as possible to serve on the limited time-frequency resource is one of a crucial topic, subjecting to the maximum allowable transmission power and the minimum rate requirement of each user. We address it by proposing a mixed integer programming model, with the goal of maximizing the set cardinality of users instead of maximizing the system sum rate or energy efficiency. Mathematical transformations and successive convex approximation are combined to solve the complex optimization problem. Numerical results show that the proposed method achieves a considerable performance compared with exhaustive search method, but with lower computational complexity.
BibTeX
@article{he2021maximizing,
  author = {Shiwen He and Jun Yuan and Zhenyu An and Yunshan Yi and Yongming Huang},
  title = {{Maximizing the Set Cardinality of Users Scheduled for Ultra-Dense uRLLC Networks}},
  journal = {IEEE Communications Letters},
  year = {2021},
  url = {https://openreview.net/forum?id=FvfP0yw065c},
}

Loading related content...

Figure