Abstract
In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assignment for secondary transmissions in CRNs is generally believed to be NP complete, the impact of fairness and link quality constraints on the hardness of the problem is not well studied. In this paper we show that when a minimum quality constraint is imposed on secondary transmissions, the spectrum assignment problem can be solved in polynomial time. However, such assignments may not guarantee fairness. We also show that when fairness is desired, even in the presence of quality constraints spectrum assignment problems remain NP complete. We then propose a tree pruning based algorithm to solve distance constrained spectrum assignment problem. We also discuss some heuristic techniques to solve fair distance constrained spectrum assignment problems in polynomial time.