{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0, 'mean_word_length': 5.118881118881119, '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}}
Load Balance and User Association on HetNets

Heterogeneous Networks (HetNets) come as a clever approach to increase the capacity and the coverage of cellular networks in which low power base stations can share the load of high power ones. However, it also brought new challenges. For instance, user association strategies used on homogeneous networks are no longer so efficient. In this work, the user association problem is modeled as an integer linear programming (ILP) problem aiming to balance loads among macro and small cells. A greedy heuristic based on it, called LP_GREEDY, is presented. In addition, a distributed one, PROB_MIN_LOAD, is also introduced. These heuristics produce good solutions in terms of number of accepted users and load balancing among base stations in comparison with the optimal solution and with some strategies presented in the literature.