Decode-and-forward cooperative diversity with power allocation in wireless networks

TY - GEN

T1 - Decode-and-forward cooperative diversity with power allocation in wireless networks

AU - Luo, J.

AU - Blum, R. S.

AU - Cimini, L. J.

AU - Greenstein, L. J.

AU - Haimovich, A. M.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We study power allocation for the space-time-coded decode-and-forward cooperative diversity protocol in a wireless network under the assumption that only mean channel gains are available at the transmitters. In a Rayleigh fading channel with uniformly random node locations, a near-optimal power allocation that minimizes the outage probability is derived under a short-term power constraint, wherein the total power is fixed for each two-stage transmission. This near-optimal scheme allocates one half of the total power to the source node and splits the remaining half equally among selected relay nodes; a node is selected for relay if it is able to decode the signal from the source and its mean channel gain to the destination is above a threshold. Numerical results show that this scheme significantly outperforms the Constant-Power scheme, wherein all nodes use the same power at all times, and the Best-Select scheme, which employs one relay node with the largest mean relay-destination gain.

AB - We study power allocation for the space-time-coded decode-and-forward cooperative diversity protocol in a wireless network under the assumption that only mean channel gains are available at the transmitters. In a Rayleigh fading channel with uniformly random node locations, a near-optimal power allocation that minimizes the outage probability is derived under a short-term power constraint, wherein the total power is fixed for each two-stage transmission. This near-optimal scheme allocates one half of the total power to the source node and splits the remaining half equally among selected relay nodes; a node is selected for relay if it is able to decode the signal from the source and its mean channel gain to the destination is above a threshold. Numerical results show that this scheme significantly outperforms the Constant-Power scheme, wherein all nodes use the same power at all times, and the Best-Select scheme, which employs one relay node with the largest mean relay-destination gain.

UR - http://www.scopus.com/inward/record.url?scp=33846635446&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846635446&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/GLOCOM.2005.1578317

DO - https://doi.org/10.1109/GLOCOM.2005.1578317

M3 - Conference contribution

SN - 0780394143

SN - 9780780394148

VL - 5

SP - 3048

EP - 3052

BT - GLOBECOM'05

T2 - GLOBECOM'05: IEEE Global Telecommunications Conference, 2005

Y2 - 28 November 2005 through 2 December 2005

ER -