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
Minimum Common Outage Probability for the Broadcast Relay Channel
Download
index.pdf
Date
2011-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
79
views
33
downloads
Cite This
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 computed. Based on the cut-set bound (CSB), a lower bound on the minimum common outage probability and an upper bound on the epsilon-outage rate region are also found. Numerical results suggest that enforcing the relay to help both destinations simultaneously is limiting. The dominant factor in the gains obtained with respect to DT is due to path selection and link combination is not necessary when the relay is close to the source.
Subject Keywords
broadcast relay channel
,
common outage probability
,
cooperation
,
power allocation
,
long-term power constraint
,
wireless channels
,
RESOURCE-ALLOCATION
,
CAPACITY THEOREMS
,
POWER ALLOCATION
,
FADING CHANNELS
,
COOPERATION
,
DIVERSITY
,
NETWORKS
URI
https://hdl.handle.net/11511/96534
DOI
https://doi.org/10.1109/iwcmc.2011.5982665
Conference Name
7th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC)
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Transmission strategies and resource allocation for fading broadcast relay channels
Isikman, Arif Onder; Yüksel Turgut, Ayşe Melda (2015-01-01)
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 on...
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...
A Low-Complexity Policy for Outage Probability Minimization With an Energy Harvesting Transmitter
Isikman, Arif Onder; Yüksel Turgut, Ayşe Melda; Gunduz, Deniz (2017-04-01)
Outage probability in an energy harvesting (EH) block-fading communication system is studied in the finitehorizon online setting. First, the offline version of the problem is considered, and formulated as a mixed integer linear program (MILP). Then, the infinite-horizon online problem (IIL) is considered relaxing the battery constraints. Solutions of these two problems provide lower bounds on the finite-horizon online problem, for which we provide a low-complexity heuristic scheme, called the fixed threshol...
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 ...
Distributed Power Control Using Non-monotonic Reaction Curves
Ozel, Omur; Uysal, Elif (2009-05-15)
In this paper, we study distributed power control in an interference network. In particular, distributed power control mechanisms are devised by exploiting a one-shot noncooperative game based on a suitably chosen utility function. The utility is a function of quality of service (QoS) objectives defined in terms of fading-induced outage probabilities. Equilibrium analysis of the resulting power control game is made, and its relationship with admission control is discussed. The main contribution of the paper...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. O. Isikman and A. M. Yüksel Turgut, “Minimum Common Outage Probability for the Broadcast Relay Channel,” presented at the 7th IEEE International Wireless Communications and Mobile Computing Conference (IWCMC), İstanbul, Türkiye, 2011, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/96534.