Efficient scheduling for multicasting hard deadline constrained prioritized data via two interfaces

This paper considers the transmission scene of multicasting hard deadline constrained prioritized (HDCP) packets via cellular links and D2D links. That is to say, each device with two wireless interfaces could receive HDCP packets from the base station (BS) and transmit or receive HDCP packets from other devices concurrently. In this transmission scene, we study the problem of maximizing the network throughput and minimizing the mean delivery delay per packet. Then we propose a greedy scheduling (GS_Cellular&D2D) algorithm, which jointly selects the transmit device and schedules the coded packet transmitted from the BS and selected device at each time slot in order to maximize one time step future-reward. As contrast, we also analyze another two algorithms: ARQ_Cellular&D2D and RNC_Cellular&D2D. Simulation results show the excellent performance of GS_Cellular&D2D.