Research Article  Open Access
JenJee Chen, ChiWen Luo, ZengYu Chen, "A Novel EnergySaving Resource Allocation Scheme in LTEA Relay Networks", Mobile Information Systems, vol. 2016, Article ID 3696789, 14 pages, 2016. https://doi.org/10.1155/2016/3696789
A Novel EnergySaving Resource Allocation Scheme in LTEA Relay Networks
Abstract
The relay node (RN) in LongTerm EvolutionAdvanced (LTEA) networks is used to enhance the coverage of high data rate and solve the coverage hole problem. Considering the limited energy nature of User Equipment (UE), connecting to the RN instead of Evolved Node B (eNB) is a better choice for celledge UE items. In this paper, on the premise of compatibility to the LTEA resource allocation specification, we discuss an uplink radio resource, uplink path, modulation and coding scheme (MCS), and transmit power allocation problem for energy conservation in LTEA relay networks. The objective is to minimize the total energy consumption of UE items while guaranteeing the constraints of UE items’ quality of service (QoS), biterrorrate (BER), total system resource, and maximum transmit power. Since the problem is NPcomplete and the scheduling period in LTEA is short (the subframe length is only ms), we propose an efficient method to solve the problem. The complexity analysis shows the time complexity of the proposed heuristics is . Simulation results demonstrate that our algorithm can effectively reduce the energy consumption of UE items and guarantee users’ service quality.
1. Introduction
In recent years, the thirdgeneration partnership project (3GPP) has proposed the LongTerm Evolution (LTE) [1] and LTEAdvanced (LTEA) [2] to support mobile and broadband wireless access in cellular systems. In LTE/LTEA, the Orthogonal Frequency Division Multiple Access (OFDMA) is selected as the downlink access technology, which provides high spectrum efficiency, while, in the uplink, the SingleCarrier Frequency Division Multiple Access (SCFDMA) technique is employed to reduce the PeaktoAverage Power Ratio (PAPR). Relay is one of the key features in LTEA [3], where relays can enhance the coverage of high data rates, increase the throughput of celledge users, solve the coverage hole problem, and raise bandwidth utilization by spatial reuse. Two types of relays are introduced in the LTEA. Type I relays act like eNBs to the attached UE items and have their own physical identities. On the contrary, Type II relays are transparent to the UE items and do not have physical identities. Like most wireless networks, energy saving is always an important issue for UE items due to the battery capacity restriction. Deploying relays, celledge UE items are able to save more power by connecting to the eNB via relays.
In this paper, we study the fundamental energy conservation problem in LTEA uplink with Type I relays. We consider an uplink resource, path, MCS, and power allocation problem. The objective is to minimize the total energy consumption of UE items, while guaranteeing their constraints of relay network frame structure, maximum transmit power, BER, and QoS. Low power consumption is particularly important for UE items’ batteries which can extend their lifetime. Today’s wireless networks are characterized by a fixed spectrum assignment policy. Reference [4] shows that the average around 60% of the spectrum remains unutilized. This motivates us to exploit the idle spectrum to decrease the power consumption of UE items and thus increase UE items’ battery lifetime and the spectrum utilization.
In the literature, much work has been done for the uplink resource allocation in LTE/LTEA networks. Reference [5] proposes the optimal SCFDMA resource allocation algorithm based on a pure binaryinteger program to maximize the total userweighted system capacity. Reference [6] presents a set of resource allocation schemes for LTE uplink to achieve the proportional fairness of users while maintaining good system throughput. However, the above studies [5, 6] do not take relays into consideration. For Type I relay networks, [7, 8] show how to achieve a good tradeoff between system throughput and global proportional fairness over inband and outband relay networks, respectively. But, both of them focus on the downlink resource allocation and energy conservation is not the concern. In IEEE 802.16, [9] defines a resource allocation problem which aims at the minimization of energy consumption of UE items. The authors discuss the relationship between the MCSs and the energy consumption of UE. The result shows that the UE can decrease (resp., increase) its power consumption by choosing a lower (resp., higher) level of MCS but spend more (resp., less) physical resources. Reference [10] continues and extends the energyconserved resource allocation problem in IEEE 802.16j. However, both studies [9, 10] are not valid for LTE/LTEA. Reference [11] examines the effect of Physical Resource Block (PRB) allocation on LTE UE’s uplink transmission power and energy consumption. Simulation results show that, for each subframe, to allocate as many PRBs as possible to a single user is more energy efficient than sharing PRBs among several users. In [12], to improve the energy efficiency, user terminals cooperate with each other in transmitting their data packets to the base station (BS) by exploiting multitypes of wireless interfaces. To be specific, when two UE items are close to each other, they first exchange their data with short range communication interfaces. Once the negotiation is done, they share the antennas to transmit their data to BS by employing distributed spacetime coding. Reference [13] proposes two powerefficient resource schedulers for LTE uplink systems subject to rate, delay, contiguous allocation, and maximum transmit power constraints. Reference [14] proposes a green opportunistic and efficient Resource Block (RB) allocation algorithm for LTE uplink networks, which maximizes the system throughput in an energy efficient way subject to users’ QoS requirements and SCFDMA constraints. Reference [15] proposes an energy efficient Medium Access Control (MAC) scheme for multiuser LTE downlink transmission, which utilizes the multiuser gain of the MIMO channel and the multiplexing gain of the multibeam opportunistic beamforming technique. Reference [16] discusses the bufferoverflow and bufferunderflow problems in the LTEA relay network and presents adynamic flow control method to minimize the bufferoverflow and bufferunderflow probabilities. Reference [17] discusses the relay selection, power allocation, and subcarrier assignment problem and proposes a twolevel dual decomposition and subgradient method and two lowcomplexity suboptimal schemes to maximize the system throughput. Reference [18] examines the weighted power minimization problem and jointly optimizes the bandwidth and power usage under constraints on required rate, bandwidth, and transmit power. So far, there is no existing work studying the LTEA relay network uplink energy conservation issue by considering the uplink path determination, radio resource scheduling, and MCS and transmit power allocation at the same time.
In this paper, we propose a novel energysaving resource and power allocation scheme in LTEA relay networks. Our contributions can be summarized as follows. Firstly, to the best of our knowledge, this is the first work to study the energyconserved uplink resource allocation problem in LTEA relay networks. The proposed method schedules and allocates radio resource, uplink path, MCS, and transmit power at the same time. Multiple realistic factors are considered in the paper, such as users’ required data rate and BER, LTEA relay network frame structure and system capacity, and the maximum transmit power constraint. Secondly, we prove the problem to be NPcomplete. This means that it is impossible to conduct the optimal solution for the problem in limited time. Thirdly, a theoretical analysis is done to show that the complexity of the proposed heuristics is . Finally, we conduct a series of simulations to evaluate the performance of the proposed scheme. The simulation results confirm our motivation and show that the proposed method can significantly reduce the overall energy consumption of UE items compared to other schemes, guarantee users’ throughput, and increase only few extra delays (less than ms).
The rest of the paper is organized as follows. Section 2 gives the preliminaries. Section 3 presents our energyconserved uplink resource allocation heuristics. Theoretical complexity analysis is given in Section 4. Simulation results are shown in Section 5. Section 6 concludes the paper.
2. Preliminaries
In this section, we first illustrate and define the system model of LTEA relay networks. Then, the energy cost model used in this paper is described. Finally, we define the energyconserved uplink resource allocation problem in LTEA relay networks and prove it to be NPcomplete [19]. To facilitate the readability, Notations shown at the end of the paper summarizes the notations frequently used throughout the paper.
2.1. System Model
In an LTEA relay network, there is one eNB with fixed relay nodes (RNs) and UE items, as shown in Figure 1. RNs are deployed to help relay data between celledge UE items and eNB to improve the signal quality. There is no direct communication between UE items or RNs. All UE items roam in the eNB’s coverage. We call the UE items transmitting data by eNB “MUE” and the UE items transmitting data by RN “RUE.” Backhaul links, access links, and direct links are the links between the eNB and RNs, RUEs and RNs, and the eNB and MUEs, respectively. In the relay network, the resource allocation unit is consecutive Resource Blocks (RBs) in time domain, called one Transmission Time Interval (TTI). One RB is a twodimensional array ( subcarriers symbols). One TTI with two consecutive RBs is as shown in Figure 2. There are two types of radio frame structures: Time Division Duplex (TDD) mode and Frequency Division Duplex (FDD) mode [20]. In TDD, the radio resource is divided into frames; each is of ms. One frame is composed of subframes of ms each (as shown in Figure 3), and each subframe is divided into two slots. The LTEA allows the resource management to schedule the resource on a subframe basis. In other words, the shortest scheduling period in LTEA is ms. LTEA supports seven different uplinkdownlink configurations for the TDD mode as shown in Table 1. Table 2 [21] shows the subframe configurations for eNBRN (backhaul link) uplink and downlink in LTEA relay networks. We call the subframes configured for eNBRN communication “backhaul subframes,” in which both the eNBRN and eNBMUE communications are allowed. On the contrary, the subframes which are left blank are called “nonbackhaul subframes,” in which the RNRUE and eNBMUE communications are allowed. Note that in this paper, we skip the FDD mode and focus on the TDD mode. Actually, our method can apply on both LTEA TDD and FDD modes.


Figure 4 shows an example which demonstrates how subframes are configured in LTEA relay networks when TDD eNBRN transmission subframe configuration in Table 2 is used. Since configuration adopts uplinkdownlink configuration in Table 1, subframes , , , and are for the uplink and subframes , , , and are for the downlink. In the above subframes, subframes and are for uplink and downlink backhaul subframes, respectively, in configuration . So, in relay networks, the other subframes, that is, subframes , , , , , and , are nonbackhaul subframes. In relay networks, the RNRUE transmission (access link) is only allowed to use the nonbackhaul subframes, while the eNBRN transmission (backhaul link) can only allocate the resource in the backhaul subframes. The eNBMUE transmission (direct link) is able to use both kinds of subframes.
2.2. Energy Model
The energy cost of each , is , where is the transmit power (in mW) of and is the amount of allocated resources (in TTI or symbol time) to . In each schedule, the required physical resource of depends on its MCS, , and the data request, (in bits). can be derived by . In fact, LTEA uses Channel Quality Indicators (CQIs) to report the current channel condition and each , has its corresponding MCS (denoted by ) and rate (denoted by ; the unit is bits/TTI) [22]. Furthermore, for different CQI and different BER (), it requires different SignaltoInterferenceplusNoise Ratio (SINR). Figure 5 shows the required SINR over different for different CQIs [23]. With Figure 5, we can get each ’s required SINR, , accordingly. For the communication pair , the perceived SINR (in dB) of receiver can be written aswhere is the received power at receiver , is the effective bandwidth (in Hz), is the thermal noise level, and is the interference from transmitters other than , which can be evaluated by . Ignoring shadow and fading effect, can be derived bywhere and are the antenna gains at and , respectively, and is the path loss from () to ( or the eNB). To save ’s energy, we can minimize its transmit power subject to the required minimum SINR; that is, using , ’s data can be correctly decoded by receiver with a guaranteed BER only whenConsequently, by integrating (1), (2), and (3), the required transmit power of subject to the applied and requested for the communication pair is
2.3. Problem Definition
The uplink energy conservation problem is defined as below. We assume that, in the LTEA relay network, there is one eNB with fixed RNs and UE items. For each , it has an average uplink traffic demand bits/frame granted by the resource management of the eNB. UE items can uplink data to the eNB either directly or indirectly through RNs. Suppose that the relative distances between eNB/RNs and UE items can be estimated through existing techniques. The objective of the problem is to minimize the total energy consumption of UE items, while guaranteeing their required and traffic demands being all delivered to the eNB subject to the total amount of physical resources and the maximum transmit power constraints. Without loss of generality, we assume that the total amounts of physical resources for backhaul and nonbackhaul subframes are and TTIs per frame, respectively. To solve the problem, we have to determine the uplink path, resource allocation, uplink transmit power , and the used of each .
Theorem 1. The energy conservation problem is NPcomplete.
Proof. To simplify the proof, we consider the case of no spatial reuse in the UERN transmissions and each UE has already selected an appropriate RN according to the channel condition. So, each UE can select an MCS to deliver data to RN and each MCS costs different energy consumption. Thus, the energy cost of one UE item using a specific MCS is uniquely determined. Then, we formulate the uplink resource allocation problem as a decision problem, energyconserved uplink resource allocation decision (EURAD) problem, as below. Given the network topology and the demand of each UE item, we ask whether or not there exists one MCS set such that, with the corresponding selected MCSs, all UE items can conserve the total amount of energy and satisfy each of their demands and the total amount of required RBs is not greater than the frame size . Then, we will show EURAD problem to be NPcomplete.
We first show that the EURAD problem belongs to NP. Given a problem instance and a solution containing the MCS set, it definitely can be verified whether or not the solution is valid in polynomial time. Thus, this part is proved.
We then reduce the multiplechoice knapsack (MCK) problem [24], which is known to be NPcomplete, to the EURAD problem. When the reduction is done, the EURAD problem is proved to be NPcomplete.
Before the reduction, let us briefly introduce the MCK problem first. The MCK problem is a problem in combinatorial optimization: Given a set of disjointed classes of objects, where each class contains objects, for each object , it has a weight and a profit . For each class , one and only one object must be selected, that is, , where when object is picked and chosen; otherwise, . The problem is to determine which objects shall be included in a knapsack to maximize the total object profit and the total weight has to be less than or equal to a given limit and is also called the capacity constraint. So, the MCK problem can be formally formulated as below:To reduce the MCK problem to the EURAD problem, an instance of the MCK problem is constructed as below. Consider that there are disjointed classes of objects, where each class contains objects. In each class , every object has a profit and a weight . Besides, there is a knapsack with capacity of . The MCK problem is no larger than and the total object profit is .
An instance of the EURAD problem is also constructed as follows. Let be the number of UE items. Each has MCSs to its connected eNB/RN. When selects one MCS , it will conserve energy of (which is compared to the energy consumption when uses its best level of MCS) and the system should allocate RB(s) of a total size of to transmit ’s data to the connected eNB/RN. The total frame space is . Our goal is to let all UE items conserve energy of and satisfy their demands. In the following, we will show that the MCK problem has a solution if and only if the EURAD problem has a solution.
Suppose that we have a solution to the EURAD problem, which is one MCS set with UE items’ conserved energy and RB allocations. Each UE item chooses exact one MCS which is able to satisfy its demand. The total size of required RBs cannot exceed and the conserved energy of all UE items is . By viewing the available MCSs of one UE item as a class of objects and the total number of RBs as the capacity of the knapsack, the MCSs in constitute a solution to the MCK problem. This proves the only if part.
Conversely, let be a solution to the MCK problem. Then, for each , we select one MCS such that conserves energy of and the number of allocated RB(s) to transmit ’s data to its connected eNB/RN is . In this way, the conserved energy of all UE items will be and the overall RB is no larger than . This constitutes a solution to the EURAD problem, thus proving the only if part.
3. Proposed Method
This section illustrates our proposed heuristics. The method is composed of two phases. In the first phase, each UE selects an uplink path according to the channel condition and adopts the lowest level of MCS, that is, , for power saving. If the amount of required radio resources of UE items exceeds the system capacity, the second phase is then executed. The second phase exploits spatial reuse (or concurrent transmission) and high level of MCS to increase the radio resource usage efficiency. LTEA relay networks allow multiple UE items to utilize the same radio resource and transmit concurrently to each of their serving RNs in nonbackhaul subframes, called spatial reuse. Both spatial reuse and high level MCSs help the reduction of total required TTIs of the system. In the end, the total amounts of required TTIs must meet the system capacity and , and UE items’ requirements have to be guaranteed.
3.1. Phase I: Initialization and Uplink Path Selection
There are candidate uplink paths for UE items, that is, , . Note that is used to represent the central eNB. Initially, set for each . Then, for each , select the , where , as the uplink path and set . To minimize , each applies . This leads to eNB/RNs must allocate more RBs to UE items. But, in phase I, we omit the total radio resource constraint temporarily. The required amount of TTIs for to deliver data to its connecting can be derived bysubsequently, requires radio resource in backhaul subframes to forward the received data to the eNB. can be conducted bywhere when is ’s uplink path; otherwise, . Then check whether and or not. If yes, terminate the algorithm and return each ’s resource allocation ( and ), uplink path, MCS, and uplink transmit power (refer to (4)). Otherwise, go to phase II for further execution.
3.2. Phase II: EnergySaving Resource Allocation
Phase II is to satisfy UE items’ requests with the least additional energy consumption. To reduce the total amount of required RBs, we first exploit the concurrent transmission. In a concurrent transmission group, , member UE items connect to different eNB/RNs and use the same RBs to deliver data. This reduces the demand of UE items in from to . However, the UE items in the same group will interfere with each other such that the UE items have to spend extra transmit power to guarantee . To minimize the additional power consumption, we have to find interferencefree UE items to form groups. Hence, a weight function () is defined to evaluate UE items in the network. of , can be expressed bywhere , , and are normalized coefficients and , is the spreading factor, denotes the number of times that has been excluded from concurrent transmission groups, and is the normalized coefficient. The values of the three coefficients, , , and , control the relative importance of three factors, path loss, data quantity, and interference, respectively. To form , for each , we choose one ungrouped UE item with the maximum weight in all UE items connecting to , that is, . Then, calculate the required transmission power of each in , where must be able to guarantee . To prevent from selecting the UE items which seriously interfere with others or are interfered with, we will check whether is greater than the energy threshold or not. If yes, it means that some communication pairs suffer great interference from other UE items in . The threshold is set to the summation of the required transmit energy of all UE items in as concurrent transmission is not applied and the same amount of TTIs is consumed as the case of concurrent transmission. If serious interference exists in , the exclusion algorithm will be triggered to remove some UE items from . The detail of the exclusion algorithm will be described later. After all UE items are assigned concurrent transmission groups, if UE items’ requests are still not satisfied, we consider increasing the MCS level of UE items.
For each (assume there are totally concurrent transmission groups and ), we first calculate the energy consumption and required number of RBs of all feasible CQI settings. We define the penalty function to evaluate ’s penalty when changing its CQI setting from a low level to a high level , where and are vectors. The penalty function is defined aswhere and are the amount of energy consumption of using and , respectively, and and are the number of required RBs of by adopting and , respectively. The group with the least penalty is preferred to upgrade its CQIs. Note that uplink resource arrangement has to follow the resource constraints of backhaul and nonbackhaul subframes. The algorithm of phase II is as below. (1)For each , calculate .(2)Set for , , and .(3)For each , choose the , where , and set .(4)Calculate for each (refer to (4)). If , go to the next step; otherwise, execute the exclusion algorithm to remove the most infeasible UE from (assume it is ). Then set and update and . Repeat step (4).(5)If , update and . Set for and . If and , terminate the algorithm and return the result of resource allocation, grouping, uplink path, MCS configuration, and uplink transmit power. If , go back to step (3); otherwise, go to the next step.(6)For each group , form the MCS configuration pattern matrix , where and is one of feasible MCS configuration patterns for . Then, calculate the energy consumption and the number of required RBs for each . Note that, without loss of generality, we assume that and (how to efficiently form the feasible MCS configuration patterns for is discussed in Section 3.4).(7)For each , calculate the penalties from to all possible MCS configuration .(8)First, consider the set of groups which can only be assigned resource in , that is, . For all groups in , select the minimum and then change ’s MCS configuration from to , update ’s required physical resource and transmit power, and recalculate its penalties from to . Check whether new or not. If yes, go to the next step; otherwise, repeat step (8).(9)In this step, we consider satisfying the constraint. The operation is the same as the previous step but we set . Each time after changing a group’s MCS configuration (assume it is group ), check whether new or not. If yes, stop the algorithm and return each ’s, , resource allocation, grouping result, uplink path, MCS, and transmit power; otherwise, repeat step (9).
3.3. Exclusion Algorithm
When , it represents that some UE items in cause severe interference with other concurrent transmission pairs in the group. We use Figure 6 to explain this. Assume that , , , and are in a concurrent transmission group and (i.e., eNB), , , and are their serving base stations, respectively. Take and its serving base station , for example; Figures 6(a) and 6(b) show the received interference and transmit interference, respectively. As shown in Figure 6(a), for and , the received interference . On the other hand, the transmit interference generated by the transmission pair () can be calculated by . Sum up and ; we then derive the total interference of the transmission pair ().
(a) Received interference for ()
(b) Transmit interference from
When occurs, we must exclude the UE, which causes severe interference, from to increase the energy efficiency. The detail is as follows:(1)Without loss of generality, for the UE items in , we reindex them as , and denote the set of their uplink eNB/RNs by . Next, for each and its corresponding , calculate the received interference by Then, for each , calculate the transmit interference as follows:(2)For each , calculate .(3)From all derived in the previous step, select the maximum one and exclude the pair from .
3.4. Listing All Feasible MCS Configuration Patterns for
For each , the number of possible MCS configurations is . Listing and trying all the configurations will have a tremendous cost. Actually, for a group , only combinations out of (even less) need to be considered. Let us discuss this. Consider a group, , and one of its MCS configurations, ; assume that applying would consume resource ; that is, requires the largest number of RBs in as is used. In this case, enhancing any UE’s MCS other than in does not reduce the amount of required radio resources but only increases the energy consumption of . This means that MCS configurations do not have to be taken into account. In other words, each time, only the UE with the largest amount of required RBs has to be considered. In this way, we can greatly reduce the computing complexity. The detailed procedure of listing all feasible MCS configuration patterns for a concurrent transmission group is stated as below.(1)For a group , initialize all member UE items’ MCS level to . Calculate each of their required amounts of RBs and the total amount of energy consumption. Set and .(2)Select the UE with the largest amount of required RBs in . If there is a tie, randomly select one. If the selected UE’s MCS level is or the required amount of TTIs is one, then go to step (3); if not, increase its CQI by one, set , calculate ’s new total amount of required RBs and total energy consumption, and record this candidate MCS configuration pattern . Then, repeat step (2).(3)Check the recorded MCS configuration patterns in steps (1) and (2). If there is more than 1 pattern requiring the same amount of RBs, only reserve the one with the least total energy consumption.
By the above listing method, for each group , the total number of feasible MCS configuration patterns, , would be less than and even less, which is a significant improvement compared to .
Theorem 2. For each concurrent transmission group , the amount of feasible MCS configuration patterns .
4. Complexity Analysis
In this section, we analyze the complexity of the proposed method. Assume there are RNs and UE items and the worst case analysis will be illustrated. The whole method can be divided into two parts. The first part includes the uplink path selection and grouping algorithm, while the second part deals with MCS level reselection. The two parts will be analyzed separately first. In the end, we sum up the complexities of the two parts.
Part I Analysis. For each UE item, calculate channel conditions for RNs and the eNB and then select the best one from candidate base stations which will costFor the spatial reuse group formulation, we first calculate the weight of each UE item and this costs . Then, select one UE item with the maximum weight from each . Assume that for each , there are UE items connecting to it and . So, selecting UE items to form group costsCalculate the transmit powers of UE items in a group cost at mostCalculate and determine whether a group shall exclude UE items or not which needsIf the result is to exclude some UE (UE items) from the group, execute the exclusion algorithm. In the exclusion algorithm, we first find out the UE which has to be excluded. Calculate the transmit interference and received interference of a UE cost . Then, for a group of UE items, the total complexity isTo find out the UE with the maximum total interference costsAfter exclusion, we have to update the transmit powers of UE items in the group and check whether the exclusion is needed or not. Consider the worst case that the exclusion will be repeatedly executed until there is only one UE item remaining in the group. Then, the complexity for finding a spatial reuse group iswhere is the summation of (14), (15), (16), and (17). In a worst case, we will form at most single member groups and the complexity isThe first is the complexity of updating weights after each time grouping a group. The second is the complexity of selecting UE items out of UE items to form a group. The third is the complexity of (18).
Therefore, the complexity of Part I isby summing (12) and (19) up.
Part II Analysis. For each group , at most CQI combinations have to be listed. For each group, this costs . Because , the total complexity of listing all CQI combinations can be expressed asThen, calculate the penalty table for each group. This involves the transmit power and consumed energy calculation. So the complexity of calculating the penalty table for a group isThe upper bound of (22) is when the group size . For groups, the total complexity is . Selecting the minimum penalty costs . For the selected group, we enhance the CQI and then update the penalty table of the selected group. The updating cost is .
Above MCS level reselection will be repeated until the total number of required resources of UE items is less than or equal to the total system bandwidth. For the worst case, all UE items have to be upgraded to the highest level of CQI to meet the requirement. In this case, the preceding steps must be executed times. An alternative way to evaluate the execution time is as below. Assume that the total number of required resources is , where is the largest amount of required TTIs of group when is used. For each time we upgrade the CQI of a group, at least TTI can be reduced from the number of total required resources. So, MCS reselection must be executed at most times. Therefore, the execution time of MCS reselection can be expressed asSo the total complexity of Part II is
Combining Part I (20) and Part II (24), the total complexity is Consider that is usually a finite constant, so the complexity of the proposed method is .
5. Simulation Results
We develop a simulator in MATLAB to verify the effectiveness of our heuristics. The system parameters in the simulation are listed in Table 3 [3]. We consider three types of traffic: audio, video, and data [25]. Two traffic cases are applied in the simulation. Traffic Case is mixed traffic, where each UE item executes an audio, video, or data flow with equal probability. On the other hand, Traffic Case only contains audio traffic. The network contains one eNB and six RNs (). RNs are uniformly deployed inside the coverage range of the eNB to get the best performance gain. In default, we set the factors , , and to to get the best performance and adopt TDD mode uplinkdownlink configuration ; that is, there are uplink subframes per frame. The ratio of uplink backhaul subframe and uplink nonbackhaul subframe is 1 : 3. We compare the performances of four methods: (1) OEA (Opportunistic and Efficient RB Allocation) [14], (2) EPAR (Equal Power Allocation with Refinement) [17], (3) our proposed scheme without relay nodes, and (4) our proposed scheme.

Figures 7(a) and 7(b) evaluate the total energy consumption of UE items under different number of UE items () when Traffic Cases and are applied, respectively. Both figures show that as increases, the total amount of energy consumption of UE items increases for all methods. OEA consumes the most energy because UE items always connect to the eNB and select the most efficient MCS for transmission. EPAR performs better than OEA because celledge UE items can choose to connect with RNs instead of the eNB and this reduces the energy consumption. With our energysaving resource allocation method, the proposed scheme (w/o relay) performs the second. Results show that our proposed scheme performs the best in all methods. This means that spatial reuse and RNs do help the reduction of total energy consumption of UE items. In Figure 7(b), our heuristics still performs the best compared to the other 3 methods. Obviously, the spatial reuse and energysaving resource allocation do help to conserve UE items’ energy. One interesting thing is that when is large, EPAR and the proposed scheme (w/o relay) consume almost the same energy. This is because relay improves the SINR of celledge users, thus reducing the energy consumption of edge users.
(a) Traffic Case
(b) Traffic Case
Figures 8(a) and 8(b) evaluate the bandwidth utilization under different number of UE items for Traffic Cases and , respectively. OEA and EPAR always pursue the most efficient MCS. When the traffic load is light, the bandwidth utilization hurts and results in much idle bandwidth. On the other hand, the proposed scheme and proposed scheme w/o relay get the best bandwidth utilization in all four methods. The results show that our proposed methods can improve the bandwidth utilization and save more energy for UE items.
(a) Traffic Case
(b) Traffic Case
Figures 9(a) and 9(b) show the impact of on the throughput for Traffic Cases and , respectively. As shown in the figures, as increases, the throughput of all schemes increases. We can see that the proposed methods can guarantee all the traffic demand being served like OEA and EPAR. This means that when the network load is light, our schemes can well utilize the idle bandwidth to reduce UE items’ uplink transmit power. On the contrary, when the network load is heavy, our schemes will select efficient MCS for UE items to reduce each of their required physical radio resources such that the admitted data rates of UE items can still be satisfied. So, our proposed schemes can not only provide similar throughput like OEA and EPAR, but also save UE items’ energy.
(a) Traffic Case
(b) Traffic Case
Figure 10 shows the average extra data transmission delay of the proposed schemes and EPAR against OEA. Compared to OEA, EPAR causes a longer delay because RUEs have to deliver their data to the eNB via RNs. But in OEA, UE items directly transmit their data to the eNB. The proposed schemes have a longer delay compared to both OEA and EPAR because they utilize more physical resources to deliver data, thus resulting in more extra data packet buffering delay. As increases, the result shows that the extra delay does not always increase (when ) but decreases after is more than . This is because OEA needs more time to deliver users’ data when traffic load is heavy, but the proposed schemes consume the same time and upgrade UE items’ MCS level instead. Our proposed methods slightly increase the delay of data transmission, but the average extra delay is no more than ms as shown in Figure 10. It should be acceptable.
In Figure 11, we discuss the effect of subframe configuration on the total energy consumption of UE items. In the TDD mode LTEA relay network, it supports four kinds of uplink nonbackhaul and backhaul subframe configurations: (1) uplink nonbackhaul subframe and uplink backhaul subframe per frame (1a : 1b), (2) uplink nonbackhaul subframes and uplink backhaul subframe per frame (2a : 1b), (3) uplink nonbackhaul subframes and uplink backhaul subframes per frame (2a : 2b), and (4) uplink nonbackhaul subframes and uplink backhaul subframe per frame (3a : 1b). As shown in Figure 11, no matter which subframe configurations are used, our method always gets the best power saving in all schemes. For OEA and EPAR, the performances are almost the same for all four kinds of subframe configurations. This is because they always use the most efficient MCS no matter whether the uplink radio resources are many or few. The proposed schemes reduce the energy consumption of UE items by well utilizing the idle radio resource. Therefore, the result shows that the total energy consumption of UE items decreases in the proposed methods as the number of uplink subframe increases (number of uplink subframes per frame is increased from (1a : 1b) to (2a : 2b or 3a : 1b)). When the network has more radio resources, UE items can choose to use lower level of MCS to transmit data and save energy. Comparing subframe configurations 2a : 2b and 3a : 1b, Figure 11 shows that the latter can conserve more energy. The higher number of nonbackhaul subframes means there are more resources that can be used by MUEs and RUEs, but the backhaul subframe can only be utilized by MUEs. Obviously, the former provides more flexibility. This is why subframe configuration 3a : 1b conducts better energy saving than that of 2a : 2b.
In Figure 12, Traffic Case is applied to evaluate the effect of subframe configuration on the total energy consumption of UE items. The proposed scheme performs the best in all schemes. Compared to the previous experiment as shown in Figure 11, Figure 12 shows that the performance differences among all four schemes become smaller. This is because, in Traffic Case , the data size is small compared to the number of radio resources provided in one single TTI; then in our implementation, OEA and EPAR will automatically apply a low level MCS to fill up the whole space of assigned radio resource. This is why we see a closer performance among the four schemes.
Then, Figure 13 evaluates the total energy consumption of UE items over different ratio of . Figure 13 presents that as increases, the total energy consumption decreases when . This means that factor (path loss factor) and factor (data size factor) of (8) have equal importance for weight . When choosing the reuse group, the distance between a UE item and the connected RN and the size of the data request are both significant factors for energy conservation.
Figure 14 shows the total energy consumption over different , where we set . It can be seen that the total energy consumption performs the worst when . This means that does help the selection of spatial reuse groups. With a nonzero , we can filter out unsuitable UE items when forming reuse groups.
6. Conclusion
In this paper, we investigate the energy conservation issue of the uplink path, uplink radio resource, MCS, and mobile device transmit power allocation in LTEA relay networks. We have proposed heuristics to conserve UE items’ energy by exploiting RNs, MCS, BER, transmit power, and spatial reuse. To save energy, the key factors are how to determine the most energysaving MCS of UE items and how to select interferencefree spatial reuse groups. To find the best settings, we have defined the weight and penalty functions for evaluation. Simulation results show that our scheme can significantly reduce the total energy consumption of UE items compared to other schemes and has good bandwidth utilization. Compared with OEA and EPAR schemes, our proposed energysaving resource allocation method will slightly increase the delay of data, but the extra delay is less than one frame (no more than ms). Users’ required QoS, BER, and throughput can all be guaranteed.
Notations
Number of UE items  
Number of RNs  
The total amount of TTIs for uplink backhaul subframes per frame  
The total amount of TTIs for uplink nonbackhaul subframes per frame  
The transmit power of  
The energy cost of  
The uplink traffic demand of per frame  
The amount of required TTIs for to deliver data to its connected RN  
The amount of required TTIs for ’s connected RN to deliver data to the eNB  
The weight of  
The concurrent transmission group  
Energy threshold of  
Total amount of energy consumption of when using CQI  
Total amount of required uplink TTIs for when using CQI  
Transmit interference for the transmission pair  
Received interference for the transmission pair  
The distance between and  
Number of exclusion times of  
The code rate when using CQI (in bits/TTI)  
The corresponding MCS when using CQI  
Effective bandwidth (in Hz)  
Thermal noise  
Antenna gain of node  
The received power from transmitter to receiver  
The interference to receiver from transmitters other than  
The path loss from transmitter to receiver . 
Competing Interests
The authors declare that they have no competing interests.
Acknowledgments
This research is sponsored by MOST 1042221E024005.
References
 D. Astély, E. Dahlman, A. Furuskär, Y. Jading, M. Lindström, and S. Parkvall, “LTE: the evolution of mobile broadband,” IEEE Communications Magazine, vol. 47, no. 4, pp. 44–51, 2009. View at: Publisher Site  Google Scholar
 3GPP TR 36.913 v12.0.0, “Requirements for further advancements for EUTRA (LTEAdvanced),” September 2014. View at: Google Scholar
 3GPP, “Further advancements for EUTRA physical layer aspects,” 3GPP TR 36.814 v9.0.0, 2010. View at: Google Scholar
 P. K. Dalela, A. Nayak, V. Tyagi, and K. Sridhara, “Analysis of spectrum utilization for existing cellular technologies in context to cognitive radio,” in Proceedings of the 2nd International Conference on Computer and Communication Technology (ICCCT '11), pp. 585–588, Allahabad, India, September 2011. View at: Publisher Site  Google Scholar
 I. C. Wong, O. Oteri, and W. McCoy, “Optimal resource allocation in uplink SCFDMA systems,” IEEE Transactions on Wireless Communications, vol. 8, no. 5, pp. 2161–2165, 2009. View at: Publisher Site  Google Scholar
 S.B. Lee, I. Pefkianakis, A. Meyerson, S. Xu, and S. Lu, “Proportional fair frequencydomain packet scheduling for 3GPP LTE uplink,” in Proceedings of the 28th Conference on Computer Communications (IEEE INFOCOM '09), pp. 2611–2615, IEEE, Rio de Janeiro, Brazil, April 2009. View at: Publisher Site  Google Scholar
 Z. Ma, W. Xiang, H. Long, and W. Wang, “Proportional fair resource partition for LTEadvanced networks with type I relay nodes,” in Proceedings of the IEEE International Conference on Communications (ICC '11), pp. 1–5, Kyoto, Japan, June 2011. View at: Publisher Site  Google Scholar
 G. Liebl, T. M. de Moraes, A. Soysal, and E. Seidel, “Fair resource allocation for the relay backhaul link in LTEAdvanced,” in Proceedings of the EEE Wireless Communications and Networking Conference (WCNC '12), pp. 1196–1201, Shanghai, China, April 2012. View at: Publisher Site  Google Scholar
 J.P. Yoon, W.J. Kim, J.Y. Baek, and Y.J. Suh, “Efficient uplink resource allocation for power saving in IEEE 802.16 OFDMA systems,” in Proceedings of the IEEE 67th Vehicular Technology Conference (VTC Spring '08), pp. 2167–2171, Singapore, May 2008. View at: Publisher Site  Google Scholar
 J.M. Liang, Y.C. Wang, J.J. Chen, J.H. Liu, and Y.C. Tseng, “Energyefficient uplink resource allocation for IEEE 802.16j transparentrelay networks,” Computer Networks, vol. 55, no. 16, pp. 3705–3720, 2011. View at: Publisher Site  Google Scholar
 M. Lauridsen, A. R. Jensen, and P. Mogensen, “Reducing LTE uplink transmission energy by allocating resources,” in Proceedings of the IEEE 74th Vehicular Technology Conference (VTC Fall '11), pp. 1–5, September 2011. View at: Publisher Site  Google Scholar
 Y. Zou, J. Zhu, and B. Y. Zheng, “Energy efficiency of network cooperation for cellular uplink transmissions,” in Proceedings of the IEEE International Conference on Communications (ICC '13), pp. 4394–4398, IEEE, Budapest, Hungary, June 2013. View at: Publisher Site  Google Scholar
 M. Kalil, A. Shami, and A. AlDweik, “QoSaware powerefficient scheduler for LTE uplink,” IEEE Transactions on Mobile Computing, vol. 14, no. 8, pp. 1672–1685, 2015. View at: Publisher Site  Google Scholar
 F. Z. Kaddour, E. Vivier, L. Mroueh, M. Pischella, and P. Martins, “Green opportunistic and efficient resource block allocation algorithm for LTE uplink networks,” IEEE Transactions on Vehicular Technology, vol. 64, no. 10, pp. 4537–4550, 2015. View at: Publisher Site  Google Scholar
 R. Imran, M. Shukair, N. Zorba, O. Kubbar, and C. Verikoukis, “A novel energy saving MIMO mechanism in LTE systems,” in Proceedings of the IEEE International Conference on Communications (ICC '13), pp. 2449–2453, Budapest, Hungary, June 2013. View at: Publisher Site  Google Scholar
 P.C. Lin, R.G. Cheng, and Y.J. Chang, “A dynamic flow control algorithm for LTEadvanced relay networks,” IEEE Transactions on Vehicular Technology, vol. 63, no. 1, pp. 334–343, 2014. View at: Publisher Site  Google Scholar
 M. S. Alam, J. W. Mark, and X. S. Shen, “Relay selection and resource allocation for multiuser cooperative OFDMA networks,” IEEE Transactions on Wireless Communications, vol. 12, no. 5, pp. 2193–2205, 2013. View at: Publisher Site  Google Scholar
 N. Krishnan, R. D. Yates, N. B. Mandayam, and J. S. Panchal, “Bandwidth sharing for relaying in cellular systems,” IEEE Transactions on Wireless Communications, vol. 11, no. 1, pp. 117–129, 2012. View at: Publisher Site  Google Scholar
 T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, MIT Press, Cambridge, Mass, USA, 3rd edition, 2009. View at: MathSciNet
 3GPP, “Physical channels and modulation,” 3GPP TS 36.211 v13.0.0, 2015. View at: Google Scholar
 3GPP TS 36.216 v13.0.0, “Physical layer for relaying operation,” December 2015. View at: Google Scholar
 3GPP, “EUTRA; physical layer procedures,” 3GPP TS 36.213 v12.0.0, 2013. View at: Google Scholar
 J. Blumenstein, J. Ikuno, J. C. Prokopec, and M. Rupp, “Simulating the long term evolution uplink physical layer,” in Proceedings of the ELMAR, pp. 141–144, IEEE, Zadar, Croatia, September 2011. View at: Google Scholar
 H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, Berlin, Germany, 2004. View at: Publisher Site  MathSciNet
 3GPP, “Services and service capabilities,” 3GPP TS 22.105 v10.0.0, 2011. View at: Google Scholar
Copyright
Copyright © 2016 JenJee Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.