A resource allocation algorithm for SVC multicast over wireless relay networks based on Cascaded Coverage Problem

The resource allocation problem to support scalable-video multicast for wireless relay networks is complex due to the existence of the relay station. In this paper, we consider the resource allocation for SVC multicast over two-hop wireless relay networks to maximize the total system utility of all users where the system utility can be a general non-negative, non-decreasing function. We model the problem in three-layer structure (choice elements, action elements, and user elements) to cope with the joint dependency and overlapping phenomena. We formulate the problem as Cascaded Coverage Problem (CCP) and propose a greedy algorithm with polynomial time complexity. Simulation results show that our algorithm keeps good performance as compared with the optimal result. We also evaluate the influence of different user distribution types and the number of relay stations.