Location-Based Resource Allocation for OFDMA Cognitive Radio Systems

Handle URI:
http://hdl.handle.net/10754/136731
Title:
Location-Based Resource Allocation for OFDMA Cognitive Radio Systems
Authors:
Ghorbel, Mahdi
Abstract:
Cognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.
Advisors:
Alouini, Mohamed-Slim ( 0000-0003-4827-1793 )
Committee Member:
Sultan Salem, Ahmed Kamal; Sundaramoorthi, Ganesh; Tempone, Raul F.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Program:
Electrical Engineering
Issue Date:
May-2011
Type:
Thesis
Appears in Collections:
Theses; Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.advisorAlouini, Mohamed-Slimen
dc.contributor.authorGhorbel, Mahdien
dc.date.accessioned2011-07-25T06:20:08Z-
dc.date.available2011-07-25T06:20:08Z-
dc.date.issued2011-05en
dc.identifier.urihttp://hdl.handle.net/10754/136731en
dc.description.abstractCognitive radio is one of the hot topics for emerging and future wireless communication. It has been proposed as a suitable solution for the spectrum scarcity caused by the increase in frequency demand. The concept is based on allowing unlicensed users, called cognitive or secondary users, to share the unoccupied frequency bands with their owners, called the primary users, under constraints on the interference they cause to them. In order to estimate this interference, the cognitive system usually uses the channel state information to the primary user, which is often impractical to obtain. However, we propose to use location information, which is easier to obtain, to estimate this interference. The purpose of this work is to propose a subchannel and power allocation method which maximizes the secondary users' total capacity under the constraints of limited budget power and total interference to the primary under certain threshold. We model the problem as a constrained optimization problem for both downlink and uplink cases. Then, we propose low-complexity resource allocation schemes based on the waterfilling algorithm. The simulation results show the efficiency of the proposed method with comparison to the exhaustive search algorithm.en
dc.language.isoenen
dc.titleLocation-Based Resource Allocation for OFDMA Cognitive Radio Systemsen
dc.typeThesisen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
thesis.degree.grantorKing Abdullah University of Science and Technologyen_GB
dc.contributor.committeememberSultan Salem, Ahmed Kamalen
dc.contributor.committeememberSundaramoorthi, Ganeshen
dc.contributor.committeememberTempone, Raul F.en
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.nameMaster of Scienceen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.