{'fraction_non_alphanumeric': 0.03576982892690513, 'fraction_numerical': 0.0015552099533437014, 'mean_word_length': 5.014018691588785, '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}}
A new radio channel allocation strategy using simulated annealing and Gibbs sampling

Since the problem of optimal radio channel assignment (RCA) is NP-hard, the existing RCA algorithms have to use heuristic approaches for any networks of practical sizes. However, the algorithms suffer from two major issues, i.e., unable to consider the co-channel interference (CCI), and finding only sub-optimal assignment. In this work, we propose a new strategy to overcome the two challenging issues. (1) To consider CCI among neighboring head routers (HRs) and their terminals, we propose to choose the average effective channel utilization (ECU) of an HR as the basic objective function. The function can be also the sum of the average ECU, for which the optimization target is directly to maximize the overall throughput. (2) We propose to use the simulated annealing (SA) algorithm to find the optimal assignment and use the Gibbs sampling (GS) technique to convert the global optimization problem to a series of local optimization problems. In this way, we propose a distributed optimal assignment, i.e., SA-GS-based RCA (SRCA) algorithm. Our extensive simulation results have demonstrated that SRCA outperforms all the existing RCA algorithms in achieving global optimality with bounded CS.