Sciweavers

Share
INFOCOM
2008
IEEE

On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes

9 years 7 months ago
On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we present how one can jointly utilize fixed-rate and rateless erasure coding along with simple rate adaptation techniques in order to achieve the optimal multicast throughput per user. We first investigate the performance of the proposed system under i.i.d. channel conditions. Our analysis shows a linear gain for the multicast capacity over i.i.d. Rayleigh fading channels with respect to the number of users. Since the established results require coding over large number of blocks and hence induce large decoding delays, we extend our analysis to the cases where we code over shorter block lengths and thus quantify the delay-capacity tradeoffs under a simple setting. We further look into non-i.i.d. channel conditions and show achievable gains by modifying a scheduling heuristic whose fairness is wellestablished for op...
Ulas C. Kozat
Added 31 May 2010
Updated 31 May 2010
Type Conference
Year 2008
Where INFOCOM
Authors Ulas C. Kozat
Comments (0)
books