Results 1 
5 of
5
On Tractability Aspects of Optimal Resource Allocation in OFDMA Systems
"... N.B.: When citing this work, cite the original article. ©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
N.B.: When citing this work, cite the original article. ©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Optimization Formulation
, 2012
"... – M user equipments (UEs) – N subchannels (N> M) – One subchannel consists of a few consecutive subcarriers with bandwidth B – Slow flat fading channels ..."
Abstract
 Add to MetaCart
(Show Context)
– M user equipments (UEs) – N subchannels (N> M) – One subchannel consists of a few consecutive subcarriers with bandwidth B – Slow flat fading channels
Simplified Sequential Linear Assignment Algorithm for Energy Efficient Resource Allocation
"... Abstract—We consider an energy efficient resource allocation method for orthogonal frequency division multiple access (OFDMA) systems consisting of M users and N subchannels. Transmit power assignment follows the optimal strategy, i.e., a waterfilling strategy, for the given subchannels. For the s ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—We consider an energy efficient resource allocation method for orthogonal frequency division multiple access (OFDMA) systems consisting of M users and N subchannels. Transmit power assignment follows the optimal strategy, i.e., a waterfilling strategy, for the given subchannels. For the subchannel allocation, we introduce a recently proposed algorithm called a sequential linear assignment algorithm (SLAA). The SLAA determines how many subchannels are allocated to each user and which subchannels are allocated to each user by solving the outer and inner problems, respectively, in an iterative manner; as a result, it requires O(MN2(N −M)2) complexity. To reduce the computational complexity of SLAA, we propose a simplified sequential linear assignment algorithm (SSLAA). Based on the observation that a user requiring the higher power would take the more subchannels, SSLAA uses each user’s power consumption as a metric to determine who will take an additional subchannel in each iteration. Consequently, contrast to SLAA using network power consumption as a metric, the SSLAA incurs significant reduction of computational complexity, by O (N2(N −M)2). Computer simulations in compared with other existing heuristic algorithms verify that the proposed SSLAA results in high energy efficiency and low computational complexity. Index Terms—OFDMA, energy efficiency, resource allocation, linear assignment algorithm. I.
1 Complexity Analysis of Joint Subcarrier and Power Allocation for the Cellular Downlink
, 2014
"... ar ..."
(Show Context)
EnergyEfficient TwoHop LTE Resource Allocation in High Speed Trains with Moving Relays
"... Abstract—Highspeed 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 the 3GPP Long Term Evolution (LTE) technology. The objective of this work is to maximize the number of ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Highspeed 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 the 3GPP Long Term Evolution (LTE) technology. The objective of this work is to maximize the number of served users by respecting a specific qualityofservice constraint while minimizing the total power consumption of the eNodeB and the moving relays. We propose an efficient algorithm based on the Hungarian method to find the optimal resource allocation over the LTE resource blocks in order to serve the maximum number of users with the minimum power consumption. Moreover, we derive a closedform expression for the power allocation problem. Our simulation results illustrate the performance of the proposed scheme and compare it with various previously developed algorithms as well as with the direct transmission scenario. Index Terms—Highspeed railway communication, moving relays, LTE networks, resource allocation algorithm. I.