Optimal route selection and resource allocation in multi-hop cognitive radio networks

  • Authors:
  • Qianxi Lu;Tao Peng;Wei Wang;Wenbo Wang;Chao Hu

  • Affiliations:
  • Wireless Signal Processing and Network Lab, Key laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, P.R. China;Wireless Signal Processing and Network Lab, Key laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, P.R. China;Wireless Signal Processing and Network Lab, Key laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, P.R. China;Wireless Signal Processing and Network Lab, Key laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, P.R. China;Wireless Signal Processing and Network Lab, Key laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts & Telecommunications, Beijing, P.R. China

  • Venue:
  • GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cognitive radio makes it possible for an unlicensed user to access a licensed spectrum opportunistically on the basis of non-interfering. This paper addresses the problem of joint route selection and resource allocation in OFDMA-based multi-hop cognitive radio networks, in the objective of optimizing different types of end-to-end performance. Aiming to solve it optimally, we first show that this problem of optimal resource allocation can be formulated as a convex optimization problem and identify its necessary and sufficient conditions. Based on this conclusion, we propose an iterative algorithm that can be implemented in a distributed manner. This algorithm applies Lagrangian duality theory and the Frank-Wolfe method. The scheme thus converges to a globally optimal solution. We present numerical results from using the algorithm to provide insight into the optimal cross-layer design, e.g., the relationship between bottleneck throughput and hops, and the effect of Interference Temperature constraints.