{'fraction_non_alphanumeric': 0.027089783281733747, 'fraction_numerical': 0.0, 'mean_word_length': 5.49748743718593, '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}}
RACH Success Probability Analysis and Optimization in NB-IoT Networks

Narrow Band-Internet of Things (NB-IoT) is a novel technology to provide a high coverage area for massive low-cost devices with latency tolerance and long battery life. However, existing random access techniques with fixed repetition values will cause severe interference and low resource utilization. In order to provide more reliable transmission for NB-IoT devices, the Random Access CHannel (RACH) success probability is first analyzed in this paper. An exact closed-form expression for the RACH success probability of a random user, including both the repetition values and received Signal to Interference plus Noise Ratio (SINR) values, is derived. We further formulate the joint optimization problem, including sub-carrier assignment, repetition value and start TS allocation, to maximize the RACH success probability. By mapping the two-dimensional resource table as a one-dimensional resource block vector, the many-to-one matching algorithm is invoked to solve this problem. The improved utility function is further designed to eliminate the “externalities” effects in the matching process. Numerical results demonstrate that the proposed optimization outperforms existing algorithm with fixed repetition value.