Adaptive Binary Negative-Exponential Backoff Algorithm Based on Contention Window Optimization in IEEE 802.11 WLAN

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 259
  • Download : 0
IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.
Publisher
KSII-KOR SOC INTERNET INFORMATION
Issue Date
2010-10
Language
English
Article Type
Article
Keywords

WIRELESS LANS; PERFORMANCE EVALUATION; DCF; THROUGHPUT; COLLISION; MECHANISM

Citation

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, v.4, no.5, pp.896 - 909

ISSN
1976-7277
DOI
10.3837/tiis.2010.10.011
URI
http://hdl.handle.net/10203/94812
Appears in Collection
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0