Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels
@article{Shaqfeh2011JointPA, title={Joint Power and Resource Allocation for Block-Fading Relay-Assisted Broadcast Channels}, author={Mohammad Shaqfeh and Hussein M. Alnuweiri}, journal={IEEE Transactions on Wireless Communications}, year={2011}, volume={10}, pages={1904-1913} }
We provide the solution for optimizing the power and resource allocation over block-fading relay-assisted broadcast channels in order to maximize the long term average achievable rates region of the users. The problem formulation assumes regenerative (repetition coding) decode-and-forward (DF) relaying strategy, long-term average total transmitted power constraint, orthogonal multiplexing of the users messages within the channel blocks, possibility to use a direct transmission (DT) mode from…
28 Citations
RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS
- Computer Science, Business
- 2014
In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and…
Optimal power allocation for layered broadcast over amplify-and-forward relay channels
- Computer Science2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
- 2014
The expected utility function is characterized in terms of the channel statistics of the fading channels, and the optimization problem for any number of source layers is solved, finding that for some conditions, it is optimal to send only one layer.
Joint scheduling for dual-hop block-fading broadcast channels
- Computer Science2012 IEEE Globecom Workshops
- 2012
This paper proposes joint user-and-hop scheduling over dual-hop block-fading broadcast channels in order to exploit multi-user diversity gains and multi-hop diversity gains all together and demonstrates via numerical results that the proposed joint scheduling scheme enlarges the rate region as compared with a scheme that employs multi- user scheduling alone.
Power optimization for layered transmission over decode-and-forward relay channels
- Computer Science2014 International Wireless Communications and Mobile Computing Conference (IWCMC)
- 2014
The expected utility function is characterized in terms of the channel statistics of the fading channels, and the optimization problem is solved using the numerical random search method.
Resource Allocation for Two Source-Destination Pairs Sharing a Single Relay with a Buffer
- Computer ScienceIEEE Transactions on Communications
- 2014
This paper obtains the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay and shows that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rates significantly.
Exploiting Multi-User Diversity and Multi-Hop Diversity in Dual-Hop Broadcast Channels
- Computer ScienceIEEE Transactions on Wireless Communications
- 2013
Numerical results demonstrate that the proposed joint scheduling scheme enlarges the rate region as compared to scheduling schemes that exploit the diversity gains partially and extends the scheme into one that allows multiple user scheduling via superposition coding with successive decoding.
Adaptive transmission and dynamic resource allocation for relay-assisted wireless networks
- Computer Science, Business2013 1st International Conference on Communications, Signal Processing, and their Applications (ICCSPA)
- 2013
Simulation results for the optimal channel-aware adaptive transmission, dynamic resource allocation and multiuser scheduling schemes for the downlink of a wireless cell that is assisted by a number of relays are provided.
Enhancing the Efficiency of Constrained Dual-Hop Variable-Gain AF Relaying Under Nakagami- $m$ Fading
- Computer Science, BusinessIEEE Transactions on Signal Processing
- 2014
This paper studies power allocation for performance constrained dual-hop variable-gain amplify-and-forward relay networks in Nakagami- m fading and provides closed-form solutions for all the problems which are easy to implement except in two cases, namely selective relaying with partial CSI for power minimization and SNR maximization.
Resource Allocation for Multiuser Improved AF Cooperative Communication Scheme
- Computer ScienceIEEE Transactions on Wireless Communications
- 2015
Joint power and bandwidth allocation of an improved amplify and forward (AF) cooperative communication scheme is proposed to utilize the spectrum efficiently and a two-step iterative algorithm is proposed, which alternates between solving either power allocation sub-problem for a given bandwidth profile or a bandwidth allocationSub-problemfor a given power profile.
Power Allocation Strategies for Fixed-Gain Half-Duplex Amplify-and-Forward Relaying in Nakagami-m Fading
- Computer ScienceIEEE Transactions on Wireless Communications
- 2014
Numerical results show the benefit of having full feedback at the relays for both optimization problems and show that feedback overhead can be reduced by having only limited feedback to the relay with only a small degradation in performance.
References
SHOWING 1-10 OF 49 REFERENCES
Power and Resource Allocation for Orthogonal Multiple Access Relay Systems
- Computer Science2008 IEEE International Symposium on Information Theory
- 2008
The numerical results show that the joint allocation of power and the channel resource achieves significantly larger achievable rate regions than those achieved by power allocation alone with fixed channel resource allocation.
Opportunistic cooperation by dynamic resource allocation
- Computer ScienceIEEE Transactions on Wireless Communications
- 2007
This work considers a Rayleigh fading wireless relay channel where communication is constrained by delay and average power limitations, and introduces opportunistic decode-and-forward (ODF) protocol which utilizes the relay depending on the channel state.
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
- Computer ScienceIEEE Transactions on Information Theory
- 2007
Capacities are established for fading relay channels that satisfy certain conditions and lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels.
Capacity bounds and power allocation for wireless relay channels
- Computer Science, BusinessIEEE Transactions on Information Theory
- 2005
Compared to the direct transmission and traditional multihop protocols, the results reveal that optimum relay channel signaling can significantly outperform multihip protocols, and that power allocation has a significant impact on the performance.
A Unified Approach to QoS-Guaranteed Scheduling for Channel-Adaptive Wireless Networks
- Computer Science, BusinessProceedings of the IEEE
- 2007
A unified framework for channel-aware QoS-guaranteed scheduling protocols for use in adaptive wireless networks whereby multiple terminals are linked through orthogonal fading channels to an access point, and transmissions are (opportunistically) adjusted to the intended channel.
Throughput-Guaranteed Resource-Allocation Algorithms for Relay-Aided Cellular OFDMA System
- Computer Science, BusinessIEEE Transactions on Vehicular Technology
- 2009
Resource-allocation schemes are proposed for the cases of one relay station (RS) and multiple RSs in the cell and the idea of adaptive RS activation is introduced, where the frame structure is adapted depending on the active RS.
Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity
- Computer ScienceIEEE Trans. Inf. Theory
- 2001
This paper derives the outage capacity regions of fading broadcast channels, assuming that both the transmitter and the receivers have perfect channel side information, and finds a strategy which bounds the outage probability region for different spectrum-sharing techniques.
Cooperative strategies and capacity theorems for relay networks
- Computer ScienceIEEE Transactions on Information Theory
- 2005
The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted.
Gaussian orthogonal relay channels: optimal resource allocation and capacity
- Computer ScienceIEEE Transactions on Information Theory
- 2005
A Gaussian orthogonal relay model is investigated, and it is shown that when the relay-to-destination signal- to-noise ratio (SNR) is less than a certain threshold, the capacity at the optimizing /spl theta/ is also the maximum capacity of the channel over all possible resource allocation parameters.
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
- Computer ScienceIEEE Transactions on Information Theory
- 2004
Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.