Abstract
In LTE-Advanced or 802.16m WiMAX-based relay networks, the downlink broadcast of massive amounts of data is a crucial application. To help the application save the radio resource consumption significantly, it is necessary to find the minimum resource allocation such that the Base Station (BS) and all designated Mobile Stations (MSs) are connected via a subset of Relay Stations (RSs). In this context, the allocation problem can be seen as a path construction problem. In this paper, we formulate the path construction problem as an integer linear programming (ILP) model. Because of the computational complexity of ILP, we propose an algorithm, called the Resource Diminishing Principle (RDP), to address the problem. We evaluate the performance of RDP by a series of simulations. The simulation results show that RDP meets the desired targets, and also outperforms existing solutions. © 2012 IEEE.