Jul 2026· International Conference on Signal Processing and Communications· pp. 1-5· 0 citations· 13 references
Abstract
Reliable low-latency communication is a critical requirement in enterprise wireless networks such as hospitals, offices, and campuses. This paper proposes an earliest deadline first (EDF)-Lyapunov-Robbins-Monro (ELR), a stochastic scheduling algorithm for IEEE 802.11bn (Wi-Fi 8) Multi-Access Point Coordination Coordinated-Spatial Reuse (MAPC C-SR) networks that jointly accounts for queue stability and deadline-aware latency regulation under bursty traffic. A Lyapunov drift-based criterion for a group is adopted to ensure queues remain stable under varying traffic loads. Since the optimal balance between queue backlog and deadline urgency cannot be determined a priori under bursty traffic, EDF term is incorporated into the selection metric with a tunable balance parameter $\alpha$, governed by Robbins-Monro stochastic approximation scheme. The proposed algorithm addresses the inability of existing schedulers to track sudden congestion under bursty traffic, by dynamically adjusting $\alpha$ to suppress sharp delay spikes. Simulations over a four-access point (AP) enterprise deployment under bursty Markov-Modulated Poisson Process (MMPP) traffic demonstrate that ELR achieves 14.23%, 13.26%, and 7.97% reduction in 99th percentile delay over maximum number of packets (MNP), oldest packet (OP), and traffic alignment tracker (TAT) respectively under high load with 16 stations (STAs).
Spectrum admission in low-latency mobile networks increasingly relies on fast control loops under time-varying traffic and radio conditions. A key challenge in such settings is reconfiguration churn: small score fluctuations near the admission boundary can repeatedly flip the marginal admitted request, even when the resulting utility gain is negligible. These boundary-level replacements are disproportionately expensive because admission and eviction trigger higher-layer control procedures, signaling exchanges, and coordination overhead. To address this problem, we propose TOA-S, a churn-aware admission primitive for latency-bounded mobile control. TOA-S targets cellular radio access network (RAN) deployments operating over licensed spectrum, where control loops of the ultra-reliable low-latency communication class at the near-real-time RAN Intelligent Controller must complete within sub-second decision windows. TOA-S preserves the greedy allocation structure for the responsive core of the admitted set and applies stabilization only at the admission boundary, in a single pass per decision epoch, without iterative optimization or learning. We show that TOA-S incurs only an $\varepsilon $ -bounded utility deviation, modifies at most one membership decision per epoch, and suppresses oscillatory replacements under persistent boundary near-tie conditions. Simulations on synthetic workloads with measurement-verified parameters show that TOA-S substantially reduces reconfiguration churn while maintaining spectrum utilization and latency-compatible execution.
Chi-Jen Wu· IEEE Open Journal of the Com...· 0 citations
Dense Wi-Fi networks can lose efficiency when many uplink stations contend at the same time. This paper presents an access-policy study of an AP-managed elastic TDMA-style scheduled-access overlay for dense WLANs. The intended policy reserves protected airtime for active hybrid-capable stations while leaving fallback CSMA/CA available for regular stations and new reservation requests. We evaluate the policy with a policy-level ns-3 model layered over stock Wi-Fi behavior. The model uses scheduled queue release and NAV-like regular-station deferral to isolate access-policy behavior before full MAC integration. In a matched 16-station high-load campaign, a mixed 8 hybrid / 8 regular configuration with NAV-like deferral improves throughput by 6.51%, delivery by 5.74 percentage points, Wi-Fi TX failures by $\mathbf{6 0 . 3 4 \%}$, and retransmissions by $\mathbf{2 8 . 1 8 \%}$ relative to all-regular standard Wi-Fi. Paired five-run differences give preliminary statistical support for the protected mixed case, including throughput gains of $1.175 \pm 0.372$ Mbps and delivery gains of $5.743 \pm 1.820$ percentage points. A NAV-like-off stress case degrades, representing missed or unenforced protection. A fixed 8H/8R timing sweep shows that protected airtime must be sized carefully: 5 ms is best among the tested block durations, while oversized protected blocks starve fallback contention. These results support AP-managed elastic TDMA-style access policy and motivate future MAC-integrated validation.
Reuven Mueller, Ying Xie· 2026 International Conferenc...· 0 citations
A hybrid reinforcement learning (RL) framework that jointly controls queue management and bandwidth allocation in bursty multi-service networks and demonstrates the effectiveness of coordinated learning-based control for stable and QoS-aware operation in bursty networked systems.
T. Khan, Babar Shah, Taimur Karamat et al.· Computing· 0 citations
Wi-Fi 8 introduces Prioritized EDCA (P-EDCA) to support latency-critical traffic within which DS-RTS/CTS operates as a two-phase channel access procedure. In this mechanism, stations first compete in a Defer Signal (DS) contention, which determines the number of stations entering RTS/CTS contention, creating a stochastic coupling not captured by existing IEEE 802.11 models. We develop an analytical framework for the performance analysis of DS-RTS/CTS using a 2-D Markov chain to model the RTS backoff process of a tagged station under a variable number of contenders. Using this model, we obtain expressions for head-of-line delay and normalized throughput. We further formulate an optimization problem for adaptive selection of the DS contention window size. Results show that a moderately sized DS contention window achieves a favorable throughput-delay trade-off across network densities.
Mahith Chintada, Sreelakshmi Manjunath· International Conference on...· 0 citations
The rapid proliferation of Internet of Things (IoT) devices has intensified demands for low-latency, resource-efficient task scheduling at the network edge. Conventional policies such as Round-Robin and First-Come-First-Serve (FCFS) fail to satisfy the Quality-of-Service (QoS) requirements of Industrial-IoT and autonomous-vehicle workloads. This paper presents Multi-Queue Priority-Based Scheduling (MQPBS), a lightweight algorithm that classifies tasks into three dynamic priority queues (High, Medium, Low) using deadline-aware heuristics, applies Shortest-Job-First (SJF) intra-queue ordering, and employs an aging mechanism to prevent starvation. Extensive simulation over task sets of 200–1000 tasks demonstrates that MQPBS reduces average waiting time by up to 17.6%, improves throughput by up to 10.8%, lowers energy consumption by 20%, and cuts the Deadline Miss Ratio (DMR) compared with the Priority-Aware Task-Scheduling (PaTS) baseline. Ablation experiments confirm the independent contribution of each algorithmic component. Scalability and sensitivity analyses further validate the robustness of MQPBS under heterogeneous arrival patterns and varying load intensities. The results establish MQPBS as a scalable, reliable scheduler for next-generation edge infrastructures.
Shibang Maity, Roshan Panda, M. Tanisha et al.· International Conference on...· 0 citations
Current end-to-end congestion-control feedback is too slow to track rapid wireless dynamics in cellular networks. We identify Grant-to-Buffer Ratio (GBR)—the ratio of base-station uplink grants to mobile-reported demand—as a millisecond-scale RAN signal of uplink resource scarcity. Measurements across AT&T, Verizon, and T-Mobile LTE/5G FDD/TDD deployments show that GBR tracks base-station uplink load and reveals congestion earlier than end-to-end feedback. Because GBR is derived from the mandatory BSR-grant exchange, it requires no base-station changes and captures scheduler decisions at their native timescale. We then design GBR-CC, a dual-loop controller that updates the sender rate on each GBR sample, using GBR for fast adaptation and end-to-end delay trends as a conservative fallback. This design lets the sender react before queues inflate while still handling non-radio bottlenecks through the outer loop. GBR-CC runs on commodity mobile devices without extra hardware or external tools. Experiments on commercial cellular networks show that GBR-CC improves average throughput over GCC by 50%, while reducing median playout latency by 32–53% and freeze rate by 60%; compared with BBR, it improves average throughput by 5% and halves median RTT.
Qiang Wu, Yuxin Liu, Tianyang Zhang et al.· Conference on Applications,...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
