{'fraction_non_alphanumeric': 0.02330097087378641, 'fraction_numerical': 0.0, 'mean_word_length': 5.44375, '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}}
Novel MIMO Packet-Based Proportional Fairness Scheduling Framework

The key issue we address in this paper concerns how the available bandwidth within the downlink of a multiple-input multiple-output (MIMO) cellular network should be shared between competing users to achieve both fairness and high system throughput. We propose a high performance packet scheduling framework, called MIMO packet-based proportional fairness (MP-PF). The scheduler is work conserving and based on a novel proportional fairness concept that takes the packet length, users' backlogs, and users' guarantees into consideration. Furthermore, we gain an efficient packet-based framework in the MAC layer. Intensive simulation studies that took into consideration the traffic characteristics and the mobility of the users were used to demonstrate the superior performance of our scheduling framework for both the average delay of users and the time/service fairness. We also propose two useful equations for the time/service comparison of MIMO schedulers.