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

We study power allocation for the 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 distributed node locations, we aim to find the power allocation that minimizes the outage probability under a short-term power constraint, wherein the total power for all nodes is less than a prescribed value during each two-stage transmission. Due to the computational and implementation complexity of the optimal solution, we derived a simple near-optimal solution. In this near-optimal scheme, a fixed fraction of the total power is allocated to the source node in Stage I. In Stage II, the remaining power is split equally among a set of selected nodes if the selected set is not empty, and otherwise is allocated to the source node. A node is selected if it can decode the message from the source and its mean channel gain to the destination is above a threshold. In this scheme, each node only needs to know its own mean channel gain to the destination and the number of selected nodes. Simulation results show that the proposed scheme achieves an outage probability close to that for the optimal scheme obtained by numerical search, and achieves significant performance gain over other schemes in the literature.