TY - GEN
T1 - A novel MAC protocol for improving throughput and fairness in WLANs
AU - Tian, Xuejun
AU - Chen, Xiang
AU - Fang, Yuguang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2005
Y1 - 2005
N2 - Many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, however, 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. 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. © Springer-Verlag Berlin Heidelberg 2005.
AB - Many schemes have been proposed to enhance throughput or fairness of the original IEEE 802.11 standard, however, 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. 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. © Springer-Verlag Berlin Heidelberg 2005.
UR - http://www.scopus.com/inward/record.url?scp=33646841626&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33646841626&origin=recordpage
U2 - 10.1007/11599463_92
DO - 10.1007/11599463_92
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 3540308563
SN - 9783540308560
VL - 3794 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 950
EP - 965
BT - Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings
T2 - 1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005
Y2 - 13 December 2005 through 15 December 2005
ER -