Cart (Loading....) | Create Account
Close category search window

Joint Power and Channel Resource Allocation for F/TDMA Decode and Forward Relay Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Yin Sun ; Dept. of Electron. Eng., Tsinghua Univ., Beijing, China ; Yuanzhang Xiao ; Ming Zhao ; Xiaofeng Zhong
more authors

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.

Published in:

Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE

Date of Conference:

Nov. 30 2009-Dec. 4 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.