Show simple item record

dc.contributor.authorHamza, Doha R.
dc.contributor.authorPark, Kihong
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.authorAissa, Sonia
dc.date.accessioned2015-04-23T14:06:58Z
dc.date.available2015-04-23T14:06:58Z
dc.date.issued2015-02-13
dc.identifier.citationThroughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding 2015:1 IEEE Transactions on Wireless Communications
dc.identifier.issn1536-1276
dc.identifier.doi10.1109/TWC.2015.2403852
dc.identifier.urihttp://hdl.handle.net/10754/550512
dc.description.abstractWe propose a three-message superposition coding scheme in a cognitive radio relay network exploiting active cooperation between primary and secondary users. The primary user is motivated to cooperate by substantial benefits it can reap from this access scenario. Specifically, the time resource is split into three transmission phases: The first two phases are dedicated to primary communication, while the third phase is for the secondary’s transmission. We formulate two throughput maximization problems for the secondary network subject to primary user rate constraints and per-node power constraints with respect to the time durations of primary transmission and the transmit power of the primary and the secondary users. The first throughput maximization problem assumes a partial power constraint such that the secondary power dedicated to primary cooperation, i.e. for the first two communication phases, is fixed apriori. In the second throughput maximization problem, a total power constraint is assumed over the three phases of communication. The two problems are difficult to solve analytically when the relaying channel gains are strictly greater than each other and strictly greater than the direct link channel gain. However, mathematically tractable lowerbound and upperbound solutions can be attained for the two problems. For both problems, by only using the lowerbound solution, we demonstrate significant throughput gains for both the primary and the secondary users through this active cooperation scheme. We find that most of the throughput gains come from minimizing the second phase transmission time since the secondary nodes assist the primary communication during this phase. Finally, we demonstrate the superiority of our proposed scheme compared to a number of reference schemes that include best relay selection, dual-hop routing, and an interference channel model.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7042294
dc.rights(c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
dc.subjectDecoding
dc.subjectEncoding
dc.subjectJoints
dc.subjectOptimization
dc.subjectReceivers
dc.subjectThroughput
dc.subjectWireless communication
dc.titleThroughput Maximization for Cognitive Radio Networks Using Active Cooperation and Superposition Coding
dc.typeArticle
dc.contributor.departmentCommunication Theory Lab
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Transactions on Wireless Communications
dc.eprint.versionPost-print
dc.contributor.institutionInstitut National de la Recherche Scientifiq ue (INRS- EMT), University of Quebec, Montreal, QC, Canada
kaust.personHamza, Doha R.
kaust.personPark, Kihong
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-06-13T16:52:24Z
dc.date.published-online2015-02-13
dc.date.published-print2015-06


Files in this item

Thumbnail
Name:
07042294.pdf
Size:
542.1Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record