Leveraging the Algebraic Connectivity of a Cognitive Network for Routing Design
In this paper, the authors consider the implications of spectrum heterogeneity on connectivity and routing in a Cognitive Radio Ad-Hoc Network (CRAHN). They study the Laplacian spectrum of the CRAHN graph when the activity of primary users is considered. They introduce the cognitive algebraic connectivity, i.e., the second smallest eigenvalue of the Laplacian of a graph, in a cognitive scenario. Throughout this notion they provide a methodology to evaluate the connectivity of CRAHNs and consequently introduce a utility function that is shown to be effective in capturing key characteristics of CRAHN paths.