Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff

Xuejun TIAN; Xiang CHEN; Tetsuo IDEGUCHI; Yuguang FANG

doi:10.1093/ietcom/e88-b.11.4328

Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff

Xuejun TIAN, Xiang CHEN, Tetsuo IDEGUCHI, Yuguang FANG

Full Text Views

0

Cite this

Summary :

Given the limited channel capacity in wireless LANs, it is important to achieve high throughput and good fairness through medium access control (MAC) schemes. Although many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, they either fail to consider both throughput and fairness, or to do so with complicated algorithms. In this paper, we propose a new MAC scheme that dynamically optimizes each active node's backoff process. The key idea is to enable each node to adjust its Contention Window (CW) to approach the optimal one that will maximize the throughput. Meanwhile, when the network enters into steady state in saturated case, i.e., under heavy traffic load, all the nodes will maintain approximately identical CWs, which guarantees fair share of the channel among all nodes. A distinguishing feature of this scheme is the use of an index called average channel idle interval for optimizing the backoff process without estimating the number of active nodes in networks. We show through theoretical analysis that the average channel ideal interval can represent current network traffic load and indicate the optimal CW. Moreover, since it can be obtained through direct measurement, our scheme eliminates the need for complicated estimation of the number of active nodes as required in previous schemes, which makes our schemes simpler and more reliable when network traffic changes frequently. Through simulation comparison with previous schemes, we show that our scheme can greatly improve the throughput no matter the network is in saturated or non-saturated case, while maintaining good fairness.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.11 pp.4328-4338

Publication Date: 2005/11/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.11.4328

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Cite this

Copy

Xuejun TIAN, Xiang CHEN, Tetsuo IDEGUCHI, Yuguang FANG, "Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 11, pp. 4328-4338, November 2005, doi: 10.1093/ietcom/e88-b.11.4328.
Abstract: Given the limited channel capacity in wireless LANs, it is important to achieve high throughput and good fairness through medium access control (MAC) schemes. Although many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, they either fail to consider both throughput and fairness, or to do so with complicated algorithms. In this paper, we propose a new MAC scheme that dynamically optimizes each active node's backoff process. The key idea is to enable each node to adjust its Contention Window (CW) to approach the optimal one that will maximize the throughput. Meanwhile, when the network enters into steady state in saturated case, i.e., under heavy traffic load, all the nodes will maintain approximately identical CWs, which guarantees fair share of the channel among all nodes. A distinguishing feature of this scheme is the use of an index called average channel idle interval for optimizing the backoff process without estimating the number of active nodes in networks. We show through theoretical analysis that the average channel ideal interval can represent current network traffic load and indicate the optimal CW. Moreover, since it can be obtained through direct measurement, our scheme eliminates the need for complicated estimation of the number of active nodes as required in previous schemes, which makes our schemes simpler and more reliable when network traffic changes frequently. Through simulation comparison with previous schemes, we show that our scheme can greatly improve the throughput no matter the network is in saturated or non-saturated case, while maintaining good fairness.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.11.4328/_p

Copy

@ARTICLE{e88-b_11_4328,
author={Xuejun TIAN, Xiang CHEN, Tetsuo IDEGUCHI, Yuguang FANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff},
year={2005},
volume={E88-B},
number={11},
pages={4328-4338},
abstract={Given the limited channel capacity in wireless LANs, it is important to achieve high throughput and good fairness through medium access control (MAC) schemes. Although many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, they either fail to consider both throughput and fairness, or to do so with complicated algorithms. In this paper, we propose a new MAC scheme that dynamically optimizes each active node's backoff process. The key idea is to enable each node to adjust its Contention Window (CW) to approach the optimal one that will maximize the throughput. Meanwhile, when the network enters into steady state in saturated case, i.e., under heavy traffic load, all the nodes will maintain approximately identical CWs, which guarantees fair share of the channel among all nodes. A distinguishing feature of this scheme is the use of an index called average channel idle interval for optimizing the backoff process without estimating the number of active nodes in networks. We show through theoretical analysis that the average channel ideal interval can represent current network traffic load and indicate the optimal CW. Moreover, since it can be obtained through direct measurement, our scheme eliminates the need for complicated estimation of the number of active nodes as required in previous schemes, which makes our schemes simpler and more reliable when network traffic changes frequently. Through simulation comparison with previous schemes, we show that our scheme can greatly improve the throughput no matter the network is in saturated or non-saturated case, while maintaining good fairness.},
keywords={},
doi={10.1093/ietcom/e88-b.11.4328},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Improving Throughput and Fairness in WLANs through Dynamically Optimizing Backoff
T2 - IEICE TRANSACTIONS on Communications
SP - 4328
EP - 4338
AU - Xuejun TIAN
AU - Xiang CHEN
AU - Tetsuo IDEGUCHI
AU - Yuguang FANG
PY - 2005
DO - 10.1093/ietcom/e88-b.11.4328
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2005
AB - Given the limited channel capacity in wireless LANs, it is important to achieve high throughput and good fairness through medium access control (MAC) schemes. Although many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, they either fail to consider both throughput and fairness, or to do so with complicated algorithms. In this paper, we propose a new MAC scheme that dynamically optimizes each active node's backoff process. The key idea is to enable each node to adjust its Contention Window (CW) to approach the optimal one that will maximize the throughput. Meanwhile, when the network enters into steady state in saturated case, i.e., under heavy traffic load, all the nodes will maintain approximately identical CWs, which guarantees fair share of the channel among all nodes. A distinguishing feature of this scheme is the use of an index called average channel idle interval for optimizing the backoff process without estimating the number of active nodes in networks. We show through theoretical analysis that the average channel ideal interval can represent current network traffic load and indicate the optimal CW. Moreover, since it can be obtained through direct measurement, our scheme eliminates the need for complicated estimation of the number of active nodes as required in previous schemes, which makes our schemes simpler and more reliable when network traffic changes frequently. Through simulation comparison with previous schemes, we show that our scheme can greatly improve the throughput no matter the network is in saturated or non-saturated case, while maintaining good fairness.
ER -