Transmit Power Minimization and Base Station Planning for High-Speed Trains with Multiple Moving Relays in OFDMA Systems
Author | Ghazzai, Hakim |
Author | Bouchoucha, Taha |
Author | Alsharoa, Ahmad |
Author | Yaacoub, Elias |
Author | Alouini, Mohamed-Slim |
Author | Al-Naffouri, Tareq Y. |
Available date | 2024-09-29T09:39:45Z |
Publication Date | 2017 |
Publication Name | IEEE Transactions on Vehicular Technology |
Resource | Scopus |
ISSN | 189545 |
Abstract | 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. |
Language | en |
Publisher | IEEE |
Subject | High-speed railway communication moving relays planning Resource-allocation algorithm |
Type | Conference Paper |
Pagination | 175-187 |
Issue Number | 1 |
Volume Number | 66 |
Files in this item
This item appears in the following Collection(s)
-
QMIC Research [219 items ]