A Multicast Scheduling Approach for Layered Video Service in Vehicular Ad Hoc Networks

This paper investigates the resource allocation problem for the layered video multicast in Vehicular Ad Hoc Networks (VANETs). The problem studied in this paper is called Basic-full-coverage and Profits-oriented Resource Allocation problem, abbreviated as BPRA problem. The basic layer streams, with which the video can be viewable, are ensured to be received by all vehicles who subscribe the target video. This can guarantee the fundamental reception justice while the overall goal is to obtain the highest profits. It can be proved that the BPRA problem is NP-hard aiming to obtain the optimal solution. Therefore, a heuristic algorithm, called H-BPRA, is proposed to solve this problem in polynomial time, which applies a progressive approach to obtain a solution approaching the optimal one. Simulation results show that performance of the proposed H-BPRA algorithm approaches the optimal solutions and verifies the accuracy of our work.