{'fraction_non_alphanumeric': 0.014344262295081968, 'fraction_numerical': 0.0020491803278688526, 'mean_word_length': 5.222929936305732, '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}}
Dynamic subchannel and power allocation using Nash Bargaining game for cognitive radio networks with imperfect PU activity sensing

This paper proposes a dynamic subchannel and power allocation scheme based on Nash Bargaining Game for an ad hoc network of Secondary Users (SU) coexisting opportunistically with a Primary base station. Each SU is equipped with an energy detector to sense the Primary User (PU) activity over N OFDM sub-channels. We deploy Nash Bargaining Solution to model the power and subchannel allocation of the SUs over the temporarily available transmission opportunities. Simulation results show that the proposed dynamic power and subchannel assignment is simple, effective and fair. Moreover, the total throughput of the network is highly dependent on the accuracy level of the sensing information and the percentage of PU silence. An acceptable secondary network throughput is achievable if the probability of PU presence is limited to less than 0.4.