ERA

Download the full-sized PDF of On the Optimal Set of Channels to Sense in Cognitive Radio NetworksDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R33J3984P

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

On the Optimal Set of Channels to Sense in Cognitive Radio Networks Open Access

Descriptions

Other title
Subject/Keyword
Cognitive Radio Networks
Imperfect Sensing
Dynamic Programming
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Arefi, Afshin
Supervisor and department
Khabbazian, Majid (Electrical and Computer Engineering)
Examining committee member and department
Ardakani, Masoud (Electrical and Computer Engineering)
Jiang, Hai (Electrical and Computer Engineering)
Department
Department of Electrical and Computer Engineering
Specialization
Communications
Date accepted
2015-09-22T14:20:55Z
Graduation date
2015-11
Degree
Master of Science
Degree level
Master's
Abstract
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.
Language
English
DOI
doi:10.7939/R33J3984P
Rights
Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication
Afshin Arefi and Majid Khabbazian, "On the Optimal Set of Channels to Sense in Cognitive Radio Networks", Submitted to the IEEE Transactions on Wireless Communications, 2015.

File Details

Date Uploaded
Date Modified
2015-09-22T20:20:56.524+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (PDF/A)
Mime type: application/pdf
File size: 271667
Last modified: 2016:06:24 17:42:36-06:00
Filename: Arefi_Afshin_201509_MSc.pdf
Original checksum: 447ac97ed8c00f18b04b6e14fbe651ee
Well formed: true
Valid: true
File title: untitled
Page count: 60
Activity of users you follow
User Activity Date