Vertex search based energy-efficient optimal resource allocation in cognitive radio ad hoc networks

Cognitive Radio Ad Hoc Networks (CRAHN) is the infrastructure-less network model of Cognitive radios developed in an ad hoc manner. Regulating resource allocation in CRAHN is considered to be an energy constrained problem. Many researches have been performed for allocating spectrum in an efficient way using various protocols. In this paper, the Spectrum-Map-Empowered Opportunistic Routing (SMOR) model has been utilized as the fundamental model for routing and an energy efficient optimal spectrum allocation solution is provided. In the proposed model, the previously modified SMOR model is enhanced for the main objective of energy efficient and optimal resource allocation using Vertex search algorithm with a gradient-based approximation. Initially, the resource allocation problem is modelled into a non-convex optimization problem. The power allocation, data rate adaptation, channel allocation, and user scheduling policies are optimized for maximization of the energy efficiency during data transmission. The proposed Vortex search algorithm resolves this optimization problem by determining the training interval for the channel estimation and power consumption. The experimental results prove that the proposed Vertex search based modified SMOR (VS-M-SMOR) model provides efficient routing with energy efficient optimal resource allocation.