{'fraction_non_alphanumeric': 0.020151133501259445, 'fraction_numerical': 0.0, 'mean_word_length': 5.381526104417671, '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}}
Adaptive admission control in interference-coupled wireless data networks: A planning and optimization tool set

Typically, wireless network performance decreases in high traffic regimes, e. g., at traffic hot spots and peak hours, since a large number of active users have to share limited radio resources. From a network perspective, even congestion may occur in some cells, which may lead to drastic deterioration of user throughputs. As a consequence, network operators employ admission control in their base stations in order to prevent congestion and enhance quality of experience. In this paper, we develop an effective network planning and optimization tool set, which considers the dynamic behavior of mobile traffic. The tool set allows for a more accurate prediction of data request blocking probabilities and data throughputs under admission control, since it explicitly considers the inter-cell interference coupled nature of frequency reuse one networks. This enables more reliable planning and (self-) optimization of wireless networks. We prove utility by applying the tool set to a traffic-adaptive admission control scheme and compare the resulting network performance with that of static admission control schemes under demands of high mobile data traffic. We find that the adaptive algorithm is able to exploit the trade-offs between blocking of requests, reduced interference, and guaranteed resources for individual data transmissions in each of the cells. Under high traffic conditions, it yields better performance compared to any other static scheme investigated.