{'fraction_non_alphanumeric': 0.0189873417721519, 'fraction_numerical': 0.0, 'mean_word_length': 5.818965517241379, '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}}
On a throughput-efficient look-forward channel-aware scheduling

In this paper, we first present a detailed analysis for studying the effect of changing the time difference between two successive channel predictions on the outage probability and the system's reliable transmission rate. Secondly, we propose a low complexity heuristic scheduling algorithm that utilizes long-term ray tracing channel predictions to improve the system throughput in wireless networks. The proposed heuristic algorithm achieves almost identical throughput as the optimal scheduler and outperforms traditional channel-aware schedulers in terms of system's average throughput with low computational cost. The scheduler's performance is tested in the presence of Rayleigh fading and log-normal shadowing effects.