This work ranks the DCF and traffic parameters that shape throughput, collision probability, delay, packet delivery ratio and Age of Information in a single-AP V2I network, and derives a closed-form contention-window control law, linear in the contending population and closed with a Greenshields density model.
Abstract
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.
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
This study provides an efficient joint optimization scheme for building high-capacity, wide-coverage, and long-lifespan complex Internet of Things (IoT) networks.
Shengli Pang, Yuanyuan Ma, Xianjin Cheng et al.· Italian National Conference...· 1 citation
Access Layer Instance (ALI) selection is essential for ensuring reliable performance in vehicular networks under multi-channel operation. Standardized mechanisms rely on limits to decide whether an ALI can handle traffic coming from a service with a set of requirements. These limits may refer to, e.g., channel utilization, data rate or transmit power. Following a policy, a node selects one of the available ALIs to send traffic through it. This selection can be performed based on using all suitable available ALIs equally (i.e., load balancing) or by turning them on in a sequence of prioritized ALIs that are to be filled sequentially. This letter introduces two congestion-aware mechanisms for ALI selection that consider not only channel occupancy, which is measured through the interval between transmissions allowed by Decentralized Congestion Control (DCC), but also local queue conditions. These measurements are reflected in a metric based on the waiting time before a message can get access to the medium, enabling more accurate and responsive ALI selection. Our results demonstrate that one of our proposed mechanisms, CALIS, significantly improves radio resource usage and application performance; and the other, CASF, improves the performance of the sequential filling mechanism while maintaining the ability to disable radios when traffic load allows it.
Oscar Amador, M. Urueña, M. Calderón et al.· IEEE Communications Letters· 0 citations
The proposed SPN model enables system architects to compare routing configurations, identify performance bottlenecks, and size infrastructure components without requiring physical deployment, and enables the identification of communication bottlenecks without requiring physical deployment.
José Miquéias Araújo, L. Lopes, Luiz Nelson Lima et al.· Journal of Internet Services...· 0 citations
A Proportional Fairness (PF)-driven framework for allocating Co-SR transmit power on a per-Transmission Opportunity (TXOP) basis is introduced, and it is proved that any Pareto-optimal power pair keeps at least one AP at its maximum power.
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
