{'fraction_non_alphanumeric': 0.01892744479495268, 'fraction_numerical': 0.015772870662460567, 'mean_word_length': 5.181818181818182, '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}}
Joint Channel Selection and Spatial Reuse for Starvation Mitigation in IEEE 802.11ax WLANs

Starvation problems in a dense IEEE 802.11 wireless local area network (WLAN) seriously degrade fairness among links in the network. Some transmitters enjoy the full opportunities to access their channels, while others have very few opportunities to transmit, especially when network traffic is saturated. This paper focuses on the joint channel selection and spatial reuse problems in IEEE 802.11ax WLANs. Our main objective is to improve throughput while mitigating starvation. We formulate a non-cooperative game and proved it to be an exact potential game (EPG). We design a joint channel selection and spatial reuse algorithm with only local information exchange, based on the proposed game model. Convergence of the proposed algorithm is guaranteed by the property of potential games when unilateral improvement dynamics is used as a learning algorithm.