A MDP-Based Dynamic Scheduling Scheme for Deadline Constrained Content Distribution in Wireless Heterogeneous Network

In this paper, we study the propagation of deadline- constrained content over wireless cellular network, in which the base station transmits a content to a certain set of users. The lifetime of a content is consumed in two aspects: waiting in the queue and transmitting. In our system, the base station first transmits the content to users with a certain data rate, such that some users may not directly receive the content. Afterwards, the users who obtained the content would forward the content to the other users. Due to the deadline constraint of each content, we formulate the scheduling problem by using Markov Decision Processing (MDP) with the objective of maximizing the throughput of the whole system. We propose an algorithm based on value iteration. Extensive simulation results are provided to demonstrate that our scheduling algorithm can efficiently improve system throughput.