{'fraction_non_alphanumeric': 0.013610888710968775, 'fraction_numerical': 0.0, 'mean_word_length': 5.377551020408164, '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}}
An efficient approach to dynamic channel assignment problem using genetic algorithm

With the rapid enlargement in mobile communication, the bandwidth has become the most challenging resource. The total available bandwidth spectrum is divided in to some channels and that are allocated to different mobile hosts that belongs to some cells at the time of initiation of a call. So channel allocation must be done efficiently. In case of static allocation when number of mobile host increases in a particular cell, it gets overloaded. Where dynamic channel allocation minimizes the problem and increases channel utilization. But the dynamic channel allocation has to follow distributed approaches because centralized allocation is neither scalable nor reliable. In case of distributed approaches the mobile base station takes the responsibility of allocating channels to the mobile stations that correspond to the same cell. Such allocations must be made considering minimized interference between calls, while satisfying the demands for channels. We have analyzed this optimization problem by using genetic algorithm (GA). The proposed method is studied with the data of some benchmark problems, taken from the literature, and the results are obvious.