Transmit Power Minimization and Base Station Planning for High-Speed Trains With Multiple Moving Relays in OFDMA Systems

A high-speed railway system equipped with moving relay stations placed on the middle of the ceiling of each train wagon is investigated. The users inside the train are served in two hops via orthogonal frequency-division multiple-access (OFDMA) technology. In this paper, we first focus on minimizing...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 66; H. 1; S. 175 - 187
Hauptverfasser: Ghazzai, Hakim, Bouchoucha, Taha, Alsharoa, Ahmad, Yaacoub, Elias, Alouini, Mohamed-Slim, Al-Naffouri, Tareq Y.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.01.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Computer simulation
Handover
High speed rail
High-speed railway communication
Mobile communication systems
moving relays
Optimization
Orthogonal Frequency Division Multiplexing
Planning
Power consumption
Power management
Quality of service
Rail transportation
Railroad transportation
Railway stations
Railways
Relay stations
Relays
Resource management
resource-allocation algorithm
Subcarriers
Trains
Wireless communications
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A high-speed railway system equipped with moving relay stations placed on the middle of the ceiling of each train wagon is investigated. The users inside the train are served in two hops via orthogonal frequency-division multiple-access (OFDMA) technology. In this paper, we first focus on minimizing the total downlink power consumption of the base station (BS) and the moving relays while respecting specific quality-of-service (QoS) constraints. We first derive the optimal resource-allocation solution, in terms of OFDMA subcarriers and power allocation, using the dual decomposition method. Then, we propose an efficient algorithm based on the Hungarian method to find a suboptimal but low-complexity solution. Moreover, we propose an OFDMA planning solution for high-speed trains by finding the maximal inter-BS distance, given the required user data rates to perform seamless handover. Our simulation results illustrate the performance of the proposed resource-allocation schemes in the case of Third-Generation Partnership Project (3GPP) Long-Term Evolution Advanced (LTE-A) and compare them with previously developed algorithms, as well as with the direct transmission scenario. Our results also highlight the significant planning gain obtained, owing to the use of multiple relays instead of the conventional single-relay scenario.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2016.2542344