Recipient Maximization Multicast Scheme in IEEE 802.16j WiMAX Relay Networks

摘要

In this paper, we tackle an important problem in WiMAX relay networks called Multicast Recipient Maximization (MRM), which maximizes the number of multicast recipients with given budget. To deal with this problem, a novel resource allocation scheme called Dynamic Station Selection (DSS) is proposed. We prove that MRM is NP-hard, while our DSS has polynomial-time computational complexity. The simulation results show that under different situations, the performance of DSS always approximates the optimal solution. With this scheme, multimedia streams can be efficiently multicast over IEEE 802.16j WiMAX Relay Networks.