{'fraction_non_alphanumeric': 0.02077687443541102, 'fraction_numerical': 0.0009033423667570009, 'mean_word_length': 5.881987577639752, '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-Optimal Distributed Resource Allocation for Device-to-Device Communications

In this paper, the resource allocation problem is investigated for Device-to-Device (D2D) communications underlaying cellular networks with bursty traffic arrival. We formulate an infinite horizon average reward constraint Markov decision process (CMDP) that aims at minimizing the average delay under the dropping propability constraint. Then, we present a reduced-state Bellman's equation with linear value function approximation to deal with the curse of dimensionality problem in solving the CMDP. A distributed resource allocation algorithm is derived with low computation complexity and signaling overhead, which consists of a subchannel bidding mechanism to obtain the optimal control action, and a distributed online stochastic learning algorithm to estimate the value function and the optimal Lagrangian Multipliers (LMs). Simulation results show that the performance of our proposed algorithm is very close to that achieved by the offline value iteration algorithm, and is better than various baselines algorithms.