Improvement for contention window mechanism using the transmission state and random backoff history in IEEE 802.11 WLANs

In IEEE 802.11 WLAN networks, the Binary Exponential Backoff (BEB) protocol has been used to avoid collisions due to channel errors, but it is less efficient for dense networks with many transmitting nodes. In this work, we propose a new scheme for adapting the contention window based on the transmission state and random backoff history. We propose four transmission states by aggregating the success or failure status of previous and current transmissions. These states are the conditions for selecting the increasing or decreasing contention window for the subsequent transmission time. The ratio between the random backoff value and the contention window partially determines the amount of change for the new contention window. We use NS-3 simulations to evaluate the performance of our scheme. The results show that the scheme can improve the total throughput and average delay and be more efficient with more nodes.

Authors

Institutions

Publication Details

Journal
Vietnam Journal of Science and Technology/Science and Technology
Published
2026-08-28
DOI
https://doi.org/10.15625/2525-2518/23094
Primary Topic
Wireless Networks and Protocols
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improvement for contention window mechanism using the transmission state and random backoff history in IEEE 802.11 WLANs

Nguyễn Thị Vân Anh, Giang Pham Thanh
Vietnam Journal of Science and Technology/Science and Technology
Wireless Networks and Protocols
article

Improvement for contention window mechanism using the transmission state and random backoff history in IEEE 802.11 WLANs

Nguyễn Thị Vân Anh, Giang Pham Thanh
article en

Abstract

In IEEE 802.11 WLAN networks, the Binary Exponential Backoff (BEB) protocol has been used to avoid collisions due to channel errors, but it is less efficient for dense networks with many transmitting nodes. In this work, we propose a new scheme for adapting the contention window based on the transmission state and random backoff history. We propose four transmission states by aggregating the success or failure status of previous and current transmissions. These states are the conditions for selecting the increasing or decreasing contention window for the subsequent transmission time. The ratio between the random backoff value and the contention window partially determines the amount of change for the new contention window. We use NS-3 simulations to evaluate the performance of our scheme. The results show that the scheme can improve the total throughput and average delay and be more efficient with more nodes.

Vietnam Journal of Science and Technology/Science and Technology
Vietnam Academy of Science and Technology (VN)
Vietnam Academy of Science and Technology
Openalex Percentile: Top 99%
Wireless Networks and Protocols
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.