{'fraction_non_alphanumeric': 0.011288805268109126, 'fraction_numerical': 0.0, 'mean_word_length': 5.37125748502994, '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}}
A Novel SFN Broadcast Services Selection Mechanism in Wireless Cellular Networks

Single frequency networks (SFN) broadcast is an efficient method to provide broadcast services in cellular networks. How to select broadcast services by the SFN operation to trade off between the occupied bandwidth and the SFN performance including spectrum efficiency and broadcast service continuity is a new problem. To the best of our knowledge no solutions have been proposed to solve this problem so far in the literature. We define the problem of SFN broadcast services selection as a knapsack problem and solve it to minimize the occupied bandwidth while at the same time guaranteeing the SFN performance. Based on the solution, several SFN broadcast services selection algorithms are proposed which vary in the reselection policy. Numerical results show that our proposed algorithms are applicable to different cases with different system requirements and in particular, that the semi-dynamic-SFN broadcast services selection algorithm is an efficient solution in general.