{'fraction_non_alphanumeric': 0.012263099219620958, 'fraction_numerical': 0.0, 'mean_word_length': 5.414285714285715, '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}}
A geometrical analysis of obstructed wireless networks

Obstructions between communicating pairs reduce the reliability of data transfer in high frequency wireless networks, for which Vehicular Ad Hoc Networks serve as an emerging example. In this paper we introduce a geometric framework which enables us to analyze the effect of obstacles on the capacity of such networks. Towards this goal, we introduce concepts from combinatorial geometry (such as hidden sets and link distances) which later prove useful in our analysis of the worst case geocast capacity of obstructed wireless networks. The authors have previously utilized similar notions to propose geometry-aware communications algorithms and also to tackle the roadside unit deployment problem in such networks. We believe that this study is a pioneer in blending the effect of obstacles into prior capacity-related theoretical results.