A broadcast approach for a single-user slowly fading MIMO channel
IEEE Transactions on Information Theory
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
Transmitting to colocated users in wireless ad hoc and sensor networks
IEEE Transactions on Information Theory
Cooperative Relay Broadcast Channels
IEEE Transactions on Information Theory
Rate Regions for Relay Broadcast Channels
IEEE Transactions on Information Theory
Compound relay channel with informed relay and destination
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
| Hi-index | 0.00 |
The simultaneous relay channel is investigated where the source is unaware of the channel statistic controlling the communication but knows that this statistic is one of two possible discrete memoryless relay channels. We aim to derive coding schemes capable of transmitting information, regardless of which of these relays is present. First, this problem is recognized as being equivalent to that of sending common and private information to two destinations in presence of two helper relays. In this scenario, each possible relay links becomes a branch of the so-called broadcast relay channel. An inner bound on the capacity region of this channel is derived. Applications of these results arise when the source node is uncertain of the noise levels or the network topology (e.g. due to user mobility the positions of the relay and the destination nodes are unknown). Specific rates are computed for an AWGN relay channel, where the relay node may be absent but the source node is unaware of this.