{'fraction_non_alphanumeric': 0.013278855975485188, 'fraction_numerical': 0.0, 'mean_word_length': 5.363636363636363, '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}}
Neighbor discovery using directional antennae for connectivity of wireless networks

We solve a neighbor discovery problem for a wireless ad hoc network using directional antennae, in order to achieve k-connectivity. Highly connected network enables each node to transmit its data to any other nodes. In high density network, high connectivity is easily achieved since each node has sufficiently many neighbors. However, radio transmission range should be increased for high connectivity in low density network. To increase transmission range, we use directional antennae without increasing transmission power in this paper. We derive optimal beam width for the directional antennae to achieve a given connectivity in a random directional neighbor discovery algorithm. The required time to achieve a given connectivity is also considered. Results in this paper could be used to derive solutions that minimize the required time while achieving a given connectivity in the network.