{'fraction_non_alphanumeric': 0.022453889334402566, 'fraction_numerical': 0.0, 'mean_word_length': 5.466321243523316, '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}}
Distributed dynamic channel allocation algorithms with adjacent channel constraints

Dynamic channel allocation (DCA) has become an important subject of research and development for wireless/cellular networks. Various DCA schemes have been proposed and numerous studies on their performance have been made. However, the DCA investigations so far have all been done under the constraints imposed by co-channel interference only. Another important constraint which is crucial in practical systems, namely, the channel usage limited by adjacent channel interference (ACI), has mostly been overlooked in the literature. The authors analyze the ACI constraints under various spatial relationships between the mobile and base stations. They also make the first attempt to investigate the impact of this constraint on DCA by devising a modified version of a novel and practical distributed DCA algorithm, the local packing DDCA (LP-DDCA), incoporating the ACI constraint. Then, the performance improvement offered by the modified LP-DDCA is re-evaluated. The results show that although the ACI constraint may significantly reduce the traffic adaptation capability of DCA in general, the LP-DDCA is quite robust with respect to this additional constraint.