{'fraction_non_alphanumeric': 0.02895752895752896, 'fraction_numerical': 0.009652509652509652, 'mean_word_length': 4.994219653179191, '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}}
Bottleneck-first scheduling for real-time traffic in IEEE 802.11 infrastructure-based mesh networks

This paper studies the real-time traffic scheduling in IEEE 802.11 infrastructure-based wireless mesh networks. Providing strict latency guarantee for real-time traffic in a wireless mesh network is difficult, and one of the main challenges is the difficulty in coordinating temporal operations of the mesh access points (APs). In this paper we propose a bottleneck-first scheduling scheme (BFS) for voice traffic. In the proposed scheme, a central station is responsible for making scheduling decisions for all the real-time packet transmissions at the APs. Scheduling decisions at the APs with a higher traffic load are done before those with a lower traffic load. At each AP, voice packets with more end-to-end hops are scheduled first. Numerical results show that the proposed scheduling scheme achieves low transmission delay and high capacity in the mesh networks, compared to the simple first-come-first-serve scheduling scheme.