TY - GEN
T1 - Downlink OFDM scheduling and resource allocation for delay constraint SVC streaming
AU - Ji, Xin
AU - Huang, Jianwei
AU - Chiang, Mung
AU - Catthoor, Francky
PY - 2008
Y1 - 2008
N2 - Efficient delivery of multimedia contents over wireless network is essential for future communication networks. However, content distribution and network engineering are traditionally studied separately, which leads to suboptimal network performance. In this paper, we consider the problem of scheduling and resource allocation for multi-user video streaming over downlink OFDM channels. The video streams are precoded with the SVC coding scheme, which offers both quality and temporal scalabilities. The OFDM technology provides the maximum flexibility of resource allocation in terms of time, frequency, and power. We propose a gradient-based scheduling and resource allocation algorithm, which explicitly takes account of video contents, deadline requirements, and the previous transmission results when calculating users' priority weights. Simulation results show that our proposed algorithm always outperforms the content-blind and deadline-blind algorithms, with a performance gain as much as 6 dB in terms of average user PSNR improvement in a congested network.
AB - Efficient delivery of multimedia contents over wireless network is essential for future communication networks. However, content distribution and network engineering are traditionally studied separately, which leads to suboptimal network performance. In this paper, we consider the problem of scheduling and resource allocation for multi-user video streaming over downlink OFDM channels. The video streams are precoded with the SVC coding scheme, which offers both quality and temporal scalabilities. The OFDM technology provides the maximum flexibility of resource allocation in terms of time, frequency, and power. We propose a gradient-based scheduling and resource allocation algorithm, which explicitly takes account of video contents, deadline requirements, and the previous transmission results when calculating users' priority weights. Simulation results show that our proposed algorithm always outperforms the content-blind and deadline-blind algorithms, with a performance gain as much as 6 dB in terms of average user PSNR improvement in a congested network.
UR - http://www.scopus.com/inward/record.url?scp=51249106837&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51249106837&partnerID=8YFLogxK
U2 - 10.1109/ICC.2008.476
DO - 10.1109/ICC.2008.476
M3 - Conference contribution
AN - SCOPUS:51249106837
SN - 9781424420742
T3 - IEEE International Conference on Communications
SP - 2512
EP - 2518
BT - ICC 2008 - IEEE International Conference on Communications, Proceedings
T2 - IEEE International Conference on Communications, ICC 2008
Y2 - 19 May 2008 through 23 May 2008
ER -