{'fraction_non_alphanumeric': 0.014675052410901468, 'fraction_numerical': 0.0, 'mean_word_length': 5.324503311258278, '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}}
Greedy spectrum sharing for cognitive MIMO networks

Cognitive radio is regarded as an emerging technique developed to enhance the efficiency of spectrum usage. In this paper, we consider a point-to-multipoint secondary network sharing frequency bands with several primary transmitters and receivers. Assuming a cognitive base station equipped with multiple transmit antennas and single antenna receivers, we propose a greedy spectrum sharing algorithm in order to approach the maximum achievable sum rate of the secondary network. First, we model the overall studied system as a weighted graph, and then we formulate the spectrum sharing as a vertex coloring problem. Second, we show that the two problems are similar and we design a greedy algorithm to solve both problems using two selection criteria. We show through computer simulations that the proposed algorithm is able to achieve near-optimal performances with very low computational complexity.