Abstract
We present a critical review and analysis of different categories of routing protocols for cognitive radio networks. We first classify the available solutions to two broad categories: those based on full spectrum knowledge (typically used to establish performance benchmarks) and those based on local spectrum knowledge (used for real-time implementation). The full spectrum knowledge based routing solutions are analyzed from a graph-theoretic point of view, and we review the layered graph, edge coloring and conflict graph models. We classify the various local spectrum knowledge based routing protocols into the following five categories: Minimum power, Minimum delay, Maximum throughput, Geographic and Class-based routing. A total of 25 routing protocols proposed for cognitive radio networks have been reviewed. We discuss the working principle and analyze the pros and cons of the routing protocols. Finally, we propose an idea of a load balancing-based local spectrum knowledge-based routing protocol for cognitive radio ad hoc networks .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have