Frequency assignment, channel scheduling and routing in cognitive radio networks

In this thesis, new approaches and algorithms for multi-source multi-destination path selection, frequency assignment, channel scheduling and routing problems are proposed. Integer linear programming and heuristic methods are used for solving these problems. In the first section of the thesis, a new algorithm is proposed to construct paths for multi-source multi-destination cognitive radio networks while avoiding maximal cliques. In the second section of the thesis, a heuristic algorithm is designed for frequency assignment and channel scheduling problem formulated as integer linear programming model in cognitive radio networks by taking into account the different energy consumption that occurs while cognitive radio devices switch to different frequency bands. In the third section of the thesis, a frequency switching aware throughput maximization routing algorithm is proposed. The energy consumption during the routing protocol is modeled, and a new objective function for the energy efficiency maximization problem is formulated. A novel algorithm is proposed for the energy efficiency maximization problem.