Memory aware broadcast for wireless real time applications

In this paper we study network coding based wireless broadcast scheduling problem in real time applications under the memory model, aiming at minimizing the number of packets which miss their deadlines. In the memory model, receiver has enough memory, a receiver will buffer all received encoded packets and decode out their wanted packets when enough packets are received. We prove the coding based scheduling problem under memory model is NP-hard. According to marking colors on the vertices of the weighted graph to illustrate the needed packets can be decoded using the buffered encoded packet, effective heuristic algorithm is proposed in this paper. Simulation results show that our algorithm significantly reduce the deadline miss ratio in most cases, which is an important performance metric in real time applications.