{'fraction_non_alphanumeric': 0.021739130434782608, 'fraction_numerical': 0.0, 'mean_word_length': 5.138888888888889, '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 rate and power allocation in spectrum sharing networks with balanced QoS provisioning and power saving

In this paper, we study the joint rate and multi-channel power allocations in spectrum sharing networks (SSNs) with balanced QoS provisioning and power saving. We formulate this cross layer problem as a non-cooperative game GJRPA in which each user aims to achieve its target data rate as exactly as possible and minimize its power consumption at the same time. We investigate the properties of Nash equilibrium (N.E.) for GJRPA, including its existence, and properties of QoS provisioning as well as power saving. With the decomposition technique, we propose a distributed algorithm to find the N.E. for GJRPA from any feasible initialization and provide a sufficient condition for its convergence. Simulation results are presented to show the validity of our proposed algorithm. Performance tradeoff between QoS provisioning and power saving are investigated via tuning the weighting factors. Besides, advantages of our GJRPA over conventional iterative water filling (IWF) are also analyzed.