{'fraction_non_alphanumeric': 0.034403669724770644, 'fraction_numerical': 0.0, 'mean_word_length': 5.191489361702128, '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}}
Optimal power allocation policies in multi-hop cognitive radio networks

This paper investigates a power allocation problem in an optimal and closed-form manner for a relay-aided cognitive network composed of one primary and secondary user/destination pair (e.g., a cellular link coexisting with a device-to-device link in a device-to-device enabled cellular communication setup) and one secondary full-duplex relay. By exploiting the monotonic properties of the objective function and the geometry of the feasible set, we provide the optimal and closed-form power allocation policy assuming the relay performs either Decode-and-Forward (DF) or Compress-and-Forward (CF). We then conjecture that if the secondary direct link is missing, then DF always outperforms CF, irrespective from the system parameters. This conjecture is sustained by numerous numerical simulations.