{'fraction_non_alphanumeric': 0.024699599465954607, 'fraction_numerical': 0.0013351134846461949, 'mean_word_length': 4.87843137254902, '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}}
Resource allocation for two-way relay networks with symmetric data rates: An information theoretic approach

This paper investigates the resource allocation for two-way relay networks with symmetric data rates from an information theoretic perspective, where a round of information exchange between two sources requiring equal end-to-end transmission rates is considered to be completed by a muti-access (MAC) phase and a broadcast (BC) phase. Decode-and forward (DF) protocol is employed. In this case, we formulate an optimization problem to maximize the sum rate of the system under total available energy. Our goal is to seek the jointly optimized time assignment between the MAC and BC phases and the power allocation among the source and relay nodes. Since the problem is difficult to solve in general, we firstly discuss it in two extreme cases by considering very low and very high system available energy. By doing so, we find an interesting result that in the very high energy case, the optimal ratio of the time assigned for the MAC phase to that assigned for the BC phase is a constant, i.e., 2 : 1. Further, we adopt such constant time assignment to general cases, and derive a closed-form power allocation for two-way relay transmissions. Extensive numerical results vitiated the proposed joint resource allocation and show that the maximum system sum-rate can be approached by our scheme, which obviously excels traditional equal time assignment and equal power distribution schemes.