{'fraction_non_alphanumeric': 0.014005602240896359, 'fraction_numerical': 0.0009337068160597573, 'mean_word_length': 5.380952380952381, '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}}
Wireless backhaul resource allocation and user-centric clustering in ultra-dense wireless networks

Wireless backhaul is a promising technology to lower the cost for connecting a large number of densely deployed access points in the emerging fifth generation wireless system. In this study, the authors consider the joint optimisation of resource allocation in wireless backhaul links and user-centric clustering in the access links. The objective is to maximise the weighted sum rate of all users under the backhaul resource constraints. To solve this intractable problem, they first adopt the l
 1
-norm approximation approach to convert the non-convex backhaul constraints into the solvable forms. They then reformulate the objective function as a set of second-order cone constraints based on the sequential parametric convex approximation method. An iterative algorithm is proposed to solve the transformed problem based on its special property. Simulation results show that the proposed algorithm outperforms other existing schemes under different network settings.