Authors: AHMET CİHAT KAZEZ, TOLGA GİRİCİ
Abstract: We consider an orthogonal frequency division multiple access (OFDMA)-based multicast system where multiple base stations transmit a multicast session to a multicast group. The goal is to maximize the multicast rate (i.e. the minimum achievable user rate) subject to a total power constraint. We assume the use of an erasure code (e.g., a Reed--Solomon code) or rateless code (e.g., Luby transform code). This facilitates each user to accumulate rates from their best subchannels, so that the achievable multicast rate is not limited to the worst user. The resource allocation problem involves determining the transmitting base station at each OFDMA subchannel, the number of bits to be transmitted at each subchannel, and the set of nodes to decode the bits at each subchannel. We formulate the problem as a mixed binary integer linear programming and find the optimal solution as a benchmark. We also propose a greedy subchannel and bit allocation algorithm that is close to optimal.
Keywords: Multicast, orthogonal frequency division multiplexing, erasure codes, rateless codes, multiple base stations
Full Text: PDF