{'fraction_non_alphanumeric': 0.02403058438012015, 'fraction_numerical': 0.0, 'mean_word_length': 5.428070175438597, '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}}
Intelligent User Association for Symbiotic Radio Networks Using Deep Reinforcement Learning

In this paper, we are interested in symbiotic radio networks (SRNs), in which an Internet-of-Things (IoT) network parasitizes in a primary cellular network to achieve spectrum-, energy-, and infrastructure-efficient communications. Each IoT device transmits its own information by backscattering the signals from the primary network without using active radio-frequency (RF) transmitter chain. We consider the symbiosis between the cellular network and the IoT network and focus on the user association problem in SRN. Specifically, the base station (BS) in the primary network serves multiple cellular users using time division multiple access (TDMA) and each IoT device is associated with one cellular user for information transmission. The objective of user association is to link each IoT device to an appropriate cellular user by maximizing the sum rate of all IoT devices. However, the difficulty in obtaining the full real-time channel information makes it difficult to design an optimal policy for this problem. To overcome this issue, we propose two deep reinforcement learning (DRL) algorithms, both use historical information to infer the current information in order to make appropriate decisions. One algorithm, referred to as centralized DRL, makes decisions for all IoT devices at one time with globally available information. The other algorithm, referred to as distributed DRL, makes a decision only for one IoT device at one time using locally available information. Finally, simulation results show that the two proposed DRL algorithms achieve performance comparable to the optimal user association policy which requires perfect real-time information, and the distributed DRL algorithm has the advantage of scalability.