Transmission History Based Distributed Adaptive Contention Window Adjustment Algorithm Cooperating with Automatic Rate Fallback for Wireless LANs
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.8 pp.2063-2072
- Publication Date
- 2010/08/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.2063
- Type of Manuscript
- Special Section PAPER (Special Section on Implementation, Experiments, and Practice for Ad Hoc and Mesh Networks)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
