{'fraction_non_alphanumeric': 0.01943198804185351, 'fraction_numerical': 0.0, 'mean_word_length': 4.982142857142857, '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}}
QoS-aware fair scheduling in multihop wireless ad hoc networks

Providing fairness and maintaining a certain quality of service (QoS) in shared medium, multihop wireless networks are challenging, due to the unique characteristics of these networks. In this paper we consider the presence of both guaranteed and best-effort flows in the network. The aim is to ensure minimum required bandwidth to the best-effort flows and provide an equal share of residual bandwidth to all the flows. We propose a flow weight calculation scheme to both guaranteed and best-effort flows and a distributed, localized mechanism to implement the time-stamp based ad hoc fair queueing model