Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

TL;DR

This paper investigates the impact of asynchrony in cooperative relay networks on the diversity-multiplexing tradeoff, proposing protocols and codes that achieve optimal diversity bounds despite asynchronous operation.

Contribution

It introduces models and protocols for asynchronous cooperative networks that attain the optimal diversity-multiplexing tradeoff, extending the understanding beyond synchronous assumptions.

Findings

Protocols achieve the transmit diversity bound asymptotically.

Designed distributed space-time codes are effective for all multiplexing gains.

Models accommodate any number of relays under asynchronous conditions.

Abstract

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for any number of relays.