Please use this identifier to cite or link to this item:
Title: OFDMA-based multicast with multiple base stations
Authors: Kazez, Ahmet Cihat
Girici, Tolga
Keywords: Multicast
orthogonal frequency division multiplexing
erasure codes
rateless codes
multiple base stations
Issue Date: 2015
Publisher: Tubitak Scientific & Technical Research Council Turkey
Source: Kazez, A. C., & Girici, T. (2015). OFDMA-based multicast with multiple base stations. Turkish Journal of Electrical Engineering & Computer Sciences, 23(5), 1372-1383.
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.
ISSN: 1300-0632
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
TR Dizin İndeksli Yayınlar / TR Dizin Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
OFDMA_TG.pdf677.9 kBAdobe PDFThumbnail
Show full item record

CORE Recommender

Page view(s)

checked on Dec 26, 2022


checked on Dec 26, 2022

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.