Skip to content
Open access

Efficient User Association and Wireless Scheduling With Shorter Time-Scale Rate Adaptation

Sep 2026 · IEEE Transactions on Networking · Vol 34, pp. 7635-7645 · 0 citations · 54 references
Computer Science

TL;DR

This work develops a MaxWeight-type user association and scheduling algorithm that integrates virtual queues—tracking each user’s scheduling debt to maintain fairness—and Upper Confidence Bound (UCB) estimates in its weight measure and introduces a low-complexity alternative utilizing the so-called pick-and-compare (PC) approach.

Abstract

Rate adaptation is a crucial mechanism in IEEE 802.11 networks and next-generation cellular systems. Since the time scale for rate adaptation is typically much shorter than that for user association and scheduling, we investigate a joint design of wireless user association and scheduling and rate adaptation across different time scales to maximize cumulative network throughput while ensuring desired fairness among users. We develop a MaxWeight-type user association and scheduling algorithm that integrates virtual queues—tracking each user’s scheduling debt to maintain fairness—and Upper Confidence Bound (UCB) estimates in its weight measure. Each selected user then employs the UCB algorithm for rate adaptation on a short time scale. Our theoretical findings reveal that the proposed algorithm achieves cumulative regret that grows with the square root of the time horizon up to a logarithmic factor and results in zero cumulative fairness violation after a certain number of time frames. Furthermore, since the MaxWeight-type algorithm involves evaluating all the feasible schedules that can be exponential to the number of users due to the interference constraints, leading to high computational complexity, we introduce a low-complexity alternative utilizing the so-called pick-and-compare (PC) approach. We demonstrate the effectiveness of both algorithms through simulations based on real-world data traces.

Read PDF

Similar papers

Open access Jan 2017

WIRELESS INFORMATION AND ENERGY TRANSFER: TRADEOFF FOR FAIR RESOURCE ALLOCATION

This paper study two schemes for the fair resource allocation in wireless powered communication networks: a non-orthogonal multiple access (NOMA) scheme, and a proportional fair (PF) scheduling scheme, which significantly improve the system fairness at the expense of minor (or nonexistent) rate degradation.

Hristina Cingoska, Zoran Hadzi-Velkov, I. Nikoloska · 0 citations
Open access Oct 2026

Throughput maximization and overhead-aware quality link scheduling for heterogeneous wireless networks

Next-generation heterogeneous wireless networks (HWNs) require advanced scheduling solutions to guarantee high quality of service (QoS) while sustaining throughput, minimizing latency, and efficiently utilizing spectrum resources. Traditional link scheduling and admission control techniques are constrained by interfere...

Nataraja Nagarajappa, N. K. Bhoganna · 0 citations
2026

On Scheduling With Resource Allocation in Multi-Provider Cell-Free Networks

We study resource allocation in multi-provider open radio access network (O-RAN) cell-free networks and analytically prove that allocating bandwidth proportionally to each cenrral unit (CU)’s time-averaged per-user queue length is the optimal solution to a coarse-timescale Lyapunov drift minimization problem, under the...

Jin-Ho Choi · 0 citations
Open access 2026

JLRP: Joint Link-Scheduling, Rate-Adaptation, and Power-Allocation Scheme for Spatial Reuse in 60-GHz mmWave WLANs

This letter investigates the problem of dynamic and on-demand spatial reuse scheduling in 60GHz millimeter-wave (mmWave) wireless local area networks (WLANs). To jointly consider link scheduling, rate adaptation and power allocation, the throughput maximization problem is formulated as a mixed-integer nonlinear program...

Yang Peng, Lei Zhao, Yuan Jiang et al. · 0 citations
Open access Oct 2026

Scalable optimization of small cell networks using reinforcement learning

In this research work, the authors propose a novel approach through a reinforcement learning-based algorithm which aims to optimize the performance of ultra-dense small cell networks in 5G and beyond systems. The RL agent that has been proposed is responsible for controlling the transmission power, spectrum overlay, an...

Raabia Kausar, Shakti Raj Chopra, Akhil Gupta · 0 citations
Open access Oct 2026

Interference Management using K-Means Clustering in Ultra-Dense Networks

Investigation of a hybrid radio resource allocation approach that integrates K-means clustering with dynamic resource block (RB) allocation as an interference management method in UDNs indicates that integrating spatial clustering with dynamic RB allocation can improve interference management and resource utilization u...

Reni Silvia Dewi, Misfa Susanto, H. Fitriawan · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.