A metaheuristic approach to spectrum assignment for opportunistic spectrum access

The prevalent static spectrum assignment brings forth spectrum holes and poor utilization in spectrum allocation. This issue has motivated researchers to introduce the open spectrum approach to spectrum access, which is enabled by software defined radio (SDR) technology. In this paper, an approximate nondeterministic ant colony based algorithm is proposed to resolve achieved spectrum allocation problems from NP-hard graph coloring problems (GCPs). This algorithm is a new approach to spectrum assignment problem versus traditional complex and heavy computational load, but with deterministic solutions algorithms.