{'fraction_non_alphanumeric': 0.024057738572574178, 'fraction_numerical': 0.006415396952686447, 'mean_word_length': 5.147783251231527, '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}}
Proximity Coordinated Random Access (PCRA) for M2M Applications in LTE-A

A significant amount of research has been conducted on adapting 3GPP Long Term Evolution (LTE) and LTE-Advanced (LTE-A) random access to be more efficient for machine-to-machine (M2M) devices because of the huge number of such devices that may reside in each LTE/LTE-A cell. However, there are other attributes of M2M applications that can be used as the basis of independent efficiency improvements. One characteristic which has been overlooked thus far is the spatial and temporal correlations that often exist in the activity of neighboring M2M devices belonging to the same M2M application. In this paper, we illustrate how these correlations can be exploited by coordinating the preambles to be used by neighboring M2M devices to reduce the number of collisions during LTE-A random access, particularly in wireless sensor network (WSN) type applications. The technique is referred to as proximity coordinated random access (PCRA). Through simulation of an example local preamble coordination algorithm that can be executed autonomously by randomly deployed devices of the same M2M application, we demonstrate an increase in the efficiency of the random access process.