Relay Selection and Resource Allocation in One-Way and Two-Way Cognitive Relay Networks
AuthorsAlsharoa, Ahmad M.
Embargo End Date2014-05-13
Permanent link to this recordhttp://hdl.handle.net/10754/291038
MetadataShow full item record
Access RestrictionsAt the time of archiving, the student author of this thesis opted to temporarily restrict access to it. The full text of this thesis became available to the public after the expiration of the embargo on 2014-05-13.
AbstractIn this work, the problem of relay selection and resource power allocation in one- way and two-way cognitive relay networks using half duplex channels with different relaying protocols is investigated. Optimization problems for both single and multiple relay selection that maximize the sum rate of the secondary network without degrading the quality of service of the primary network by respecting a tolerated interference threshold were formulated. Single relay selection and optimal power allocation for two-way relaying cognitive radio networks using decode-and-forward and amplify-and-forward protocols were studied. Dual decomposition and subgradient methods were used to find the optimal power allocation. The transmission process to exchange two different messages between two transceivers for two-way relaying technique takes place in two time slots. In the first slot, the transceivers transmit their signals simultaneously to the relay. Then, during the second slot the relay broadcasts its signal to the terminals. Moreover, improvement of both spectral and energy efficiency can be achieved compared with the one-way relaying technique. As an extension, a multiple relay selection for both one-way and two-way relaying under cognitive radio scenario using amplify-and-forward were discussed. A strong optimization tool based on genetic and iterative algorithms was employed to solve the formulated optimization problems for both single and multiple relay selection, where discrete relay power levels were considered. Simulation results show that the practical and low-complexity heuristic approaches achieve almost the same performance of the optimal relay selection schemes either with discrete or continuous power distributions while providing a considerable saving in terms of computational complexity.
CitationAlsharoa, A. M. (2013). Relay Selection and Resource Allocation in One-Way and Two-Way Cognitive Relay Networks. KAUST Research Repository. https://doi.org/10.25781/KAUST-59OYC
Showing items related by title, author, creator and subject.
Opportunistic relaying in multipath and slow fading channel: Relay selection and optimal relay selection periodSungjoon Park,; Stark, Wayne E. (2011 - MILCOM 2011 Military Communications Conference, Institute of Electrical and Electronics Engineers (IEEE), 2011-11) [Conference Paper]In this paper we present opportunistic relay communication strategies of decode and forward relaying. The channel that we are considering includes pathloss, shadowing, and fast fading effects. We find a simple outage probability formula for opportunistic relaying in the channel, and validate the results by comparing it with the exact outage probability. Also, we suggest a new relay selection algorithm that incorporates shadowing. We consider a protocol of broadcasting the channel gain of the previously selected relay. This saves resources in slow fading channel by reducing collisions in relay selection. We further investigate the optimal relay selection period to maximize the throughput while avoiding selection overhead. © 2011 IEEE.
Efficient multiple antenna-relay selection algorithms for MIMO unidirectional-bidirectional cognitive relay networksAlsharoa, Ahmad M.; Ghazzai, Hakim; Alouini, Mohamed-Slim (Transactions on Emerging Telecommunications Technologies, Wiley, 2014-04-29) [Article]
SWIPT in Multiuser MIMO Decode-and-Forward Relay Broadcasting Channel with Energy Harvesting RelaysBenkhelifa, Fatma; Salem, Ahmed Sultan; Alouini, Mohamed-Slim (2016 IEEE Globecom Workshops (GC Wkshps), Institute of Electrical and Electronics Engineers (IEEE), 2017-02-09) [Conference Paper]In this paper, we consider a multiuser multiple- input multiple-output (MIMO) decode-and-forward (DF) relay broadcasting channel (BC) with single source, multiple energy harvesting relays and multiple destinations. Since the end-to-end sum rate maximization problem is intractable, we tackle a simplified problem where we maximize the sum of the harvested energy at the relays, we employ the block diagonalization (BD) procedure at the source, and we mitigate the interference between the relay- destination channels. The interference mitigation at the destinations is managed in two ways: either to fix the interference covariance matrices at the destination and update them at each iteration until convergence, or to cancel the interference using an algorithm similar to the BD method. We provide numerical results to show the relevance of our proposed solution.