On-Demand Routing Protocol for Cluster-Based Cognitive Radio Ad-Hoc Network
An on-demand routing protocol for cluster-based cognitive radio ad-hoc network is focused in the project. In this routing protocol, relaying nodes are the cluster-heads and the forwarding nodes. Moreover, the routing protocol is defined as a weighted graph problem, where delay has been considered as the performance metric of the routing protocol. To calculate the weight of a link, three types of delay are considered, namely switching delay, back-off delay and queuing delay. Thus, to ensure faster data delivery to the destination, the proposed protocol selects the routing path that provides the least cumulative link weights.