Jul 2026· International Conference on Signal Processing and Communications· pp. 1-5· 0 citations· 11 references
Abstract
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.
In vehicle-to-infrastructure (V2I) communication the setting of IEEE 802.11 Distributed Coordination Function (DCF) parameters has a decisive bearing on performance, yet the literature seldom pins down how much each parameter actually matters once traffic, MAC and queueing are modelled together. Treating a previously validated analytical framework as a fixed deterministic input-output map, we rank the DCF and traffic parameters that shape throughput, collision probability, delay, packet delivery ratio and Age of Information in a single-AP V2I network. A local one-factor-at-a-time analysis, cast in dimensionless elasticities so that parameters of different units become comparable, is paired with a variance-based global analysis built on first-order and total-effect Sobol indices. Two clean groups emerge: collision probability is set by the contending-vehicle population -- itself governed by vehicle velocity and density -- together with the minimum contention window, whereas delay is driven by the channel rate, the offered load and the packet size, and carries strong interaction effects that no local reading can expose. We then derive the closed-form structure of these sensitivities from the model relations, which explains the rankings, forces certain parameters into equal-magnitude elasticities, and locates where the local ranking reverses. Finally the collision-sensitivity structure is turned into a design output rather than a ranking: a closed-form contention-window control law, linear in the contending population and closed with a Greenshields density model, that a roadside access point can evaluate online from measured density or velocity. The fixed IEEE 802.11 default is recovered as the single population at which this law is optimal; away from it the throughput gain grows with density and is largest in the dense, safety-critical regime.
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).
Hiya Shah· International Conference on...· 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
For military wireless communications, the MIL-STD-188-220 standard utilizes various Network Access Delay (NAD) mechanisms to efficiently allocate transmission slots within a shared medium. Among these, the random NAD (R-NAD) protocol is widely adopted for dynamic traffic environments. To evaluate the fundamental capacity and performance limits of single-hop ad hoc networks where all nodes operate within a direct radio range, a rigorous analysis under saturation conditions is essential. Despite its critical importance, a comprehensive theoretical framework that analyzes R-NAD performance under saturation and determines the maximum number of retransmissions required to guarantee specific packet delivery targets has been lacking. To address this issue, this paper provides a thorough performance analysis of the R-NAD protocol under saturation conditions, deriving key metrics such as transmission rate, loss probability, and average delay. Based on these analytical results, we propose a practical and simplified formula for determining the minimum value of the maximum retransmission count required to satisfy a specific target loss probability. Extensive simulations demonstrate that our theoretical derivations are exceptionally well-matched with simulation data. Furthermore, we show that selecting the precise maximum number of retransmissions that meets the target loss probability effectively prevents unnecessary average delay while strictly satisfying the network’s loss requirements, thereby providing a practical guideline for effective system configuration.
This manuscript investigates the challenges arising from the interaction between cell discontinuous transmission/reception (DTX/DRX) for network energy saving (NES) and contention-based random access (CBRA) in 5G new radio (NR) networks and beyond. While cell DTX/DRX significantly reduces network power consumption, it can negatively impact CBRA performance by increasing access delay and reducing the success rate. To address these issues, we propose two enhanced CBRA schemes with mathematical modeling and Monte Carlo simulation results demonstrating significant improvements in CBRA performance under dense 5G NR and 6G NES environments. The first scheme introduces a Secondary MSG1 Opportunity to dynamically allocate radio resources and mitigate collisions. The second scheme employs Multiple Uplink (UL) Grant Occasions for MSG3 to reduce contention among User Equipments (UEs). We detail the operation of the proposed CBRA schemes and analyze their potential to improve CBRA performance in 5G NR and beyond, while effectively supporting NES.
Jisoo Park, J. Ahn, Junhwan Lee· International Conference on...· 0 citations
The rapid evolution of 5G and emerging 6G networks requires optical access systems to support immersive extended reality (XR) services with stringent quality-of-service (QoS) requirements, like ultra-low latency and high bandwidth. However, conventional dynamic bandwidth allocation (DBA) schemes in passive optical networks (PONs) allocate upstream bandwidth solely based on reported queue occupancy, without considering the unique characteristics of XR traffic. To address these limitations, we propose an XR-aware Predictive (XP)-DBA scheme that integrates XR traffic prediction, deadline-aware scheduling, adaptive grant control, and a cycle-controller to proactively allocate bandwidth, prioritize latency-critical packets, and limit polling-cycle growth. We also derive closed-form analytical expressions to characterize XR-specific stability and delay feasibility in PON systems. We evaluate XP-DBA under standardized and burst-enhanced XR traffic models across varying XR user densities and transmission distances of up to 100 km. The results show that XP-DBA will reduce latency, jitter, and polling-cycle time while increasing throughput and supporting higher XR user densities under heavy network loads without violating XR delay bounds. These findings establish XP-DBA as an efficient and scalable scheduling solution for next-generation immersive XR services over long-reach optical access networks.
Akhilesh Patel, Y. Singh· IEEE Transactions on Network...· 0 citations