- 175 views
- 109 downloads
On the Optimal Set of Channels to Sense in Cognitive Radio Networks
-
- Author / Creator
- Arefi, Afshin
-
We study a channel selection problem in cognitive radio with imperfect spectrum sensing. In this problem, a secondary (unlicensed) user must select a subset of M channels out of N channels to sense. The user then accesses up to K ≤ M channels that were sensed free. The objective is to maximize the user’s expected throughput. This work is motivated by the surprising fact that an intuitive solution proposed in the literature is only optimal for K = M. We perform a worst-case performance analysis of the intuitive solution and show that its performance can be a factor of Ω(N) (that is a constant factor of N) worse than that of the optimal solution. We propose polynomial-time optimal solutions for cases where K = 1, M = O(1), or N − M = O(1). For the general case, we propose a sub-optimal polynomial-time algorithm, as well as a polynomial-time algorithm to calculate an upper bound on the maximum throughput achievable.
-
- Subjects / Keywords
-
- Graduation date
- Fall 2015
-
- Type of Item
- Thesis
-
- Degree
- Master of Science
-
- License
- This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.