Guaranteed Opportunistic Scheduling in Multi-Hop Cognitive Radio Networks

Cognitive radio networks enable opportunistic sharing of bandwidth/spectrum. In this paper, the authors introduce optimal control and scheduling algorithms for multi-hop cognitive radio networks to maximize the throughput of secondary users while stabilizing the cognitive radio network subject to collision rate constraints required by primary users. They show that by employing their proposed optimal algorithm, the achievable network throughput can be arbitrarily close to the optimal value. To reduce complexity, they propose a class of feasible suboptimal algorithms that can achieve at least a fraction of the optimal throughput. In addition, they also analyze the optimal algorithm in the fixed-routing scenario and deduce the corresponding lower-bound of average end-to-end delay across a link set.

Provided by: Ohio State University Topic: Mobility Date Added: Jan 2011 Format: PDF

Find By Topic