{'fraction_non_alphanumeric': 0.014804845222072678, 'fraction_numerical': 0.021534320323014805, 'mean_word_length': 4.858267716535433, '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}}
Performance evaluation of backoff algorithms for medium access in wireless networks

Consider a backoff algorithm for medium access in wireless networks where a node chooses with probability 1−q to transmit right away and with probability q to transmit after CW slots, where CW is the maximum value of the contention window. We study a variation of the 802.11 protocol called XVBEB which uses the above backoff scheme and give a theoretical analysis of its saturation throughput. Simulation results show that the throughput of XVBEB is better than that of 802.11 for saturated CBR traffic. Furthermore, XVBEB also exhibits lower packet loss, delay and delay variation than 802.11 for both VBR and VoIP traffic for a variety of load conditions.