{'fraction_non_alphanumeric': 0.02464788732394366, 'fraction_numerical': 0.0035211267605633804, 'mean_word_length': 5.047872340425532, '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}}
An improved random access scheme for M2M communications

In this study, an improved random access (RA) scheme for Machine-to-Machine (M2M) communications is proposed. The improved RA scheme is realized by two steps. First, the improved RA scheme achieves a reasonable resource tradeoff between physical random access channel (PRACH) and physical uplink shared channel (PUSCH). To realize a low-complexity resource allocation between PRACH and PUSCH, a boundary of traffic load is derived to divide the number of active M2M users (UEs) into multiple intervals. The corresponding resource allocation for these intervals is determined by eNB. Then the resource allocation for other number of UEs can be obtained from the allocation of these intervals with less computation. Second, the access barring on arrival rate of new UEs is introduced in the improved RA scheme to reduce the expected delay. Numerical results show that the proposed improved RA scheme can realize a low-complexity resource allocation between PRACH and PUSCH. Meanwhile, the expected delay can be effectively reduced by access barring on arriving rate of new M2M UEs.