Relaying protocols for two colocated users
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Relay techniques for MIMO wireless networks with multiple source and destination pairs
EURASIP Journal on Wireless Communications and Networking
Capacity of wireless ad hoc networks with opportunistic collaborative communications
EURASIP Journal on Wireless Communications and Networking
Practical quantize-and-forward schemes for the frequency division relay channel
EURASIP Journal on Wireless Communications and Networking
Quantifying the loss of compress-forward relaying without Wyner-Ziv coding
IEEE Transactions on Information Theory
Opportunistic cooperation by dynamic resource allocation
IEEE Transactions on Wireless Communications
Cooperative Communications with Outage-Optimal Opportunistic Relaying
IEEE Transactions on Wireless Communications
On the Outage Probability of a Multiple-Input Single-Output Communication Link
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Space-time diversity enhancements using collaborative communications
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
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective
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 | 754.84 |
A wireless network is considered where a source is communicating with a remote destination, and where a relay terminal is occasionally present in close proximity to the source but without the source's knowledge. The channel source-relay is assumed fixed due to the short distance, while the channels source-destination and relay-destination are affected by block flat Rayleigh fading, where channel state information is known only to respective receivers. Oblivious cooperative protocols are addressed which improve performance when the relay is present and do not degrade it when the relay is absent--and all this while the source is uninformed of the actual topology. Using the expected throughput as a performance measure, several such protocols based on decode-and-forward and quantize-and-forward are proposed for this network. It turns out that block Markov decode-and-forward (BMDF) with appropriate decoding is in fact an oblivious cooperative protocol. The optimal correlation between the transmissions of the source and the relay in decode-and-forward and the corresponding optimum performance are characterized. Finally, quantize-and-forward is considered for rates which preclude the usage of decode-and-forward, and several schemes are proposed for incorporating partial side information in the relay's quantization.