Abstract
This paper presents a delay and energy-based (DEB) routing protocol for the cognitive radio ad hoc networks (CRAHN). In the proposed system, a clustering approach is considered to divide the network, where the cluster formation is based on spatial variations of the spectrum availability. Once the cluster-based network is formed, the proposed protocol enables any source node to search and establish an efficient route to the destination node. Defined as a weighted graph problem, the proposed DEB routing protocol considers delay and energy to be the routing metric. Therefore, a link weight is measured through switching and queuing delay of the nodes along with their residual energy. It is anticipated that the proposed protocol selects stable paths while ensuring fast data delivery. The performance of the DEB protocol has been assessed through simulation and compared the results with existing protocols. It is observed that DEB exhibits better performance by outdoing the other protocols.KeywordsCognitive radio ad hoc networksClusteringRouting protocol
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
