New resource allocation scheme for cognitive relay networks with opportunistic access

Handle URI:
http://hdl.handle.net/10754/564573
Title:
New resource allocation scheme for cognitive relay networks with opportunistic access
Authors:
Zafar, Ammar ( 0000-0001-8382-7625 ) ; Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Chen, Yunfei; Radaydeh, Redha Mahmoud Mesleh
Abstract:
In this paper, a new resource allocation scheme to minimize Symbol Error rate (SER) for relay assisted cognitive radio networks is studied. A cognitive relay network with amplify-and-forward (AF) fixed gain relays and opportunistic access to the licensed spectrum is considered. The SER objective function and the optimization constraints are derived first. The resource allocation algorithm is then derived using the Langrangian multiplier method. Closed form expressions are derived for the source and relay powers and, symbol time. Analytical results show that the optimal power allocation follows an extended water-filling solution. © 2012 IEEE.
KAUST Department:
Electrical Engineering Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Physical Sciences and Engineering (PSE) Division; Communication Theory Lab
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2012 IEEE International Conference on Communications (ICC)
Conference/Event name:
2012 IEEE International Conference on Communications, ICC 2012
Issue Date:
Jun-2012
DOI:
10.1109/ICC.2012.6364910
Type:
Conference Paper
ISSN:
15503607
ISBN:
9781457720529
Appears in Collections:
Conference Papers; Physical Sciences and Engineering (PSE) Division; Electrical Engineering Program; Communication Theory Lab; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorZafar, Ammaren
dc.contributor.authorAlouini, Mohamed-Slimen
dc.contributor.authorChen, Yunfeien
dc.contributor.authorRadaydeh, Redha Mahmoud Meslehen
dc.date.accessioned2015-08-04T07:04:17Zen
dc.date.available2015-08-04T07:04:17Zen
dc.date.issued2012-06en
dc.identifier.isbn9781457720529en
dc.identifier.issn15503607en
dc.identifier.doi10.1109/ICC.2012.6364910en
dc.identifier.urihttp://hdl.handle.net/10754/564573en
dc.description.abstractIn this paper, a new resource allocation scheme to minimize Symbol Error rate (SER) for relay assisted cognitive radio networks is studied. A cognitive relay network with amplify-and-forward (AF) fixed gain relays and opportunistic access to the licensed spectrum is considered. The SER objective function and the optimization constraints are derived first. The resource allocation algorithm is then derived using the Langrangian multiplier method. Closed form expressions are derived for the source and relay powers and, symbol time. Analytical results show that the optimal power allocation follows an extended water-filling solution. © 2012 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectCognitive relaysen
dc.subjectopportunistic accessen
dc.subjectresource allocationen
dc.subjectsymbol error rateen
dc.titleNew resource allocation scheme for cognitive relay networks with opportunistic accessen
dc.typeConference Paperen
dc.contributor.departmentElectrical Engineering Programen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentPhysical Sciences and Engineering (PSE) Divisionen
dc.contributor.departmentCommunication Theory Laben
dc.identifier.journal2012 IEEE International Conference on Communications (ICC)en
dc.conference.date10 June 2012 through 15 June 2012en
dc.conference.name2012 IEEE International Conference on Communications, ICC 2012en
dc.conference.locationOttawa, ONen
dc.contributor.institutionSchool of Engineering, University of Warwick, Coventry, CV4 7AL, United Kingdomen
kaust.authorZafar, Ammaren
kaust.authorAlouini, Mohamed-Slimen
kaust.authorRadaydeh, Redha Mahmoud Meslehen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.