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

TL;DR

This paper proposes a mixed integer programming approach to maximize the number of users served in ultra-dense uRLLC networks, addressing the challenge of ultra-reliability and low latency in 5G/6G systems.

Contribution

It introduces a novel optimization model focusing on user set cardinality, with mathematical transformations and convex approximation to efficiently solve the problem.

Findings

Achieves higher user set cardinality compared to baseline methods.

Offers lower computational complexity than exhaustive search.

Demonstrates significant performance improvements in numerical simulations.

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.