- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2013 (2013), Article ID 517846, 19 pages

http://dx.doi.org/10.1155/2013/517846

## Minimum-Cost QoS-Constrained Deployment and Routing Policies for Wireless Relay Networks

^{1}Department of Information Management, National Taiwan University, No. 1 Section 4, Roosevelt Road, Taipei 106, Taiwan^{2}Department of Information Management, National Taipei University of Nursing & Health Sciences, No. 365, Ming Te Road, Taipei 112, Taiwan

Received 13 April 2013; Accepted 7 July 2013

Academic Editor: Chih-Hao Lin

Copyright © 2013 Frank Yeong-Sung Lin 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.

#### Abstract

With the continued evolution of wireless communication technology, relaying is one of the features proposed for the 4G LTE Advanced (LTE-A) system. The aim of relaying is to enhance both coverage and capacity. The idea of relays is not new, but relaying is being considered to ensure that the optimum performance is achieved to enable the expectations or good quality of service (QoS) of the users to be met while still keeping capital expenditure (CAPEX) within the budgeted bounds of operators. In this paper, we try to stand for an operator to propose a solution that determines where and how many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a multicast tree routing algorithm to both determine and fulfill the QoS requirements to enhance throughput, but we also utilize the Lagrangian relaxation (LR) method in conjunction with optimization-based heuristics and conduct computational experiments to evaluate the performance. Our contribution is utilizing the LR method to propose an optimal solution to minimize the CAPEX of operators to build up a relay network with more efficiency and effectiveness and the QoS can be guaranteed by service level agreement.

#### 1. Introduction

Providing a guaranteed service and good performance with budgets constraint is always an optimization problem of operators and vendors. During the last decade, this problem has however become much more difficult, because the traffic has grown significantly and demand for broadband data services is expected to increase tremendously [1]. The business challenges of operators would be that increasing revenues will have to come from nonvoice services which means they have to increase total communication market shares with extending service coverage and offering good service by capacity expansion as well as increased bandwidth and improved quality of services (QoSs) [2]. But building out of the macronetworks significantly will require huge investments, especially where access would otherwise be limited or unavailable without the need for expensive cellular towers. So, the operators may plan to compensate with new revenues and cost reduction at the same time. The aim of this paper is related to the relays should be deployed strategies to investigate how the relays are suitable for providing good services by minimize operator capital expenditure (CAPEX) significantly [3].

In the ongoing standardization technology development by third-Generation Partnership Project (3GPP), relaying is one of the features proposed for the LTE Advanced (LTE-A) system [4–8]. The aim of LTE-A relaying is to enhance both coverage and capacity. However, this idea of relays is not new, but the LTE-A relaying is being considered to ensure that the optimum performance is achieved to enable the expectations of the users to be met while still keeping CAPEX within the budgeted bounds. As cell edge performance is becoming more critical, with some of the technologies being pushed towards their limits, it is necessary to look at solutions that will enhance performance at the cell edge for a comparatively low cost. One solution that is being investigated and proposed is that of the use of relays [9–11].

In order for the cellular telecommunications technology to be able to keep pace with technologies that may compete, it is necessary to ensure that new cellular technologies are being formulated and developed. But there are many realistic conditions influencing operators including the tough economic environment, declining budgets, limited resources, time pressures, and high user expectations.

This paper proposes a solution approach for relay network planning of where to build relays, and how to configure each relay, how the routing algorithm of relays and mobile stations is worked properly. This research can be divided into two parts. First, we constructed the relay network architecture with multicast tree routing concepts. Secondly, we proposed a precise mathematical expression to model this network and developed algorithms based on Lagrangian Relaxation Method to solve this problem. These model approaches might nevertheless be regarded as useful engineering guidelines for operators to build up a good network to extend services and reduce CAPEX efficiently and effectively.

This paper is organized as follows. Section 2 is Literature Survey, and then we introduce a mathematical formulation for the wireless relay networks design problem in Section 3. In Section 4, we present the solution approach by using Lagrangian Relaxation, in which heuristics for calculating a good primal feasible solution are developed, and conduct computational experiments. In Section 5, we conclude and discuss the direction of future research.

#### 2. Literature Survey

Multihop Wireless Networking has been widely studied and implemented throughout ad hoc networks and mesh networks to exploit the user diversity concept and improve overall performance. The original concept of general relaying problems was defined in [12, 13] and was inspired by the development of the ALOHA system at the University of Hawaii. Based on this concept, a relay network can be designed as a tree-based topology with one end of the path being the base station (BS) relaying multiple connections to provide services and improve the coverage.

Relay stations (RSs) have some characteristics or cost efficiency for the following reasons.(1)The transmission range is much less than a BS, meaning that the transmit power is also less than that of a BS. Relays are generally cheaper than BS, meaning reduced costs without site survey and easy to construct relays in the place which is not suitable to build a base station tower.(2)Relays do not have a wired connection to the backhaul. Instead, they receive signals from the BS and retransmit to destination users wirelessly and vice versa. The leases of wired broadband backhauls can be saved. (3)Relaying techniques have the dual advantages of performance improvement and coverage extension at the cell edge. These could feasibly be a deployment solution for the high-frequency band in which propagation is significantly more vulnerable to nonline-of-sight (NLOS) conditions to overcome shadowing [14].

Coordinated multipoint (CoMP) is a relatively new class of spatial diversity techniques that are enabled by relaying [15, 16] and cooperative communications which is shown in Figure 1 [17, 18]. This concept has been the focus of many studies by 3GPP for LTE-A as well as the IEEE for the WiMAX, 802.16 standards. But still no conclusion about CoMP has been reached regarding the full implementation, because CoMP has not been included in Rel.10 of the 3GPP standards. As the work is ongoing, CoMP is likely to reach a greater level of consensus; when this occurs, it will be included in future releases of the standards.

CoMP is a complex set of techniques which are distributed radios that jointly transmit information in wireless environments. The main purpose may be improved for the reliability of communications in terms of coverage extension, reduced outage probability, symbol-error, or bit-error probability for a given transmission rate [19–21]. It brings many advantages to the user as well as the network operator as follows. (1)It makes better utilization of network: by providing connections to several BSs or RSs at once, using CoMP, data can be passed through least loaded BS or RS for better resource utilization.(2)It provides enhanced reception performance: using several sources cooperative BSs or RSs for each connection means that overall reception will be improved and the number of dropped calls should be reduced.(3)Multiple site reception increases received power: the joint reception from multiple BSs or RSs using CoMP techniques enables the overall received power at the handset to be increased.

When building a relay wireless network in a metropolis, various factors influence the design such as QoS requirements, throughput requirements, and total cost. The objective of our research is “to minimize the total building costs subject to QoS and throughput requirements.” Nonetheless, this objective is obviously a tradeoff because total building costs will increase if the QoS and throughput requirements increase. Based on this conventional tradeoff, we take multipath routing algorithms into consideration to solve the critical problem [22, 23].

The purpose of this research is different from that of conventional network design problems. The assumptions are that multiple source nodes jointly transmit one single source of information if the signal strength is not robust enough in the link between one source node to the destination. The routing policy is no longer a single path but a more complex and interesting multipath algorithms.

#### 3. Problem Formulation

##### 3.1. Problem Description

A sequence of the wireless relay network design may be described as fellows. First, the location of each BS could be determined by site survey and how many BSs can cover the service area. Second, the set of BSs roughly divide the entire network into several subnetworks, each of which is rooted by one BS connected to the core network which is shown in Figure 2. Meanwhile, there are many candidate locations suitable for the deployment of relays. The decision of deploying a relay at a specific location depends on the users surrounding the location; once a location is selected, the relay must associate with one of the BSs mentioned previously. So that total costs will depend on where relays are developed and how many relays should be developed of the network. But there is another important factor that should be considered by how to provide a good QoS of users at the stage of the network design. This problem may be solved by designing a mechanism or routing algorithm through which users can reach the suitable relays or BSs which can serve users well. In our work, we introduce the multicast tree-based routing algorithm (MTBR) to apply the multipath concept, as represented later.

Figure 2 illustrates the entire network design: the triangles represent the BSs; the cell phones represent the mobile stations (MSs); the circles with solid line represent the relay stations being built on the selected locations; and the circles with dotted line represent the locations not selected to build RSs. The whole area is divided into several subnetworks and rooted at associated BSs. If a subnetwork is concerned that each OD pair, like the BS-to-MS, can be expressed in Figure 3, transmits through the routing multicast tree to the associated BS. In DL transmission, data is multicasted from BS to the RSs selected by the MS, and cooperatively relayed to the destination MS to achieve the spatial diversity gains through CoMP techniques. The same routing multicast tree in UL is represented in Figure 4, in which the aggregation of traffic from the MS can overcome the weak signal strength when the MS is far from the BS or RSs. Because the channels, bandwidth, and even transmission power are different between DL and UL, the DL tree and UL tree of an MS may be different. In this paper, we derive a near optimal RSs development policy to minimize total development costs; we also maintain both DL and UL spanning trees and use the MTBR to ensure that BER and data rate requirements of each MS are satisfied.

##### 3.2. Mathematical Modeling

*Assumption*(i)The relaying protocol in this model is *Decode-and-Forward*.(ii)Once a location is selected to build an RS, it must home to one BS.(iii)Each MS must home to either a BS or RS(s).(iv)The RSs selected by an MS must associate with the same BS.(v)The routing path of each OD pair in DL (UL) is a multicast tree.(vi)The capacity of a link is decided by adaptive modulation with respect to the signal-to-noise ratio (SNR) received at node .(vii)The spatial diversity gains are represented by the aggregate SNR with CoMP techniques.(viii)The bit error rate (BER) of a transmission is measured by the receiving SNR value(ix)The aggregate BER of the destination is the summation of BER of each node on the routing multicast tree.(x)The numbers of links of each path adopted by each MS are assumed to be equal to ensure that the CoMP can be achieved within limited delay.(xi)Error corrections and retransmissions are not considered in this problem.

*Given*(i)The set of BSs, candidate locations and configurations of RSs, MSs,(ii)required data rate of an MS in DL and UL,(iii)fixed and configured cost of an RS,(iv)the set of all spanning trees, paths,(v)distance of each link,(vi)attenuation factor,(vii)thermal noise function,(viii)transmit power of BS, RS, and MS,(ix)sNR function,(x)the minimum SNR requirement for an MS in DL and UL to home to a BS or an RS,(xi)the maximum BER threshold of a OD pair transmission in DL and UL,(xii)nodal and link capacity functions,(xiii)the maximum spatial diversity of an MS in DL and UL.

*Objective*. To minimize the total cost of wireless relay network deployment.

*Subject to*(i)RS selection constraints,(ii)nodal capacity constraints,(iii)cooperative relaying constraints in DL and UL,(iv)routing constraints in DL and UL,(v)link capacity constraints in DL and UL.

*To Determine*(i)Whether or not a location should be selected to build an RS,(ii)the cooperative RSs of each MS,(iii)the routing paths of an OD pair (a BS to an MS or contrary), which form a multicast tree from the BS to the cooperative RSs selected by each MS.

*Objective Function*

*Subject to*

*Relay Selection Constraints*

*Nodal Capacity Constraints*

*Cooperative Relay Constraints*

*Routing Constraints*

*Link Capacity Constraints*

*Integer Constraints*

*Explanation of Objective Function*. The objective function is to minimize the total cost of RSs deployment: (1) Fix costs of RS such as land acquisition and hardware purchases; (2) The configured costs of each RS. The detail parameters in the formulation are noted and shown in Tables 1 and 2.

*Explanation of Constraint*

*(1) Relay Assignment Constraints.* Constraint (1) requires that each location is selected to install an RS with exactly only one configuration or none.

Constraint (2) requires that each RS can associate with one BS or none in direction .

Constraint (3) indicates that once an RS associates with a BS, must be built.

*(2) Nodal Capacity Constraints.* Constraint (4) requires that each RS’s total amount of traffic in DL and UL cannot be greater than its nodal capacity.

Constraint (5) requires that each BS’s total amount of traffic in DL and UL cannot be greater than its nodal capacity.

*(3) Cooperative Relay Constraints.* Each MC will select an RS in direction only if is installed in (6).

An MC must select either one BS or RS(s) in direction in (7).

Constraints (8) and (9) represent the boundaries of the number of cooperative RSs an MC can select.

The minimum SNR constraints for an MC to receive from a BS or an RS in DL, and for an MC to transmit to a BS or an RS in UL, are expressed in (10) and (11), respectively.

Constraint (12) requires that the SNR value received by an MC in DL cannot exceed the summation of the SNR values receives from the cooperative RSs selected by .

Constraint (13) represents the boundaries of decision variable .

Once MC selects RS (or BS) to be its cooperative RS, the SNR value on link cannot exceed the SNR transmitted from source node to destination node in DL and UL in constraints (14) and (15).

The minimum SNR constraint for a link selected by MC is expressed in (16), while .

Constraint (17) requires that the SNR value received by an RS (or BS) in UL cannot exceed the summation of the SNR values on the link selected by MC .

Constraint (18) represents the boundaries of decision variable .

Once MC selects a link in direction , the SNR value on cannot exceed the SNR transmitted from to in (19).

The aggregative BERs constraints for DL in MC and UL in BS are expressed in (20) and (21), respectively.

*(4) Routing Constraints.* Constraint (22) requires that once RS is selected by MC , must associate with one BS in direction .

Constraint (23) requires that once RS associates with BS in direction , the paths from to must be selected by one or more than one MC.

Constraint (24) requires that there is exactly one path to be selected by an MC from the associated BS to RS only if the MC selects RS in direction .

There are two constructions in (24): first, every two RSs selected by an MC must associate with the same BS; second, the numbers of links of every two paths selected by an MC must be the same.

For each MC, every receiving RS on a link in DL is installed in (26) and every transmitting RS on a link in UL is installed in (27).

Constraint (28) requires that, if link is on the path adopted by the MC to reach RS in direction , then must be 1.

*(5) Link Capacity Constraints.* The aggregate flow of link in direction is restricted in (29).

*(6) Integer Constraint.* Constraints (30) are integer properties of the decision variables.

#### 4. Solution Approach and Computational Experiments

##### 4.1. Lagrangian Relaxation Techniques

By applying the Lagrangian Relaxation (LR) Method and the Subgradient Method to solve the complex problem, based on the problem formulation mentioned previously, the first step would be that the constraints of the primal problem are relaxed by using the LR Method [26]. In this step, we can not only determine a theoretical lower bound of the primal problem, but, can also glean some hints of feasible solutions captured by the primal problems. After iterations, the end result of the Lagrangian Relaxation Problem is guaranteed to a feasible solution by a feasible step which is satisfied with all constraints of the primal problem, if not, we have to make some modifications.

##### 4.2. Getting Primal Feasible Heuristics

To obtain the primal feasible solutions for , the first step is considered the solutions to the Lagrangian Relaxation. Two major decision variables, and are taken into consideration. According to , the RS(s) (or BS) can be obtained to serve MS selected in direction, and represents the link which selected on the routing multicast tree in direction. In addition to and , for the complexity of this problem including five 0-1 integer decision variables, we still need other clues to help solving this problem in good quality. Thus, the coefficient of in DL, namely, ; of in UL, namely, is introduced in our solution to sort for further calculations.

The main purpose of determining the primal feasible heuristic is, in both DL and UL directions, and for each MS sorted by the distance to BS, to fully utilize the RSs built already to meet the BER requirement, and if not, to at least minimize the number of RSs necessary to reach the previous goal. The detailed procedure that decomposites the Lagrangian Relaxation Problem into several subproblems is described in the appendix.

##### 4.3. Experiments Environment

In this session, we conduct several computational experiments to justify the proposed algorithms. Due to limitation of available experiment scenarios and parameters, we focus on IEEE 802.16j instead of LTE-A; it is easier to build the network based on realistic and operable environment parameters. In order to effectively analyze the physical operations of an 802.16j network, Table 3 lists all system parameters utilized in this research with reference to “Mobile WiMAX” published by WiMAX forum. Adaptive Modulation and Coding (AMS) applied in 802.16j is illustrated specifically in Table 4 with the same reference to “Mobile WiMAX.”

In the meantime, and for the purpose of evaluating our solution of quality, two simple algorithms, minimum BER algorithm (MBA) and density-based algorithm (DBA), are implemented for comparison. The purpose of each MBA is, for each MS , always to find the best paths that can generate the smallest BER value receives in DL and BS receives in UL. This algorithm will provide every transmission the minimum BER. The other one is DBA, the main concept would be the building of an RS with the first priority of the highest density area which is not served at the edges of coverage.

*Path Loss Function [27]*
where is attenuation factor, is operation frequency, is distance.

*Thermal Noise Function*
where is channel bandwidth, is noise figure.

In this research, the SNR function we apply is listed as follows: where is transmit power, is transmit gain, is receive gain, is path loss function, is thermal noise function.

The BER evaluation functions we apply have been moderated with various modulation schemes [28, 29] are demonstrated the theoretical and simulated results of BER value in four different modulation schemes.

##### 4.4. Experiment Scenarios

For the unique characteristics of this network deployment problem, the given circumstances are BS and MS locations, but RSs would be candidate locations. There is no RS built at the beginning. The word “topology” introduced in the following refers to the geographic distribution (the position) of locations where an RS could be built. Two types of topologies, grid and random, are proposed with different numbers of RS and MS in one BS environment to analyze the impact on deployment cost. We then apply different numbers of RS and MS with two BSs in a random topology to analyze the deployment in multiple BSs environment. Table 5 lists the experiment scenarios; Figures 5 and 6 show the graphic examples of grid and random networks. For each scenario, all MSs are guaranteed to have transmission paths and each scenario can be solved in our experiments. In these scenarios, BSs are at the center of the network, RSs are in Grid/Random topology, and MSs are in random topology.

##### 4.5. Experiment Results

In Lagrangian relaxation approach, an upper bound (UB) of the problem, is the best primal feasible solution, while the solution to the Lagrangian dual problem guarantees the lower bound (LB) of the problem. By solving the Lagrangian dual problem iteratively and getting a primal feasible solution, we derive the LB and the UB, respectively. Thus, the gap between the UB and LB, computed by (UB − LB)/LB × 100%, illustrates the quality (optimality) of the problem solution.

Figure 7 and Table 6 show the total deployment cost calculated by different algorithms within 1 BS and grid RS topology configuration with different numbers of RS and MS are deployed, respectively. It is obvious that LR-based algorithm results in superior solution in comparison with MBA and DBA, especially when the RS number is large. Additionally, DBA has lower costs than MBA. This illustrates that the LR algorithm has a trend of choosing RS with large MS density instead of RS, which results in minimum BER.

In RS grid topology, for a given network scale, the distance of RS is the farthest locations from BS to receive signals under BER threshold should be included mandatorily. This phenomenon can be observed in Figures 8 and 9. The RS locations in grid topologies of RS = 24 exclude the RS locations in the same topologies of RS = 8 where the about farthest locations BS can reach an RS. The costs in the scenarios of RS = 24 are all higher than in the scenarios of RS = 8 except MBA. We infer that this is because some MSs in RS = 24 need more hops than RS = 8 to reach the BS, thus inducing costs.

From Figures 10 and 11, we can come to the conclusion that with a fixed number of MSs, total deployment costs are reduced with an increasing number of RSs. Meanwhile, with a fixed number of RSs, total deployment costs are reduced with an increase in the number of MSs.

Figure 10 and Table 7 show total deployment costs as calculated by different algorithms through 1 BS with different numbers of RS and MS in a random topology. Again, it is obvious that the Lagrangian Relaxation-based algorithm receives better solution of quality in comparison with MBA and DBA (bold font), particularly so with a large number of RSs.

Figures 11 and 12 indicate the same conclusion in grid topology. With a fixed number of MSs, total deployment costs are reduced with an increase in the number of RSs. At the same time, with a fixed number of RSs, total deployment costs are reduced with an increase in the number of MSs.

In random topology, it is difficult to generate a network capable of satisfying every MS’s transmission when a few RSs (ex. RS = 8) are deployed. In general, RSs are not distributed uniformly enough to fully cover all MSs. Figure 13 and Table 8 show total deployment costs calculated by different algorithms under 2 BS and random topology, with different number of RS and MS. We come to the same conclusion: the Lagrangian Relaxation-based algorithm still gets better solution of quality in comparison with MBA and DBA, more so with a large number of RSs.

If these scenarios experimented previously are double the size of those in which BS = 1, how the result is. With random topology in BS = 1, it is also difficult to get a feasible network when RS number is small (ex. RS = 16 here). Figure 13 illustrates total deployment costs in random topologies with BS = 1 and BS = 2. Since the RS locations are different in both conditions, it would be fruitless to compare their costs. However, it is still obvious that the gaps are all larger in every scenarios in BS = 2 than in BS = 1 for network complexity.

Figure 14 and Table 9 show the scenario of 1 BS, with different number of RS and MS in a grid topology with a 6.4 km network scale. Since the network (6.4 km) is larger than that of previous experiments (3.2 km), 8 RSs is no longer sufficient to fulfill all transmissions. Therefore, 24 RSs (two layers from the BS) becomes the smallest size of this network scale.

Figure 15 demonstrates the deployment costs of 20 MSs with various numbers of RS among three kinds of network scale, 3.2 km with 8 RSs (1 layer from the BS), 6.4 km with 24 RSs, and 9.6 km with 80 RSs (4 layers from the BS). As explained previously, in the 6.4 km network scale the smallest grid size is 24 RSs (2 layers from the BS). One can see the same situation in 9.6 km, with the smallest grid size being 80 RSs (3 layers from the BS).

#### 5. Conclusions and Future Work

With 3G technology established, it was obvious that the traffic is increased significantly, but the average revenue per user (ARPU) is decreased very fast. The business challenges of operators would be that increasing revenues by finding other solutions more efficiency and effectiveness. But the network development of a new 4G system started to be investigated and made huge investments of macro base station deployments. In one early investigation which took relays would be able to speed up extend services and expanded market share at this stage economically. So, the operators can make new revenues and cost reduction balance.

Although our experiments do not cover large network scales with large number of RSs and MSs for the restrictions of computational capabilities, these model approaches can nevertheless be regarded as useful engineering guidelines for future LTE-A relay network development.

In this paper, we stand for an operator to propose a solution that determines where and how many relays should be deployed in the planning stages to minimize the development cost. In the planning stages, we not only derive a Multicast Tree routing algorithm to both determine and fulfill the QoS requirements and also enhance throughput on both down-link and up-link communications, but we also utilize the Lagrangian Relaxation Method in conjunction with optimization-based heuristics and conduct computational experiments to evaluate the performance of the proposed algorithms.

Our contributions in this research can be divided into three parts. First, we have constructed the network architecture with multicast tree routing concepts. Secondly, we proposed a precise mathematical expression to model the network architecture problem. This is not an intuitive mathematical model for considering the solvability of this problem. We have designed the entire model not only to be solvable but also to not violate the physical meanings. Finally, we provide the lagrangian relaxation and optimization-Based algorithms to solve this problem; we prove it to have superior quality after verification with other simple algorithms and lower bound value. This optimal solution is a good strategic method to minimize the CAPEX of operators to build up a relay network with more efficiency and effectiveness and the QoS can be guaranteed.

#### Appendix

*Solution Approach.* The wireless relay deployment problem is emulated as a mixed integer and linear programming (MILP) problem. To solve this problem, the optimal development cost for network planning is minimized to relay selection constraints, nodal, and link capacity constraints, cooperatively relaying constraints, and routing constraints for both UL and DL transmissions. The Lagrangian Relaxation method is proposed in conjunction with the optimization-based heuristics to solve the problem. The primal problem is transformed into the following Lagrangian Relaxation Problem, where constraints (3), (4), (5), (6), (10), (11), (12), (14), (15), (16), (17), (19), (20), (21), (22), (23), (25), (26), (27), (28), and (29) are relaxed by introducing Lagrangian multiplier vector .

*Optimal Problem.* One has subject to

*Subproblem 1 (related to decision variable* *).* One has
subject to

Because the configuration of BS is constant, can be further decomposed into independent subproblems. For each candidate location : subject to (A.3a) and (A.3b).

For each , find the configuration corresponding to the smallest coefficient value of . If the coefficient is negative, then set to be 1 and 0 otherwise.

*Subproblem 2 (related to decision variables* *).* One has
subject to

Equation can be further decomposed into subproblems. For each RS and direction , Subject to (A.4a) and (A.4b).

For each , find the BS which can result in the smallest coefficient of ; if the coefficient is negative, then set to be 1 and 0 otherwise.

*Subproblem 3 (related to decision variables* *,* *).* One has
subject to

Equation can be further decomposed into independent subproblems. For each MC , subject to (A.5a), (A.5b), (A.5c), (A.5d), and (A.5e).

The two directions of DL and UL are independent; can be decomposed into DL and UL subproblems. Constraint (A.5a) illustrates that once an MC homes to exactly a BS, it cannot home to RS anymore, and vice versa, so can be rewritten into following forms. In both directions, while MC homes to a BS , the decision variable . For each MC subject to (A.5a), (A.5b), (A.5c), (A.5d), and (A.5e).

The algorithm to optimally solve is illustrated in the following.

*For DL*

*Step 1. *Use SNR function to calculate the SNR value from every BS to MC .

*Step 2. * Find the BS which can result in the smallest coefficient of .

*Step 3. * Examining all sets of configuration for each RS in the SNR function to determine the SNR value ; meanwhile, to find the RSs which can result in the first smallest coefficient of . The summation of these amount of coefficients can be taken into consideration excluding positive ones bigger than the smallest coefficient for the further calculations. That is, we at least had the smallest coefficient for further steps, whether it is negative or not.

*Step 4. *If the coefficient of in Step 2 is smaller than the summation of coefficient of smallest coefficient of in Step 3, then set to be 1; otherwise, set these of to be 1.

*For UL*. Repeat Step 1 to Step 4 to determine and with spatial diversity number .

*Subproblem 4 (related to decision variable* *).* One has subject to

Equation can be further decomposed into independent shortest path problems with arc weight . For each shortest path problem, it can be effectively solved by Bellman Ford’s minimum cost shortest path algorithm. For each RS , RS , DIR , if the total cost of the shortest path is smaller than , then set to be 1 and 0 otherwise.

*Subproblem 5 (related to decision variables **,* *).* One has
subject to

Similar to , Since DL and UL are two independent transmission directions, we can rewrite into DL and UL subproblems: subject to (A.7a) and (A.7b).

Equation can then be decomposed into independent subproblems. For each link , subject to (A.7a) and (A.7b).

The algorithm to optimally solve is illustrated in the following.

*For DL*

*Step 1. * Examining all sets of configuration for each source node in the SNR function to determine the SNR value which can result in the smallest summation of coefficient of . If all individual coefficients are positive, then set and all to be 0.

*Step 2. * For each MC , if the coefficient is negative, then set to be 1 and 0 otherwise.

*For UL*. Repeat Steps 1 and 2 to determine and .

*Subproblem 6 (related to decision variable* *).* One has
subject to

For can be solvable, we introduced constraint (A.8b) into this subproblem to transform from continuous to discrete. Then, can be further decomposed into independent subproblems. For each MC , subject to (A.8a) and (A.8b).

We can calculate the value of by examining every exhaustively. Set while it can result in the smallest value of . Here, we applied the interval to be 0.01.

*Subproblem 7 (related to decision variable* *).* One has
subject to

In the same situation like Subproblem 7, we introduced constraint (A.9b) into subproblem 7 to transform from continuous to discrete. Equation can be further decomposed into independent subproblems. For each MC , RS (or BS) , subject to (A.9a), and (A.9b).

Similar to , can be solved by exhaustively examining to find out the smallest value of this problem; then set . Here, we applied the interval to be 0.01.

*The Dual Problem and the Subgradient Method*. According to the algorithms proposed previously, the Lagrangian relaxation problem can be solved effectively and optimally. Based on the weak Lagrangian duality theorem, the objective value of , is a lower bound of . The following dual problem is constructed to calculate the tightest lower bound and solved the dual problem by using the subgradient method.

*Dual Problem (D).* One has
subject to

Let the vector be a subgradient of ,. Then, in iteration of the subgradient procedure, the multiplier vector , is updated by . The step size is determined by . is the best primal objective function value found by iteration . is a constant where .

#### Conflict of Interests

It is hereby asserted that all the coauthors of this paper do not have any personal or financial interest with any model or system used in this paper.

#### References

- E. Fox, “North American ARPU growth outpaces the world: a look at wireless forecast drivers,” Yankee Group, March 2006.
- D. Wang, J. Li, K. Xing, S. Jin, and K. Liu, “Real-time, real-location, and real-identity service information (R3SI) based application enabled mobile service architecture in cellular networks,” in
*Proceedings of the 32nd International Conference on Distributed Computing Systems Workshops (ICDCSW '12)*, pp. 315–323, Macau. View at Publisher · View at Google Scholar - A. Engels, M. Reyer, and R. Mathar, “Profit-oriented combination of multiple objectives for planning and configuration of 4G multi-hop relay networks,” in
*Proceedings of the 7th International Symposium on Wireless Communication Systems (ISWCS '10)*, pp. 330–334, September 2010. View at Publisher · View at Google Scholar · View at Scopus - 3GPP, http://www.3gpp.org/.
- “3GPP TR 36. 814,” Evolved Universal Terrestrial Radio Access (E-UTRA), Further Advancements for E-UTRA Physical Layer Aspects.
- “3GPP TR 36. 806,” Evolved Universal Terrestrial Radio Access (E-UTRA), Relay Architectures for E-UTRA (LTE-Advanced).
- “3GPP R3-093149,” Comprehensive Comparison among Type-I Relay Alternatives, 2009.
- “3GPP R1-101825,” Backhaul UL Subframe Allocation in TDD LTE-A Relay, 2010.
- Y. Yang, H. Hu, J. Xu, and G. Mao, “Relay technologies for WiMAX and LTE-Advanced mobile systems,”
*IEEE Communications Magazine*, vol. 47, no. 10, pp. 100–105, 2009. View at Publisher · View at Google Scholar · View at Scopus - S. W. Peters, A. Y. Panah, K. T. Truong, and R. W. Heath, “Relay architectures for 3GPP LTE-advanced,”
*Eurasip Journal on Wireless Communications and Networking*, vol. 2009, Article ID 618787, 2009. View at Publisher · View at Google Scholar · View at Scopus - X. Wang, S.-J. Horng, R.-G. Cheng, and P. Fan, “Call dropping performance analysis of the eNB-first channel access policy in LTE-Advanced relay networks,” in
*Proceedings of the IEEE 7th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob '11)*, pp. 43–50, October 2011. View at Publisher · View at Google Scholar · View at Scopus - C. Huang, M. Zeng, and S. Cui, “Achievable rates of two-hop interference networks with conferencing relays,” in
*Proceedings of the 54th Annual IEEE Global Telecommunications Conference: “Energizing Global Communications” (GLOBECOM '11)*, pp. 1–6, Houston, Tex, USA, December 2011. View at Publisher · View at Google Scholar · View at Scopus - V. D. Meulen and C. Edward,
*Transmission of Information in a T-Terminal Discrete Memoryless Channel*, Department of Statistics, University of California, Berkeley, Calif, USA, 1968. - R. Pabst, B. H. Walke, D. C. Schultz et al., “Relay-based deployment concepts for wireless and mobile broadband radio,”
*IEEE Communications Magazine*, vol. 42, no. 9, pp. 80–89, 2004. View at Publisher · View at Google Scholar · View at Scopus - H. Li, L. Liu, G. Li, Y. Kim, and J. Zhang, “Multicell cooperation and MIMO technologies for broadcasting and broadband communications,”
*International Journal of Digital Multimedia Broadcasting*, vol. 2010, Article ID 848527, 2 pages, 2010. View at Publisher · View at Google Scholar · View at Scopus - K. Schober, R. Wichman, and T. Roman, “Layer arrangement for single-user coordinated multi-point transmission,” in
*Proceedings of the 46th Annual Conference on Information Sciences and Systems (CISS '12)*, pp. 1–5. - A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity, Part I: system description,”
*IEEE Transactions on Communications*, vol. 51, no. 11, pp. 1927–1938, 2003. View at Publisher · View at Google Scholar · View at Scopus - A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity, Part II: implementation aspects and performance analysis,”
*IEEE Transactions on Communications*, vol. 51, no. 11, pp. 1939–1948, 2003. View at Publisher · View at Google Scholar · View at Scopus - J. Yang, Z. Zhang, Z. Jiang, X. Jiang, and M. He, “Study on joint-coding based on pre-coding and STBC in coordinated multi-point system,” in
*Proceedings of the Spring Congress on Engineering and Technology (S-CET '12)*, pp. 1–4. - M. Rahman and H. Yanikomeroglu, “Interference avoidance through dynamic downlink OFDMA subchannel allocation using intercell coordination,” in
*Proceedings of the IEEE 67th Vehicular Technology Conference-Spring (VTC '08)*, pp. 1630–1635, May 2008. View at Publisher · View at Google Scholar · View at Scopus - M. Rahman, H. Yanikomeroglu, and W. Wong, “Interference avoidance with dynamic inter-cell coordination for downlink LTE system,” in
*Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC '09)*, pp. 1238–1243, April 2009. View at Publisher · View at Google Scholar · View at Scopus - G. Amarasuriya, C. Tellambura, and M. Ardakani, “Performance analysis framework for transmit antenna selection strategies of cooperative MIMO AF relay networks,”
*IEEE Transactions on Vehicular Technology*, vol. 60, no. 7, pp. 3030–3044, 2011. View at Publisher · View at Google Scholar · View at Scopus - A. B. Saleh, O. Bulakci, J. Hämäläinen, S. Redana, and B. Raaf, “Analysis of the impact of site planning on the performance of relay deployments,”
*IEEE Transactions on Vehicular Technology*, vol. 61, no. 7, pp. 3139–3150, 2012. - N. Kong and L. B. Milstein, “Average SNR of a generalized diversity selection combining scheme,”
*IEEE Communications Letters*, vol. 3, no. 3, pp. 57–79, 1999. View at Publisher · View at Google Scholar · View at Scopus - R. K. Mallik, M. Z. Win, J. W. Shao, M.-S. Alouini, and A. J. Goldsmith, “Channel capacity of adaptive transmission with maximal ratio combining in correlated Rayleigh fading,”
*IEEE Transactions on Wireless Communications*, vol. 3, no. 4, pp. 1124–1133, 2004. View at Publisher · View at Google Scholar · View at Scopus - M. L. Fisher, “The Lagrangian relaxation method for solving integer programming problems,”
*Management Science*, vol. 27, no. 1, pp. 1–18, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. N. Lin,
*Content Delivery over Wireless Network- Radio Propagation: Issues & Models*, Department of Electrical Engineering, National Taiwan University, Taiwan. - C. Langton, “Intuitive guide to principles of communications: all about modulation: Part II,” 2002, http://complextoreal.com/.
- “Wireless Communications Laboratory,” National Chung Cheng University, Taiwan.