Abstract: This paper presents a binary shuffled frog leaping algorithm and an assignment method for cognitive radio spectrum based on it. Simulations are conducted to compare this method and color sensitive graph coloring algorithm. Results show that under the maxmization rule of whole network efficiency and fairness efficiency, the assignment method for cognitive radio based on binary shuffled frog leaping algorithm has higher performance. The binary shuffled frog leaping algorithm can find the ideal optimal solutions while the solution obtained by color sensitive graph coloring algorithm has a large deviation with the optimal solutions.
dynamic spectrum assignment,
shuffled frog leaping,