{'fraction_non_alphanumeric': 0.019756838905775075, 'fraction_numerical': 0.00303951367781155, 'mean_word_length': 6.236263736263736, '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}}
Genetic algorithm‐based scheduling in cognitive radio networks under interference temperature constraints

The proliferation of wireless technologies and services has intensified the demand for the radio spectrum. However, the currently existing fixed spectrum assignment policy leads to an inefficient and unevenly distributed spectrum utilization. Cognitive radio paradigm has been proposed to alleviate these drawbacks by employing dynamic spectrum access (DSA) methodology. Federal Communications Commission (FCC) has proposed the interference temperature model, which enables the unlicensed users to utilize the licensed frequencies simultaneously with the licensed users as long as they conform to the interference temperature constraints. Recently, throughput and delay optimal schedulers that meet the interference temperature constraints in cognitive radio networks have been formulated in the literature. However, these schedulers have high computational complexity. In this paper, we propose genetic algorithm (GA)‐based suboptimal methods addressing these throughput and delay optimal scheduling problems. The simulation results corroborate that our GA‐based approach yields very close performance to the optimal solutions and operates with much lower complexity. Copyright © 2010 John Wiley & Sons, Ltd.