{'fraction_non_alphanumeric': 0.020428015564202335, 'fraction_numerical': 0.0, 'mean_word_length': 5.471698113207547, '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}}
Nash bargaining solution based user association optimization in HetNets

In this paper, a fair user association scheme is proposed for heterogeneous networks (HetNets), where the user association optimization is formulated as a Nash bargaining problem. The optimization objective is to maximize the sum of rate related utility, under users' minimal rate constrains, while considering user fairness and load balance between cells in different tiers. Nash bargaining solution and coalition are adopted to solve this optimization problem. Firstly, a two-player bargaining scheme is developed for two base stations (BSs) to bargain user association. Then this two-player scheme is extended to a multi-player bargaining scheme with the aid of Hungarian algorithm that optimally groups BSs into pairs. Simulation results show that the proposed scheme can effectively offload users from macrocells, improve user fairness, and also achieve comparable sum rate to the scheme that maximizes the sum rate without considering user fairness.