A branch and bound method for stochastic global optimization
Mathematical Programming: Series A and B
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Outage analysis of coded cooperation
IEEE Transactions on Information Theory
A Case for Amplify–Forward Relaying in the Block-Fading Multiple-Access Channel
IEEE Transactions on Information Theory
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We consider a multiple access MAC fading channel with two users communicating with a common destination, where each user mutually acts as a relay for the other one as well as wishes to transmit his own information as opposed to having dedicated relays. We wish to evaluate the usefulness of relaying from the point of view of the system's throughput (sum rate) rather than from the sole point of view of the user benefiting from the cooperation as is typically done. We do this by allowing a trade-off between relaying and fresh data transmission through a resource allocation framework. We develop capacity expressions for our scheme and derive the rate-optimum power allocation in closed form for distributed frameworks. In the distributed scenario, partially statistical and partially instantaneous channel information is exploited. Our results indicate that the sum rate is maximized when both mobiles act selfishly.