{'fraction_non_alphanumeric': 0.018691588785046728, 'fraction_numerical': 0.00594732370433305, 'mean_word_length': 5.072164948453608, '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}}
A Constrained Coalition Formation Game for Multihop D2D Content Uploading

This paper investigates relay-based schemes in cellular systems, where multihop device-to-device (D2D) communications are exploited for content uploading toward the eNodeB. All user equipments (UEs) are sources of their own content and form a multihop D2D chain, with the head of the chain being in charge of uploading all the generated content to the eNodeB. By pooling the cellular radio resources assigned to the D2D chain and by using high-quality short-range radio links, the proposed cooperative content uploading scheme guarantees lower upload delays than in the traditional cellular mode operation. To model the D2D chain formation in a cell and to best characterize self-interested users concerned about their own payoff, a constrained coalition formation game is defined, where each UE is a player whose cost is identified as the content upload time. The solution of the game determines the stable feasible partition for the UEs in the cell. We demonstrate through simulations that with this solution the content uploading time is reduced by 52% with respect to the traditional cellular mode.