TY - GEN
T1 - A Collision Rate-Based Backoff Algorithm for Contention-Based Wireless Networks
AU - Lin, Cheng Han
AU - Tsai, Yu Chin
AU - Wei, Yu Hang
AU - Shieh, Ce Kuen
N1 - Funding Information:
ACEOLNWK MENDG ST isTh ow rk aw s suopp rted by te h inM istry of ciS ence and Tecnh oloyg ,T)(MOS Taiaw n under Contract oN . TSMO 106-2218-E-242-001 and TSOM 106-2813-C-242-007-E.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/9/11
Y1 - 2018/9/11
N2 - Following the rapid development of wireless networks, IEEE 802.11 technology has become the most widely used wireless network access technology. The contention channel of the distributed coordination function (DCF) is the default mechanism, which is used to determine the waiting time required before sending data. Once any collision has happened, the contention window expands to prevent future collisions, whereas when data has been successfully transmitted, the contention window shrinks to reduce backoff time. Determination of the increase or decrease of contention windows has become a vital to the transmission performance of networks. Through experimentation with different numbers of stations and different contention window sizes, this study found a collision rate range with superior efficiency, and thus proposed a collision rate-based backoff algorithm (CRBA). The proposed algorithm adjusts the contention window size according to collision rate, achieving enhanced efficiency and a reduced collision rate. According to the analysis of experimental results, the CRBA outperformed other relevant channel contention mechanisms (BEB, EIED, LILD, and ELBA) in terms of throughput, collision rate, and channel utilization rate.
AB - Following the rapid development of wireless networks, IEEE 802.11 technology has become the most widely used wireless network access technology. The contention channel of the distributed coordination function (DCF) is the default mechanism, which is used to determine the waiting time required before sending data. Once any collision has happened, the contention window expands to prevent future collisions, whereas when data has been successfully transmitted, the contention window shrinks to reduce backoff time. Determination of the increase or decrease of contention windows has become a vital to the transmission performance of networks. Through experimentation with different numbers of stations and different contention window sizes, this study found a collision rate range with superior efficiency, and thus proposed a collision rate-based backoff algorithm (CRBA). The proposed algorithm adjusts the contention window size according to collision rate, achieving enhanced efficiency and a reduced collision rate. According to the analysis of experimental results, the CRBA outperformed other relevant channel contention mechanisms (BEB, EIED, LILD, and ELBA) in terms of throughput, collision rate, and channel utilization rate.
UR - http://www.scopus.com/inward/record.url?scp=85054842976&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054842976&partnerID=8YFLogxK
U2 - 10.1109/CCOMS.2018.8463348
DO - 10.1109/CCOMS.2018.8463348
M3 - Conference contribution
AN - SCOPUS:85054842976
SN - 9781538663509
T3 - 2018 3rd International Conference on Computer and Communication Systems, ICCCS 2018
SP - 109
EP - 112
BT - 2018 3rd International Conference on Computer and Communication Systems, ICCCS 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd International Conference on Computer and Communication Systems, ICCCS 2018
Y2 - 27 April 2018 through 30 April 2018
ER -