Reinforcement learning-based optimization of the transmission state and random backoff history mechanism for IEEE 802.11 DCF

BMC Bioinformatics · Springer Nature · 2026-10-21 · DOI: 10.1007/s11235-026-01536-7

Аннотация

In this paper, we design new reinforcement learning schemes to optimize CW sizes for the CSMA/CA protocol in IEEE 802.11 wireless technology. Each station in the wireless network is considered an ‘agent’. The states are determined by the contention window sizes, as in the binary exponential backoff algorithm, and the result of the two consecutive transmissions. The ‘action’ is considered the rule to update the contention window after each transmission. This rule is picked by the $$\epsilon $$-greedy policy. In the simulations, we evaluate both the Q-learning and Double Q-learning algorithms. We apply them to the transmission history backoff probability scheme to investigate the performance of a dense network with up to 50 stations, randomly distributed in an ad hoc grid topology. The simulation results show that our schemes significantly reduce the average delay, resulting in higher throughput.

Читать у издателя →

Похожие статьи