{'fraction_non_alphanumeric': 0.0142602495543672, 'fraction_numerical': 0.0, 'mean_word_length': 5.605882352941176, '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}}
Distributed bargaining mechanisms for multi-antenna dynamic spectrum access systems

Dynamic spectrum access and MIMO technologies are among the most promising solutions to address the ever increasing wireless traffic demand. An integration that successfully embraces the two is far from trivial due to the dynamics of spectrum opportunities as well as the requirement to jointly optimize both spectrum and spatial/antenna dimensions. Our objective in this paper is to jointly allocate opportunistic channels to various links such that no channel is allocated to more than one link, and to simultaneously optimize the MIMO precoding matrices under the Nash bargaining (NB) framework. We design a low-complexity distributed scheme that allows links to propose their minimum rate requirements, negotiate the channel allocation, and configure their precoding matrices. Simulations confirm the convergence of the distributed algorithm under timesharing to the globally optimal solution of the NB-based problem. They also show that the NB-based algorithm achieves much better fairness than purely maximizing network throughput.