{'fraction_non_alphanumeric': 0.013820335636722606, 'fraction_numerical': 0.0, 'mean_word_length': 5.76, '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 for decentralized slotted regular wireless networks

In this work, we are interested in characterizing the performance of decentralized multiple-access and retransmission schemes for wireless ad hoc networks. We are considering a regular linear network model of sender/receiver pairs, where nodes transmit their information messages over a common radio channel. We obtain expressions for node throughput as a function of internode separation for different retransmission protocols while communications are done in a single-hop fashion. Then we extend our model to take into account relaying between nodes. We analyze the achievable throughput under traffic patterns where local communication predominates, as a function of transmission distance and relay distance. Our analysis focuses on static ad hoc networks where we show that coding and retransmission provide reliable communication with a completely decentralized multiple-access strategy for both single-hop and multihop communications.