{'fraction_non_alphanumeric': 0.021447721179624665, 'fraction_numerical': 0.0, 'mean_word_length': 5.384615384615385, '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}}
GenS: A new conflict-free link scheduler for next generation of wireless systems

Conflict-free link scheduling assigns separate resources to conflicting links while taking advantage of possible reuse opportunities. Minimizing the consumed resources is NP-hard. In this paper, a polynomial-time heuristic, GenS, is introduced that models scheduling as a travelling salesman problem. GenS approximates the solution to the scheduling problem with significant reduction of complexity compared to the state of the art algorithms. GenS can be employed in general network topologies and due to its scalability and a close-to-optimal resource utilization compared to the existing literature, it is desirable for the next generations of wireless systems.