{'fraction_non_alphanumeric': 0.01616915422885572, 'fraction_numerical': 0.0, 'mean_word_length': 6.1875, '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 Galois Fields and Its Hardware Implementation

Neighbor discovery is essential in all channel access protocols based on transmission scheduling, whether such protocols are topology-dependent or topology-independent. We propose a novel approach to neighbor discovery based on relative GPS coordinates (RGPS), extending the work by Chlamtac and Farago on topology-transparent transmission scheduling. The proposed approach attains neighbor discovery with timing guarantees, which yields greater scalability and requires smaller transmission compared to neighbor discovery mechanisms based on probabilistic methods. We further present the design and implementation of a hardware accelerator for evaluating the Galois field polynomials used in the proposed neighbor-discovery scheme.