{'fraction_non_alphanumeric': 0.01865284974093264, 'fraction_numerical': 0.0, 'mean_word_length': 4.715976331360947, '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}}
Local delay in Poisson networks with and without interference

Communication between two neighboring nodes is the most basic operation in wireless networks. Yet very little research has focused on the local delay, defined as the mean time it takes a node to connect to a nearby neighbor. This problem is non-trivial when link distances are random but static, as is the case when the node distribution of a static network is modeled as a stochastic point process. We first consider the interference-free case, where links are independent, to study how fading and power control affect the delay in links of random distance. We find that power control is essential to keep the delay finite, and that randomized power control can drastically reduce the required (mean) power for finite local delay. Secondly, we study the local delay in a Poisson network with ALOHA, including both interference and noise. In this case we present an analytical bound on the local delay.