Throughput-Guaranteed Resource-Allocation Algorithms for Relay-Aided Cellular OFDMA System

Radio resource allocation for downlink transmissions in a cellular system based on orthogonal frequency-division multiple access (OFDMA) has been the subject of many research studies over the past few years. Nowadays, increasing attention has turned to cellular systems with relays, but only a few al...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 58; H. 4; S. 1951 - 1964
Hauptverfasser: Kaneko, M., Popovski, P., Hayashi, K.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.05.2009
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Radio resource allocation for downlink transmissions in a cellular system based on orthogonal frequency-division multiple access (OFDMA) has been the subject of many research studies over the past few years. Nowadays, increasing attention has turned to cellular systems with relays, but only a few algorithms have been designed for OFDMA-based relay systems. In this paper, resource-allocation schemes are proposed for the cases of one relay station (RS) and multiple RSs in the cell. Due to the specific design of these algorithms, which operate in an RS-aided base station centralized manner, the amount of required channel-state information and algorithm complexity are minimized, making them suited for practical use. The idea of adaptive RS activation is introduced, where the frame structure is adapted depending on the active RS. Different numbers of relays are considered, and the corresponding algorithms are accordingly adapted. Simulation results show that our algorithms achieve a very good throughput/outage tradeoff.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2008.2005058