{'fraction_non_alphanumeric': 0.013186813186813187, 'fraction_numerical': 0.0, 'mean_word_length': 5.460992907801418, '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}}
Tree/Stack Splitting with Remainder for Distributed Wireless Medium Access Control with Multipacket Reception

In this paper, we propose the tree/stack splitting with remainder algorithm for distributed medium access control in a wireless network with multipacket reception. In order to reduce the length of a cycle and increase the network throughput, when the splitting with remainder algorithm is used, some nodes that attempt to transmit packets at the beginning of a cycle might have to postpone their packet retransmissions until the beginning of the next cycle. We demonstrate that the splitting with remainder algorithm outperforms the erasure algorithm and the probe algorithm. For the splitting with remainder algorithm, we analytically and accurately derive the network throughput and the average packet delay. We show that our analytical results are consistent with packet-based simulation results.