2018/01/16 by Santana, Thomas Varela, Combes, Richard, Kobayashi, Mari
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1801.05224
We consider a device-to-device (D2D) aided multicast channel, where a transmitter wishes to convey a common message to many receivers and these receivers cooperate with each other. We propose a simple computationally efficient scheme requiring only statistical channel knowledge at transmitter. Our analysis in general topologies reveals that, when the number of receivers K grows to infinity, the proposed scheme guarantees a multicast rate of 1 \over 2 log2(1 + βln K ) with high probability for any β< β^⋆ where β^⋆ depends on the network topology. This scheme undergoes a phase transition at threshold β^⋆ ln K where transmissions are successful/unsuccessful with high probability when the SNR is above/below this threshold. We also analyze the outage rate of the proposed scheme in the same setting.