{'fraction_non_alphanumeric': 0.02748414376321353, 'fraction_numerical': 0.0, 'mean_word_length': 5.07051282051282, '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}}
Near-optimal distributed power control for ARQ based multihop links with decoding costs

In this paper, we consider automatic repeat request based multihop communication between a source and a destination. We present the design of near-optimal power control policies which minimize the packet drop probability (PDP), when the energy cost to receive and decode a packet is non-negligible. The design problem is a nonconvex mixed integer nonlinear program, which, in general, is NP-hard to solve. We transform the problem into a complementary geometric program (CGP), and solve the CGP using a series of GP approximations. Simulations show that for slow (fast) fading channels, the obtained policy offers approximately one (two) orders of magnitude better performance compared to a conventional equal power policy. In addition, the results quantify the relative impact of the available power at the nodes and the effect of decoding cost on the PDP.