{'fraction_non_alphanumeric': 0.028495102404274265, 'fraction_numerical': 0.0, 'mean_word_length': 5.650887573964497, '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}}
Interference-Aware Clustering Algorithms in Multi-relay Cellular Networks

We consider the downlink of a wireless cellular network which consists of one Macro Base Station (MBS), multiple relays and User Equipments (UEs). In this scenario, we propose relay clustering algorithms to address the problem of inter-cluster interference. In each cluster, we adopt a time-division relaying scheme to avoid intra-cluster interference, but the inter-cluster interference still remains. In interference-aware network, an optimal clustering algorithm requires an exhaustive search, which is infeasible. Hence, we propose a clustering algorithm which improves the system capacity by exploiting the inter-cluster information. But this algorithm is implemented in a centralized manner with high complexity that requires the calculation of inter-cluster information. To circumvent this, we propose a cluster-wise distributed algorithm with manageable complexity, which shows the performance within acceptable range from the optimal one, far better than simple and intuitive algorithms because of the effect of inter-cluster interference.