{'fraction_non_alphanumeric': 0.022808267997148968, 'fraction_numerical': 0.005702066999287242, 'mean_word_length': 4.924050632911392, '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}}
Reuse of Multiple Channels by Multiple D2D Pairs in Dedicated Mode: A Game Theoretic Approach

Device-to-device communication (D2D) is expected to accommodate high data rates and to increase the spectral efficiency of mobile networks. The D2D pairs can opportunistically exploit channels that are not allocated to conventional users in a dedicated mode. To increase the sum capacity of D2D pairs in the dedicated mode, we propose a novel solution that allows the reuse of multiple channels by multiple D2D pairs. In the first step, the bandwidth is split among D2D pairs so that each pair communicates at a single channel that guarantees a minimal capacity for each pair. Then, the channel reuse is facilitated via a grouping of the D2D pairs into coalitions. The D2D pairs within one coalition mutually reuse the channels of each other. We propose two approaches for the creation of the coalitions. The first approach reaches an upper-bound capacity by optimal coalitions determined by the dynamic programming. However, such approach is of a high complexity. Thus, we also introduce a low-complexity algorithm, based on the sequential bargaining, reaching a close-to-optimal capacity. Moreover, we also determine the transmission power allocated to each reused channel. Simulations show that the proposed solution triples the sum capacity of the state-of-the-art algorithm with the highest performance.