{'fraction_non_alphanumeric': 0.022774327122153208, 'fraction_numerical': 0.0, 'mean_word_length': 5.0062111801242235, '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}}
Joint Power Allocation and Routing in Full-Duplex Relay Network: An Outage Probability Approach

In this paper a power optimal routing is investigated in fading wireless channels. The fading distribution of the channel is modeled by Nakagami-m, and the outage capacity of full-duplex decode-and-forward (FD-DF) relaying is taken as QoS constraint. In this QoS routing algorithm, the weighted power sum of relay nodes is minimized while the end-to-end link outage probability is kept below a threshold. Firstly, the weighted power sum minimization problem for a static multi-hop route is formulated and solved in closed form for low outage probability. Then a routing metric is extracted from the minimized power sum of a static route which results in optimal routing method, implemented by dynamic programming algorithms like Bellman Ford. The proposed power optimal routing is evaluated by comparing its performance to other strategies with Monte Carlo simulations.