The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article propose et étudie un algorithme d'ajustement adaptatif distribué de fenêtre de contention basé sur l'historique de transmission pour les réseaux locaux sans fil, appelé algorithme d'ajustement adaptatif distribué de fenêtre de contention (THAW) basé sur l'historique de transmission. L'objectif de cet article est de réduire le délai de transmission et d'améliorer le débit du canal par rapport aux algorithmes conventionnels. La fonctionnalité de THAW est qu'il ajuste de manière adaptative la fenêtre de contention initiale (CWinit) taille dans l'algorithme de réduction exponentielle binaire (BEB) utilisé dans la norme IEEE 802.11 en fonction de l'historique de transmission et de l'algorithme de repli automatique du débit (ARF), qui est l'algorithme le plus basique dans les contrôles automatiques du débit. Cet effet est de garder CWinit à une valeur élevée dans un état encombré. Les résultats de la simulation montrent que l'algorithme THAW surpasse les algorithmes conventionnels en termes de débit et de délai de canal, même si le temporisateur de l'ARF est modifié.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masakatsu OGAWA, Takefumi HIRAGURI, Kentaro NISHIMORI, Kazuhiro TAKAYA, Kazuo MURAKAWA, "Transmission History Based Distributed Adaptive Contention Window Adjustment Algorithm Cooperating with Automatic Rate Fallback for Wireless LANs" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 8, pp. 2063-2072, August 2010, doi: 10.1587/transcom.E93.B.2063.
Abstract: This paper proposes and investigates a distributed adaptive contention window adjustment algorithm based on the transmission history for wireless LANs called the transmission-history-based distributed adaptive contention window adjustment (THAW) algorithm. The objective of this paper is to reduce the transmission delay and improve the channel throughput compared to conventional algorithms. The feature of THAW is that it adaptively adjusts the initial contention window (CWinit) size in the binary exponential backoff (BEB) algorithm used in the IEEE 802.11 standard according to the transmission history and the automatic rate fallback (ARF) algorithm, which is the most basic algorithm in automatic rate controls. This effect is to keep CWinit at a high value in a congested state. Simulation results show that the THAW algorithm outperforms the conventional algorithms in terms of the channel throughput and delay, even if the timer in the ARF is changed.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2063/_p
Copier
@ARTICLE{e93-b_8_2063,
author={Masakatsu OGAWA, Takefumi HIRAGURI, Kentaro NISHIMORI, Kazuhiro TAKAYA, Kazuo MURAKAWA, },
journal={IEICE TRANSACTIONS on Communications},
title={Transmission History Based Distributed Adaptive Contention Window Adjustment Algorithm Cooperating with Automatic Rate Fallback for Wireless LANs},
year={2010},
volume={E93-B},
number={8},
pages={2063-2072},
abstract={This paper proposes and investigates a distributed adaptive contention window adjustment algorithm based on the transmission history for wireless LANs called the transmission-history-based distributed adaptive contention window adjustment (THAW) algorithm. The objective of this paper is to reduce the transmission delay and improve the channel throughput compared to conventional algorithms. The feature of THAW is that it adaptively adjusts the initial contention window (CWinit) size in the binary exponential backoff (BEB) algorithm used in the IEEE 802.11 standard according to the transmission history and the automatic rate fallback (ARF) algorithm, which is the most basic algorithm in automatic rate controls. This effect is to keep CWinit at a high value in a congested state. Simulation results show that the THAW algorithm outperforms the conventional algorithms in terms of the channel throughput and delay, even if the timer in the ARF is changed.},
keywords={},
doi={10.1587/transcom.E93.B.2063},
ISSN={1745-1345},
month={August},}
Copier
TY - JOUR
TI - Transmission History Based Distributed Adaptive Contention Window Adjustment Algorithm Cooperating with Automatic Rate Fallback for Wireless LANs
T2 - IEICE TRANSACTIONS on Communications
SP - 2063
EP - 2072
AU - Masakatsu OGAWA
AU - Takefumi HIRAGURI
AU - Kentaro NISHIMORI
AU - Kazuhiro TAKAYA
AU - Kazuo MURAKAWA
PY - 2010
DO - 10.1587/transcom.E93.B.2063
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2010
AB - This paper proposes and investigates a distributed adaptive contention window adjustment algorithm based on the transmission history for wireless LANs called the transmission-history-based distributed adaptive contention window adjustment (THAW) algorithm. The objective of this paper is to reduce the transmission delay and improve the channel throughput compared to conventional algorithms. The feature of THAW is that it adaptively adjusts the initial contention window (CWinit) size in the binary exponential backoff (BEB) algorithm used in the IEEE 802.11 standard according to the transmission history and the automatic rate fallback (ARF) algorithm, which is the most basic algorithm in automatic rate controls. This effect is to keep CWinit at a high value in a congested state. Simulation results show that the THAW algorithm outperforms the conventional algorithms in terms of the channel throughput and delay, even if the timer in the ARF is changed.
ER -