{'fraction_non_alphanumeric': 0.014507772020725389, 'fraction_numerical': 0.0051813471502590676, 'mean_word_length': 5.44, '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}}
Design and throughput analysis of an a backoff scheme for wireless LANs

In order to improve the performance of IEEE 802.11 Distributed Coordination Function (DCF) scheme which is widely used for Ad Hoc networks and wireless LANs, a new adaptive minimum contention window binary exponential backoff algorithm (referred to as AWBEB algorithm) is proposed. Then we model the AWBEB algorithm scheme by bidimensional discrete-time Markov Chain, the transmission probability for a node and the stationary distribution probabilities of AWBEB algorithm are derived. The throughput and the saturation throughput of the proposed scheme are investigated by numerical analysis and simulation. The AWBEB algorithm operates closer to the theoretical limit quickly. The study results show that the system throughputs of AWBEB algorithm are better than that of DCF algorithm, and the results of AWBEB throughputs simulated by program agree with the calculation results preferably.