A Novel Routing Algorithm in Cognitive Radio Ad Hoc Networks

Cognitive radio ad hoc networks (CRAHNs) have become a popular network architecture for connecting mobile nodes thanks to the flexibility and adaptability of such type of network. In this paper, we propose a novel scheme for efficient routing design in CRAHNs. The proposed routing scheme firstly forms a simple directed graph for the given physical network. Using the simple directed graph, multiple optimal routing paths can be computed for a pair of cognitive radio users. An optimal routing path minimizes both the hop count and the adjacent hop interference. Examples are used to demonstrate the performance and efficiency of the proposed CRAHN routing technique. Results are also compared with other existing routing techniques for CRAHNs.