Joint power and channel resource allocation for F/TDMA decode and forward relay networks

Authors:
Yin Sun;Yuanzhang Xiao;Ming Zhao;Xiaofeng Zhong;Shidong Zhou;Ness B. Shroff
Affiliations:
Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;The Ohio State University
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 10
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Convex Optimization

Convex Optimization
Cooperative Communications and Networking

Cooperative Communications and Networking
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels

IEEE Transactions on Information Theory
Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity

IEEE Transactions on Information Theory
Outage Capacity of the Fading Relay Channel in the Low-SNR Regime

IEEE Transactions on Information Theory
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

IEEE Transactions on Information Theory
Low density parity check codes for the relay channel

IEEE Journal on Selected Areas in Communications
Joint optimization of relay strategies and resource allocations in cooperative cellular networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study the joint power and channel resource allocation problem for a multiuser F/TDMA decode-and-forward (DF) relay network under per-node power constraints and a total channel resource constraint. Our goal is to maximize the total throughput achieved by the systems. To that end, we formulate a joint power and channel resource allocation problem. We develop an iterative optimization algorithm to solve this problem, whose convergence and optimality are guaranteed. Due to the per-node power constraints, more than one relay node may be needed for a single data stream. Our solution also provides a way of finding the optimal relays among the assisting relay nodes.