{'fraction_non_alphanumeric': 0.018842530282637954, 'fraction_numerical': 0.005383580080753701, 'mean_word_length': 5.4094827586206895, '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 generalized algorithm for constrained power control with capability of temporary removal

The distributed constrained power control algorithm (DCPC) (Grandhi et al. 1995) has become one of the most widely accepted quality-based power control algorithms by the academic community. The DCPC has a property that the power may reach the maximum level when a user is experiencing degradation of channel quality. Unfortunately, using maximum transmitter power may not lead to sufficient improvement of channel quality and will thereto generate severe interference, affecting other users. This undesirable phenomenon happens more often when the system is congested. In this paper, we revisit and generalize the DCPC algorithm in order not to necessarily utilize the maximum power when the channel quality is poor. Under poor quality conditions, rather than combating the interference by maximizing power, we propose the concept of reducing the powers and temporarily removing users from the channel. We show that the energy consumption can be reduced through our generalized algorithm and we prove its convergence properties. Because of the decreased interference power, the capacity of the system is expected to increase. To validate this, we made computational experiments suggesting that the proposed algorithm can support more users in a congested system as compared to the previously suggested distributed removal algorithm gradual removals restricted (GRR)-DCPC (Andersin et al. 1996).