{'fraction_non_alphanumeric': 0.025878003696857672, 'fraction_numerical': 0.0036968576709796672, 'mean_word_length': 5.296511627906977, '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 stable matching algorithm for resource allocation for underlaying device-to-device communications

In this paper, we propose a novel deferred acceptance based resource allocation algorithm (DARA) for allocating LTE cellular user resource to D2D devices. The quality of service (QoS) constrained downlink resource block (RB) allocation problem is first formulated as a computationally expensive mixed integer nonlinear programming (MINLP) problem. We also propose a polynomial-time matching algorithm based on deferred acceptance method to find an allocation of cellular resources to D2D devices. Outcome of this algorithm is a stable matching of cellular users to the D2D devices. We compare the system sum rate obtained from DARA to that from a simple local search based algorithm (SLOC), a greedy heuristic based resource allocation algorithm (GHRA) and a random resource allocation algorithm. The simulation results show that, DARA achieves significantly better system sum rate than the rest of the algorithms while it runs in O(n2) in the worst case and O(n log n) on average.