{'fraction_non_alphanumeric': 0.023809523809523808, 'fraction_numerical': 0.005747126436781609, 'mean_word_length': 5.156565656565657, '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}}
Demand-Aware Load Balancing in Wireless LANs Using Association Control

The densely deployed Access Points (APs) have overlapping coverage areas. In the hotspot area, a user can usually receive signals of more than ten APs. The signal-based association in IEEE 802.11 may result in significant unbalanced loads among APs. Moreover, diverse user demands on bandwidth further exacerbate the load unbalance. Some APs are too overloaded when multiple high-demand users gather on them due to the strongest signal, while the others are light-loaded with a few low-demand users associated to them. The severe load unbalance degrades the user performance. In this paper, by adding different user bandwidth demands as new constraints, we formulate the joint AP association and bandwidth allocation problem. We comprehensively analyze the solution space of optimal bandwidth allocation while satisfying the time-based fairness among users. We develop a 1/2-approximation algorithm to solve the problem. Our extensive trace- driven evaluations show that our algorithm achieves better load balance. As a result, it greatly improves the aggregated throughput and provides better user fairness than conventional association schemes.