{'fraction_non_alphanumeric': 0.022222222222222223, 'fraction_numerical': 0.0015873015873015873, 'mean_word_length': 5.533678756476684, '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 and Power Allocation Based on Generalized Nash Bargaining Solution in Device-to-Device Communication

In this paper, a new generalized Nash bargaining framework is proposed for joint channel and power allocation in device-to-device (D2D) communication underlying cellular networks. In the considered system, cellular users (CUs) must jointly determine to share radio resources with D2D users (DUs) and to charge the DUs accordingly. The proposed framework aims to maximize the overall throughput of the communication system by guaranteeing the minimum rate of each CU and proportional fairness and efficient power allocation among the CUs and DUs. To make this NP-hard problem more tractable, it is decomposed into two sub-problems: channel assignment and power allocation. First, an optimal channel assignment strategy is derived using a max-weighted max-flow algorithm. Then, the optimal power allocation strategy for both DUs and CUs is analyzed using the Lagrangian multiplier method. Numerical results are presented to show the throughput performance characteristics of different resource allocation solutions. Comparisons between the proposed and traditional policies show the significant effect of fairness on the transmission performance.