On Outage Minimization in Cognitive Radio Networks Through Routing and Power Control

This paper addresses the problem of optimal resource allocation in a multi-hop cognitive radio networks. The objective of the present work is to search for the shortest possible path from the source to the destination and explores the scope of the Bellman–Ford and the Dijkstra’s algorithms due to their low runtime complexity and ease of implementation in routing. Searching for the shortest path focuses on minimization to the outage probability, while satisfying simultaneously the limits of the total transmit power and the interference threshold to the primary user (PU). Fuzzy c-means clustering is used to speed up the route selection process for both the routing algorithms. Network lifetime is also studied for both the algorithms considering the link failure situation. Simulation results show that the proposed scheme not only minimizes the outage probability over the existing power allocation strategies but also reduces interference to the PU. Results also show that network lifetime is increased and faster route selection is possible.