{'fraction_non_alphanumeric': 0.01633605600933489, 'fraction_numerical': 0.0, 'mean_word_length': 5.402985074626866, '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}}
Efficient centralized link scheduling algorithms in wireless mesh networks

Wireless mesh networks (WMNs) have been developed to answer the needs of many wireless applications. A major limiting parameter of the performance of WMNs is the interference between the several communications that occur simultaneously in the same network. To address this limitation, an adequate scheduling algorithm has to be implemented. Hence, this paper focuses on the scheduling problem under the physical interference model. This problem is known to be NP-Hard problem. In this paper we develop and propose two efficient scheduling algorithms. We evaluate their performances by simulation in terms of spatial reuse and we compare their performance with known previously-proposed algorithms. We show that our proposed algorithms provide high performances with low complexity.