{'fraction_non_alphanumeric': 0.01822079314040729, 'fraction_numerical': 0.0, 'mean_word_length': 5.671428571428572, '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}}
Sequential multi-channel access game in distributed cognitive radio networks

In distributed cognitive radio networks, due to the negative network externality, rational secondary users tend to avoid accessing same vacant primary channels with others. Moreover, they usually make channel access decisions in a sequential manner to avoid collisions. The characteristic of negative network externality and the structure of sequential decision making make the multi-channel access problem challenging, which has not been well studied by existing literatures. In this paper, we propose a multi-channel access game, which not only considers the negative network externality, but also takes into account their sequential decision making structure. We design a recursive best response algorithm to find the subgame perfect Nash equilibria. Finally, we conduct simulations to validate the effectiveness and efficiency of the proposed methods.