{'fraction_non_alphanumeric': 0.01499531396438613, 'fraction_numerical': 0.004686035613870665, 'mean_word_length': 5.209302325581396, '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}}
Modeling the Effect of BEB for a Hidden Terminal Topology from a New Perspective

The last couple of years were characterised by the revival of interest in the performance evaluation of wireless multihop networks. An issue of great significance in carrier-sense based multihop networks is the hidden node problem. In our recent work we showed that previous techniques are suitable for limited node configurations and we proposed a novel time model that relaxes most assumptions in the literature and exhibits high accuracy of performance evaluation. The present paper extends our recent work, which was based on a constant contention window assumption, to the binary exponential backoff (BEB) mechanism of IEEE 802.11, with an equally high degree of agreement to simulation results. Key points of our analysis are the consideration of different collision probabilities, dependent on the backoff stage, and the use of a discrete time Markov chain embedded in the channel state evolution that allows us to compute the 'backoff-dwelling' distribution of each transmitter