Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Transmission strategies and resource allocation for fading broadcast relay channels
Date
2015-01-01
Author
Isikman, Arif Onder
Yüksel Turgut, Ayşe Melda
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
86
views
0
downloads
Cite This
In this paper the broadcast relay channel, where the source communicates with multiple destinations with the help of a single relay is studied. Five different transmission protocols, direct transmission, multihop (MH), multihop with link combination (MHLC), path selection (PS) and path selection with link combination (PSLC) are investigated. In MH and MHLC, the relay decodes the source message and assists both destinations. In PS and PSLC, the relay can perform partial decoding and has the option to help only one of the destinations. Under long-term power constraint, power allocation for delay-limited transmission is performed to minimize common outage probability and individual outage probability region. For comparison, lower bounds on both common and individual outage probabilities are found. Numerical results suggest that path selection significantly lowers outage probabilities, while enforcing the relay to help both destinations simultaneously is limiting the system performance. (C) 2014 Elsevier GmbH. All rights reserved.
Subject Keywords
Broadcast relay channel
,
Cooperation
,
Long-term power constraint
,
Outage probability
,
Power allocation
,
OUTAGE PROBABILITY
,
CAPACITY
URI
https://hdl.handle.net/11511/96420
Journal
AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS
DOI
https://doi.org/10.1016/j.aeue.2014.12.010
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Minimum Common Outage Probability for the Broadcast Relay Channel
Isikman, Arif Onder; Yüksel Turgut, Ayşe Melda (2011-01-01)
In this paper the broadcast relay channel (BRC) is studied. In the BRC model, the source communicates with two destinations with the help of a single relay. The minimum common outage probability for four different transmission protocols, direct transmission (DT), multihop (MH), path selection (PS) and link combination with path selection (LCPS) is investigated under long-term power constraint for constant rate transmission. In addition, the epsilon-outage rate region for a fixed common outage probability is...
Capacity of Zero-Outage Scheme Under Imprecise Channel State Information
Candan, Çağatay (2013-01-01)
The capacity of zero-outage scheme with imprecise channel state information at the transmitter side (CSIT) for frequency flat, single-input multiple-output (SIMO) channels is examined. It is shown that when CSIT is not precise, the receiver signal-to-noise-ratio fluctuates and the scheme suffers from communication outages. Exact analytical expressions characterizing the outage capacity, the additional power required to compensate the effect of noisy CSIT are given and the impact of noisy CSIT on the ergodic...
Minimum Outage Probability for the Relay Channel under Individual Power Constraints
Yüksel Turgut, Ayşe Melda; YÜKSEKKAYA, BARIŞ (2012-07-01)
In this letter, minimum outage probability for a fading relay channel is considered for long-term individual power constraints (IPC1) at the source and the relay. By utilizing Lagrange multiplier theory, it is shown that solving the IPC problem is equivalent to solving a weighted sum power constrained (wSPC) problem. Opportunistic decode and forward (ODF), and simplified ODF (SODF) protocol performances are investigated and compared with a lower bound on outage probability, under both individual and sum pow...
OPTIMUM DISCRETE DISTRIBUTED BEAMFORMING FOR SINGLE GROUP MULTICASTING RELAY NETWORKS WITH RELAY SELECTION
Demir, Özlem Tuğfe; Tuncer, Temel Engin (2015-04-24)
In this paper, broadcast beamforming with relay selection is considered in wireless relay networks where there is no direct link between the source and the receivers. A source node transmits common information to many users employing multiple relays which use amplify-and-forward relay protocol. The channel state information is assumed to be available at a single relay to compute the relay weights and distribute them. Discrete relay weights are used due to several advantages including decreased overhead for ...
Diversity-multiplexing tradeoff in multiple-antenna relay systems
Yüksel Turgut, Ayşe Melda; Erkip, Elza (2006-01-01)
We study the diversity-multiplexing tradeoff (DMT) for the full-duplex relay channel when the source and the destination have multiple antennas, and the relay has I or more. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), partial decode-and-forward (PDF), and compress-and-forward (CF) protocols. We study the effect of increased degrees of freedom in the direct link and the source-relay channel when multiple antennas are introduced. Our results suggest that whi...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. O. Isikman and A. M. Yüksel Turgut, “Transmission strategies and resource allocation for fading broadcast relay channels,”
AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS
, vol. 69, no. 4, pp. 699–707, 2015, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/96420.