TY - JOUR
T1 - Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations
AU - Chen, Chao
AU - Baek, Seung Jun
AU - De Veciana, Gustavo
N1 - Funding Information:
C. Chen and S. J. Baek were supported in part by the Institute for Information and Communications Technology Promotion within the Ministry of Science, ICT and Future Planning (MSIP) under Grant B0126-15-1046 and in part by the Basic Science Research Program within MSIP through the National Research Foundation of Korea under Grant NRF-2013R1A1A1062500. G. de Veciana was supported by the National Science Foundation within the Division of Computer and Network Systems under Grant CNS-1343383.
Publisher Copyright:
© 2016 IEEE.
PY - 2016/10
Y1 - 2016/10
N2 - We consider the multicast scheduling problem for the block transmission of packets in a heterogeneous network using a half-duplex relay station (RS). The RS uses random linear coding to efficiently transmit packets over time-varying multicast channels. Our goal is to minimize the average decoding delay. Because of the half-duplex operation, at each time slot, the RS must decide to either: 1) fetch a new packet for encoding from the base station or 2) multicast a coded packet to wireless users. Thus, optimal scheduling hinges on exploiting multicast opportunities while persistently supplying the encoder (at the RS) with new packets. We formulate an associated fluid control problem and show that the optimal policy incorporates opportunism across multicast channels, i.e., the RS performs a multicast transmission only if the collection of channel conditions is favorable; otherwise, it performs a fetch. Based on the fluid policy, we propose an online algorithm. We prove that our algorithm asymptotically incurs no more than 4/3 and 2 times the optimal delay, for two-user and arbitrary number of user system, respectively. Simulation results show that, in fact, our algorithm's performance is very close to theoretical bounds.
AB - We consider the multicast scheduling problem for the block transmission of packets in a heterogeneous network using a half-duplex relay station (RS). The RS uses random linear coding to efficiently transmit packets over time-varying multicast channels. Our goal is to minimize the average decoding delay. Because of the half-duplex operation, at each time slot, the RS must decide to either: 1) fetch a new packet for encoding from the base station or 2) multicast a coded packet to wireless users. Thus, optimal scheduling hinges on exploiting multicast opportunities while persistently supplying the encoder (at the RS) with new packets. We formulate an associated fluid control problem and show that the optimal policy incorporates opportunism across multicast channels, i.e., the RS performs a multicast transmission only if the collection of channel conditions is favorable; otherwise, it performs a fetch. Based on the fluid policy, we propose an online algorithm. We prove that our algorithm asymptotically incurs no more than 4/3 and 2 times the optimal delay, for two-user and arbitrary number of user system, respectively. Simulation results show that, in fact, our algorithm's performance is very close to theoretical bounds.
KW - Heterogeneous networks
KW - asymptotic performance
KW - fluid approximation
KW - network coding
KW - opportunistic scheduling
UR - http://www.scopus.com/inward/record.url?scp=84988637618&partnerID=8YFLogxK
U2 - 10.1109/TIT.2016.2537837
DO - 10.1109/TIT.2016.2537837
M3 - Article
AN - SCOPUS:84988637618
VL - 62
SP - 5538
EP - 5555
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 10
M1 - 7425230
ER -