{'fraction_non_alphanumeric': 0.02197802197802198, 'fraction_numerical': 0.0018315018315018315, 'mean_word_length': 5.624242424242424, '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}}
Delay-Aware Cache-Enabled Cooperative D2D Transmission in Mobile Cellular Networks

By caching popular contents at edge nodes, the content can be delivered via device-to-device (D2D) communications to reduce the delay significantly. In this paper, we study cooperative content delivery from multiple edge nodes with duplicate caching, where the content caching and the cooperative transmission algorithms are designed jointly to minimize the average delay. Specifically, we decompose the delay optimization problem as short time-scale transmission subproblems for each time slot and a long time-scale caching master problem by primal decomposition. The transmission subproblem is modelled as a finite horizon Markov decision problem (MDP), and we propose a link selection algorithm based on the value function in the MDP model. For the caching master problem, we propose a caching algorithm by the simultaneous perturbation stochastic approximation (SPSA) method. Simulation results show that our proposed transmission and caching algorithms achieve lower delay than the conventional schemes.