{'fraction_non_alphanumeric': 0.0236318407960199, 'fraction_numerical': 0.012437810945273632, 'mean_word_length': 5.098484848484849, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Throughput analysis of a novel backoff algorithm for IEEE 802.11 WLANs

The IEEE 802.11 medium access control (MAC) adopts binary exponential backoff (BEB) to provide a contention-based channel access mechanism in the wireless medium. But many researches have shown that BEB may deteriorate the performance when the number of stations increases. In this paper, we propose a new contention window (CW) control algorithm called TB (Tender Backoff) which can tenderly adjust the appropriate CW size. We will analyze the saturated throughput and compare TB with other backoff algorithms. The approach will be examined both by numerical analysis and simulation results. Furthermore, we also do a thorough analysis on the relationship between the CW size and throughput with the incremental amount of stations.