{'fraction_non_alphanumeric': 0.01644398766700925, 'fraction_numerical': 0.0, 'mean_word_length': 5.5369127516778525, '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}}
Heuristic-Based Location Allocation of Single Frequency Network Stations

Single frequency networks (SFN) are being widely adopted for different communication services. SFNs employ transmitters operating at the same frequency band and the locations of transmitter stations must be selected to improve coverage while under different constrains. In general, choosing the transmitters locations to vouch the coverage in a region of interest demands experience and expertise on network design. In this article, relevant network design aspects are mapped into a heuristic method for optimizing the location allocation of SFN transmitters. This results in an iterative algorithm which obtains the number of transmitters and their positions to achieve coverage in a region of interest (the so-called location allocation problem). The algorithm is tested in a particular region of interest in the city of Queimados in Rio de Janeiro, Brazil, demonstrating its adequate performance.