On the Throughput Capacity of Opportunistic Multicasting with Erasure Codes
Author:
- U. C. KozatUKU. C. Kozat
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 520-528
Abstract
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 well- established for opportunistic scheduling of unicast flows. Our overall evaluations demonstrate that under both i.i.d. and non-i.i.d. channel conditions, opportunistic multicasting with erasure coding can significantly improve the performance over the traditional techniques used in today's communication systems.Keywords
This publication has 13 references indexed in Scilit:
- A Cross-Layer Design Approach to Multicast in Wireless NetworksIEEE Transactions on Wireless Communications, 2007
- Reliable Multimedia Download Delivery in Cellular Broadcast NetworksIEEE Transactions on Broadcasting, 2007
- Multicast Scheduling in Cellular Data Networks2007
- On the throughput-delay tradeoff in cellular multicast2005
- A delay analysis for opportunistic transmission in fading broadcast channels2005
- Wireless Multicast: Theory and ApproachesIEEE Transactions on Information Theory, 2005
- Burst Erasure Correction Codes With Low Decoding DelayIEEE Transactions on Information Theory, 2004
- Convergence of Proportional-Fair Sharing Algorithms Under General ConditionsIEEE Transactions on Wireless Communications, 2004
- LT codes2003
- Elements of Information Theory2001