Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations

Citations

WEB OF SCIENCE

8
Citations

SCOPUS

8

초록

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.

키워드

Heterogeneous networksnetwork codingopportunistic schedulingfluid approximationasymptotic performanceNETWORKSTHROUGHPUTTRACKINGCHANNELDELAYMODEL
제목
Opportunistic Scheduling of Randomly Coded Multicast Transmissions at Half-Duplex Relay Stations
저자
Chen, ChaoBaek, Seung Junde Veciana, Gustavo
DOI
10.1109/TIT.2016.2537837
발행일
2016-10
유형
Article
저널명
IEEE Transactions on Information Theory
62
10
페이지
5538 ~ 5555