Diversity-Multiplexing Trade-Off In Ad-Hoc Networks

In this paper, the diversity-multiplexing trade-off is derived for a one-dimensional equally-spaced Rayleigh fading ad-hoc network. It is assumed that the interference from each link to the other links in the network declines exponentially with the distance, such that the attenuation between two neighbor links is rho^alpha0. For any given multiplexing gain r, the maximum diversity gain is achieved by utilizing a general time-sharing scheme. We obtain an explicit formula for the maximum diversity gain, and show that depending on the value of r and alpha₀, there is an optimum time-sharing factor which yields the maximum diversity gain.