{'fraction_non_alphanumeric': 0.020169851380042462, 'fraction_numerical': 0.0, 'mean_word_length': 5.371621621621622, '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}}
Globally optimal joint uplink base station association and power control for max-min fairness

In a heterogeneous network (HetNet) with a large number of low power base stations (BSs), proper user-BS association and power control is crucial to achieving desirable system performance. In this paper, we consider the joint BS association and power allocation problem for an uplink cellular network under the max-min fairness criterion. We first present a binary search method whereby a QoS (Quality of Service) constrained subproblem is solved at each step. Then, we propose a normalized fixed point iterative algorithm to directly solve the original problem and prove its geometric convergence to the global optimal solution, which implies the pseudo-polynomial time solvability of the considered problem. Simulation results show that the proposed normalized fixed point iterative algorithm converges much faster than the binary search method.