{'fraction_non_alphanumeric': 0.02909090909090909, 'fraction_numerical': 0.012121212121212121, 'mean_word_length': 5.503937007874016, '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}}
Performance of Q-learning Algorithms for Channel Allocation in Small Cell Networks

The small cell networks (SCNs) architecture can greatly increase data capacity. After LTE-A (Long Term Evolution-Advance), the SCN has become the main architecture of the Fifth Generation (5G) communication systems. In SCN, the increasing interference between adjacent base stations can be effectively controlled through an adaptive channel allocation. Therefore, this paper investigates the adaptive channel allocation of small cell networks by using Q-learning via ε-greedy exploration strategy and Softmax exploration strategy. Simulation results show that the Softmax-LC (Logarithmic Cooling) discovery strategy can obtain throughput of 52 Mbps at 70 time steps, while the Exponential ε-greedy strategy obtains 52 Mbps at 200 time steps.