Printer Friendly

Radio resource management of CoMP system in HetNet under power and backhaul constraints.

1. Introduction

T o meet an ever-increasing number of demands for reliable and high rate transmission in cellular networks, 3rd Generation Partnership Project (3GPP) integrates several promising techniques into Long Term Evolution-Advanced (LTE-A) systems [1]. In addition to higher-order MIMO and carrier aggregation, Heterogeneous Network (HetNet) [2] is proposed as a new deployment strategy to eliminate coverage holes and improve data rate of macro cells. Different from traditional homogeneous network, the coverage area of a macro cell in HetNet is overlaid by multiple small cell sites (Pico, Femto, Remote Radio Head, etc.) distributed in multiple geographical locations. These small cell sites are physically or logically connected to a Control Unit (CU) that is usually embedded in an evolved Node B (eNB). Small cells perform wireless communications with User Equipments (UEs) instead of the eNB, which shortens the propagation distance, and thereby enables higher strengthen of signals. In an ideal scenario, this new deployment significantly improves the data rate of a macro cell. Unfortunately, the dense deployment of small cell sites may cause severe intercell interference, which degrades network performance in terms of transmission quality.

To combat with intercell interference, 3GPP introduces and standardizes Coordinated Multi-Point (CoMP) technique into LTE-A systems. The rationale behind CoMP is to make small cell sites cooperate with each other and work as a virtual MIMO system, such that signals are jointly processed with the help of the instantaneous Channel State Information (CSI). According to the methods dealing with interference, CoMP schemes are mainly grouped into two major categories [3]: Coordinated Scheduling/Coordinated Beamforming (CS/CB) and Joint Processing (JP). CS/CB scheme is dedicated to mitigating intercell interference via jointly scheduling and beamforming signals among small cells. One option of CS/CB scheme is well-known Dirty Paper Coding (DPC) [4] that is proved to be a capacity achieving strategy in MIMO broadcast channels [5]. However, it is complexity prohibitive to implement DPC in practice, because of its successive encodings and decodings at terminal antennas. By contrast, Zero-Forcing (ZF) [6], as a linear precoding method for joint signal processing, can significantly reduce the computational complexity. Nevertheless, in order to implement ZF precoding, the required number of receiver antennas should be no more than that of transmission antennas, which restricts available independent channels.

Different from CS/CB scheme, JP scheme intends to utilize dominating intercell interference to benefit desired transmissions. One way to do that is to allow a UE located in an overlapped area of several cells to select the cell with the best channel quality for transmission in each time slot. This method is named as Dynamic Cell Selection (DCS). Another typical JP scheme is referred to as Joint Transmission (JT) that enables multiple cells to simultaneously serve a specific UE. In this case, the UE can receive multiple versions of the desired signals from several spatially independent channels. With appropriate combining methods at UE end, the signal can be strengthened, so that transmission quality is improved in this way.

In addition to advanced transmission schemes of CoMP, Radio Resource Management (RRM), involving Resource Block (RB) scheduling and Power Allocation (PA), is also an effective method to alleviate intercell interference and improve network performance. RRM has been widely studied in single-cell scenario, where transmissions to different UEs are properly scheduled to improve system performance, and orthogonal channels are allocated to avoid intracell interference. Generally, RRM in single-cell scenario mainly focuses on achieving a local performance optimization, without consideration of intercell interference; in HetNet, however, since multiple small cells are deployed densely, intercell interference is a non-negligible problem, which seriously affects system performance. Obviously, existing solutions to single-cell RRM are not efficacious any more.

Recently, RRM in multi-cell scenario has attracted much attention in the literature [7]-[9]. Compared with single-cell scenario, multi-cell scenario makes RRM more complicated in several aspects. First, although it is easy to be operated in practice, completely Orthogonal Frequency Division Multiplexing (OFDM) among cells is not suited in multi-cell scenario, due to the low frequency reuse factor. Thus, to reduce intercell interference, while maintaining high frequency spectrum efficiency, spectrum resources must be carefully scheduled. Second, joint resource management requests collecting and exchanging CSIs among small cell sites. The connections of small cells in HetNet are termed backhaul links, on which CSIs are collected and control information, as well as data packets, can be delivered by the CU. Many works assume that capacity of backhaul links is infinite, so that time delay on backhaul can be ignored [10][11]; however, backhaul capacity is actually limited and time delay severely affects the efficiency of RRM, which further leads to the decrease of the overall network performance [12]. Therefore, it is necessary to consider backhaul limitation, when discussing RRM in multi-cell scenario. In addition, RRM problem in multi-cell scenario is a Mixed Integer Programming (MIP), which is proved to be NP-hard. Thus, appropriate methods are necessary to be studied to simplify the problem and make it applicable in practice.

In this work, we focus on RRM in HetNet where JP CoMP (DCS or JT) is employed to improve network performance. For simplicity, all points equipped with transmission antennas in a single geographical location, including eNB and small cell sites, are referred to as Transmit Points (TPs) in the rest of this paper. Different from an ideal scenario, practical resource limitations are considered, involving transmission power at each TP and capacity of backhaul links connecting TPs, which makes the problem more complicated but practical. Since it is unrealistic to achieve globally optimal solution, we divide the formulated problem into an integer programming for RB scheduling and a continuous variable programming for PA. We solve the RB scheduling problem under the assumption of constant transmission power. Then, we substitute the obtained scheduling results into the PA problem, and solve the PA problem by an iterative Karush-Kuhn-Tucker (KKT) method. The final solution is suboptimal for the formulation, but it requests applicable computational effort and easy to be realized. Simulation results validate the effectiveness of the proposed algorithm. The major contributions of this paper are summarized as follows:

* We formulate RRM problem in HetNet with JP CoMP as an MIP problem. The formulation aims to maximize the overall weighted data rate, while taking into account constraints of both transmission power and backhaul capacity.

* To reduce computational complexity, we decompose the formulated problem into two parts: RB scheduling problem and PA problem.

* To solve RB scheduling problem, we propose an approach based on instantaneous CSI, under the assumption of constant power. DCS and JT schemes are considered separately.

* To solve PA problem, we propose an algorithm with the obtained RB scheduling solution. The proposed algorithm further divides the problem into independent sub-problems and solves each sub-problem by an iterative KKT method.

The rest of the paper is organized as follows. In Section 2, we describe the system model in detail. Then, mathematical formulation of the discussed problem is presented in Section 3. Section 4 and 5 propose approaches to the separated RB scheduling problem and PA problem, respectively. We show simulation results in Section 6 and conclude our work in Section 7.

2. System Model

In this section, we introduce the considered a HetNet system, consisting of a CU located at the center and several TPs surrounding the CU, as shown in Fig.1. The system is assumed to be operated in Frequency Division Duplexing (FDD) mode, whereby uplink and downlink transmissions are conducted independently in different frequency bands. In this paper, we focus our discussions on downlink transmissions. All necessary CSIs are measured by UEs and sent back to the CU via dedicated uplink channels since FDD operation is considered.

Denote n={1, ..., M} as the set of all TPs. The CU is connected to TPs by backhaul links with limited capacity. All computation tasks about RRM is processed at the CU. After processing, control information, as well as data packets, will be sent from the CU to each TP before actual downlink transmissions. We assume that all TPs are perfectly synchronized in both time and phase thanks to the connections by backhaul links between CU and TPs.

There are totally K UEs in this macro cell located with the uniform distribution. In this paper, UEs are divided into two categories: cell-in UEs and cell-edge UEs, according to UEs' channel conditions. In LTE-A systems, the channel conditions are measured by reference signals (RSs) from TPs to UEs. For a cell-in UE, since it is most probably located near to a TP, the channel between them is outstanding quality, compared with the others. Therefore, there is an RS whose power level is much higher than RSs from any other TPs. As for a cell-edge UE, it receives several RSs with similar power levels. This situation indicates that the UE may suffer from interference caused by transmissions of neighboring TPs.

Before classifying cell-in UEs and cell-edge UEs formally, we need to introduce the concept of CoMP set. LTE-A systems allow UEs to decide a CoMP set, in which several TPs are selected as candidates to serve a specific UE. Denote nk as the CoMP set of UE k, and the rule of selecting nk is given as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (1)

where RS indicates the strength of the reference signal, and [[DELTA].sub.thres] is the threshold in dB, which can be changed to adjust the dimension of CoMP set. It is obvious that the smaller [[DELTA].sub.thres] is, the more TPs will be added into CoMP set, which is beneficial for UEs to improve the transmission quality and data rate. However, overhead caused by cooperation among TPs in the set will increase consequently. Therefore, [[DELTA].sub.thres] should be carefully decided as a system parameter. Although this is an interesting subject, it is out of the scope of our paper. Instead, we simply set the threshold to be 5 dB as suggested in [11].

Using the criterion described above, UE k measures all the received RSs and then decides the CoMP set [[PI].sub.k] [member of] [PI]. In specific, if [absolute value of ([[PI].sub.k])]=1, UE k is a cell-in UE, and [[PI].sub.k] includes its home TP only; whereas if [absolute value of ([[PI].sub.k])] >1, UE k is a cell-edge UE.

According to the LTE-A standard, OFDM Access (OFDMA) is adopted in downlink systems, which splits the entire frequency bandwidth into several non-overlapping subcarriers. Twelve consecutive subcarriers for a duration of a Transmit Time Interval (TTI) consist of an RB. In this paper, we assume the total bandwidth is divided into NRB RBs and is used at each TP with universal frequency reuse factor. The numbers of antennas at each TP and each UE are denoted by NT and NR, respectively. In addition, we assume that the channel fading is quasi-static, so that channel fading remains constant during per TTI.

2.1 Non-CoMP Scenario

In multi-cell scenario, a downlink transmission is impacted by interference from the other signals transmitted simultaneously, especially when frequency is fully reused among cells. Since single user-MIMO (SU-MIMO) with OFDMA technology is considered in this paper, intracell interference is entirely removed. The signal received by UE k on the nth RB of TP m can be described as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (2)

where [H.sup.n.sub.m,k] is an NR XNT channel matrix whose element Hnmk (i, j) denotes the channel coefficient between the jth antenna of TP m and the ith antenna of UE k on the nth RB; [w.sup.n.sub.m] ([([w.sup.n.sub.m]).sup.H] [w.sup.n.sub.m] = 1) is the [N.sub.T] X 1 dimension precoding vector which maps data stream [s.sup.n.sub.m] (E[[absolute value of ([s.sup.n.sub.m])] = 1) onto the transmission antennas of TP m; [p.sup.n.sub.m] is the power used by TP m for transmission on nth RB; [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is the corresponding complex Gaussian noise vector; [PI]\{m} represents a subset of n without the element m. The first term on the right of Eq. (2) denotes the intended signal arrived at the receiver, while the second term is the interference caused by simultaneous transmissions from other TPs.

The Signal-to-Interference-plus-Noise Ratio (SINR) of UE k on RB n is defined as follows,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (3)

According to the information theory, the data rate of UE k on RB n is

[R.sup.k.sub.n] = b log (1 + [[gamma].sup.n.sub.k]), (4)

where b is the bandwidth of each RB. In LTE-A systems, it is standardized to be 180kHz [13] [14].

As indicated in Eq. (3), the transmission quality of cell-edge UEs could be unfavorable, due to the low signal strength caused by long-distance propagation from the serving TP and severe intercell interference from neighboring TPs. JP CoMP schemes, as mentioned before, intend to make use of the dominating interference to enhance the desired signal, which results in significant abatement of interference. Details will be discussed in the next subsection.

2.2 JP CoMP Scenario

As mentioned before, UEs select their own CoMP sets according to the strenghen of RSs under the rule given by Eq. (1), and then notify the results to the CU. The CoMP set [[PI].sub.k] is fixed once UE k enters the network. However, due to the variability of channels in time and frequency domains, it is not optimal to employ all TPs in CoMP sets for transmissions all the time. Therefore, we further define a transmission set for UEs on each RB, denoted by [[OMEGA].sup.n.sub.k], [lambda]k, n, which is comprised of TPs selected to perform actual transmissions to UE k on the nth RB. Note that [[OMEGA].sup.n.sub.k] is a subset of [[PI].sub.k] ([[OMEGA].sup.n.sub.k] [subset or equal to] [[PI].sub.k]) and it varies on each RB.

2.2.1 DCS CoMP

When DCS scheme is employed, the TP in CoMP set nk with the best channel gain associated with UE k on RB n will be used for the data transmission, i.e., [absolute value of ([[OMEGA].sub.n.sub.k])] = 1. The preferred TP varies on each RB due to time-variance of wireless channels. Compared with conventional cellular systems, the strength of signal arriving at UE k is potentially improved, thanks to the selection gain in DCS scheme. To decrease intercell interference on UE k, TPs in [[PI].sub.k] \ [[OMEGA].sup.n.sub.k] ([[PI].sub.k] [[OMEGA].sup.n.sub.k] denotes the relative complement of [[OMEGA].sup.n.sub.k] with respect to [[PI].sub.k]) are not selected to transmit, but are forced to be silent on RB n. As a result, dominating interference is removed and transmission quality is improved. This scheme is known as DCS with muting [15]. Accordingly, signal received by UE k on the nth RB in DCS scheme can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (5)

and the corresponding SINR reads

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (6)

Denote scheduling index set as{[[beta].sup.n.sub.m,k]}, where [[beta].sup.n.sub.m,k] [member of] {0,1}, [lambda]m, k, n . [[beta].sup.n.sub.m,k] = 1 indicates that TP m is chosen to transmit data signal to UE k on the nth RB in the current TTI. With scheduling indices, the transmission set can be denoted as [[OMEGA].sup.n.sub.k] = {m | [[beta].sup.n.sub.m,k] = 1, m [member of] [[PI].sub.k]}, [for all]k, n and the SINR in Eq. (6) can be further expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (7)

As expressed above, in DCS CoMP, UE k receives a single version of data signal from the selected TP, thus [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. As shown in Eq. (7), interference in this scheme is only caused by TPs out of CoMP set [[PI].sub.k] (i.e., TPs in [PI]\[[PI].sub.k]). Thus, the interference strength is not as significant as that in traditional systems without CoMP schemes.

2.2.2 JT CoMP

Different from DCS scheme, JT CoMP allows several TPs in a UE's CoMP set to simultaneously transmit the desired data signal. Due to spatially separation of transmission antennas, multiple versions of the desired signal will be received by the UE from independent channels, which generates extra spatial diversity gain. Thus, signal strength is further enhanced in this way. On the other hand, potential intercell interference can be mitigated, since partial interference sources are utilized to send data signals. As a consequence, transmission quality can be remarkably improved.

The original idea of JT CoMP scheme is to require all TPs in a CoMP set to transmit signals simultaneously, regardless of frequency selectivity of channels, i.e., [[OMEGA].sup.n.sub.k] = [[PI].sub.k], [for all]k, n. However, fixed transmission set restricts the performance of JT CoMP (This is proved by our simulation results shown in Section 6). In this paper, we adopt Dynamic JT (DJT) scheme, which selects a proper transmission set for a UE from its CoMP set, according to CSIs on each RB.

Specifically, [[OMEGA].sup.n.sub..k] is dynamically determined on each RB and 1 [less than or equal to] [absolute value of ([[OMEGA].sup.n.sub.k])] [less than or equal to] [[absolute value of ([[PI].sub.k])].

Similarly, signal model of DJT CoMP transmission can be described as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (8)

The expression of SINR corresponding to the transmission in Eq. (8) is

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (9)

Although some interference are potentially retained in DJT CoMP, compared with DCS muting method, UEs' SINRs can still be improved due to the enhanced signal strength caused by spatial diversity gain.

Summarily, both DCS and DJT methods intend to strengthen signal and mitigate intercell interference by mean of UEs CoMP sets. Eqs. (7) and (9) prove that UE's communication quality is improved by JP CoMP compared with traditional system.

3. Problem Formulation

In this section, we mathematically formulate the RRM problem in HetNet with JP CoMP. In order to improve system performance, it is necessary to properly allocate RBs and power to each transmission, as well as to select UEs' transmission set Q. Generally, to maximize overall data rate, more resource should be allocated to UEs with better channel quality, while other UEs are ignored as the well-known greedy algorithm; however, this algorithm is unfair, and cell-edge UEs in bad conditions experience unsatisfactory transmission performance. To this end, we construct the objective function as the sum of weighted UEs' data rate, so that fairness among UEs can be maintained to a certain extent. In addition, from practical consideration, we also deliberate resource constraints of backhaul capacity and transmission power in the formulation.

3.1 Objective Function

The objective of the proposed formulation is to maximize the sum of UEs' utility functions. To guarantee UEs' fairness, we weight [R.sub.k] with the time average of data rate of UE k, and define the weighted data rate as utility function [f.sup.n.sub.k]([[beta].sup.n.sub.m,k], [p.sup.n.sub.m]) * The objective function is constructed as the sum of weighted data rates, which can be expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (10)

In this expression, [[bar.R].sub.k] is defined as the time average of data rate of UE k

[[bar.R].sub.k] = [alpha][[bar.R].sup.before.sub.k] + (1 - [alpha])[R.sub.k] (11)

where [[bar.R].sup.before.sub.k] denotes the average data rate of UE k before current TTI. It refers to a cumulative mean value of data rate of UE k; [R.sub.k] is the data rate in the current TTI, which can be obtained by [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a forgetting factor to balance the influence of weights between [R.sup.before.sub.k] and [R.sub.k]. Weighting instantaneous data rate [R.sup.n.sub.k] by 1/[[bar.R].sub.k], we can improve the fairness among all UEs. The rationale is that the UE with lower [[bar.R].sub.k] in the past transmission will have more opportunities to assign RB n [19]. To measure fairness of UEs' data rates formally, we use fairness factor defined in [16]

F = [([[summation].sup.K.sub.k=1][R.sub.k]).sup.2]/K[[summation].sup.K.sub.k=1][R.sub.2.sub.k] (12)

Obviously, F is in the range of [0,1] and F=1 indicates an absolutely fair situation.

3.2 Power and Backhaul Constraints

To make the formulation more practical, several limitations are considered in this paper. The crucial one is backhaul limitation, which restricts the data rate of each TP. Delays of transmissions of control information and data packets via backhaul links should be tolerable to ensure the effectiveness of the system. In the considered system, the delay must be much less than a TTI. Due to the limited capacity, traffic load on backhaul links need to be restricted.

Since data packets are much more voluminous than control information, we just consider data traffic as backhaul load. Let [[LAMBDA].sub.m] denotes the set of UEs served by TP m. The data packets transmitted by TP m are limited by backhaul capacity. Denote the capacity of backhaul link between the CU and TP m by [C.sub.m]. The cooresponding contraint can be expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (13)

In addition to the constraint on backhaul capacity, limited transmission power at each TP is also considered. Let [p.sup.n.sub.m] be the transmission power used by TP m on RB n. We assume that [p.sup.n.sub.m] is bounded by zero and a given positive value [S.sup.n.sub.m].

3.3 Formulation

By jointly considering the objective function and constraints above, we formulate the proposed RRM problem in HetNet system as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (14)

The solutions to Eq. (14) is to approach optimal power allocation (pnm) and scheduling index set ([[beta].sup.n.sub.m,k]), which maximize the sum of weighted data rate under the constraints C1-C3. C1 ensures each index pm k to be a bit number, such that on each RB, each TP can serve no more than one UE; C2 and C3 demonstrate the constraints on transmission power and backhaul capacity, respectively.

The proposed formulation is an MIP, which is proved to be NP-hard and impossible to achieve the optimal solution in polynomial time. In this paper, we aim to find out an algorithm to obtain a suboptimal solution to Eq. (14) with low computational complexity. The principle of the proposed algorithm is to separate Eq. (14) into an RB scheduling problem with the assumption of constant transmission power, and a PA problem with the obtained scheduling indices. Details of the proposed algorithm are given in the following sections.

4. RB Scheduling Problem

As mentioned before, C2 in Eq. (14) imposes the power constraint on the resource allocation problem. To obtain a suboptimal solution [[beta].sup.n.sub.m,k], [for all]m,k,n of the proposed formulation, i.e. the selection of transmission set [[OMEGA].sup.n.sub.k] for each UE on each RB, we discuss the RB scheduling problem with fixed transmission power at the first place. It is reasonable to set all transmission power [p.sup.n.sub.m] to its maximum [S.sup.n.sub.m]. For simplicity, we assume that [S.sup.n.sub.m] = S [greater than or equal to] 0, [for all]m, n. Therefore, the RB scheduling problem can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (15)

The straightforward method is to test every possible solution of {[[beta].sup.n.sub.m,k]}, and find the optimal one to maximize the objective function, as well as meeting all the constraints. This search algorithm requests enormous effort of calculation. In this paper, we propose two search methods with lower computation complexity for DCS and DJT schemes, respectively. The detailed search processes are described in the rest of this section.

4.1 Searching Method for DCS Scheme

Step One: This step aims at deciding the scheduling index set that satisfies constraint C4 in Eq. (15). Consider UE k in [[LAMBDA].sub.m], its estimated data rate on the nth RB is given as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (16)

Then, the proposed algorithm searches Am to find the UE with the largest utility function, i.e.

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (17)

where [[bar.R].sub.k] is given in Eq. (11). After the searching, k is determined, and as a result, [[beta].sup.n.sub.m,k] is set to 1, while [[beta].sup.n.sub.m,k] ([for all]k [not equal to] k') are set to 0. Then, a coarse scheduling result can be obtained after accomplishing the search for each RB of all TPs.

Step Two: The result from Step One satisfies C4 of Eq. (15). The Step Two then, is aiming at restricting the data traffic of each TP to its backhaul constraint. If the total data traffic of a TP is larger than its capacity of backhaul link to the CU, partial traffic should be suspended in order to guarantee effectiveness of the system.

Consider the Signal-to-Leaking-plus-Noise Ratio (SLNR) of each transmission defined as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (18)

The expression of SLNR implies the ratio of signal strength to interference caused by the transmission to other UEs. In the proposed algorithm, TP m shuts the transmission with the lowest SLNR, when the traffic on backhaul link is beyond its capacity. The two-step searching method for the DCS scheme is summarize in Algorithm 1.

Algorithm 1 DCS Scheduling Algorithm

Output: The scheduling index set.

% Step One

1: for n=1: NRB do
2:    for m=1: M do
3:       Find [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],
           where [[??].sup.n(DCS).sub.k] and [[bar.R].sub.k] are
           defined as Eqs. (16) and (11).
4:       [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
5: end for
6: end for
8: Step Two
7: for m=1: M do
8:   Calculate [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
9:   while [L.sub.m] > [C.sub.m] do
10:      Find [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],
           where [SLNR.sup.n.sub.m,k] is defined as Eq. (18).
11:      [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],
           update [L.sub.m] and [[??].sup.n(DCS).sub.k].
12:    end while
13: end for


4.2 Searching Method for DJT Scheme

For the DJT scheme, transmission set [[OMEGA].sup.n.sub.k] contains one or more elements ([absolute value of ([[OMEGA].sup.n.sub.k])] [greater than or equal to] 1). Therefore, the search method proposed in the previous subsection should be modified as follow.

Step One: Similar to the first step of DCS scheme, in Step One of searching for DJT scheme, the UE with the maximum utility function is selected on each RB. However, since TPs participating transmission to a specific UE is not fixed all the time, i.e., [[OMEGA].sup.n.sub.k] is unsure at present, we can only have an approximated expression of SINR in this step, expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (19)

Step Two: Result from Step One satisfies C4 of Eq. (15), but does not maximize the objective function. Therefore, an extra step is necessary.

Note that Eq. (19) is a coarse estimation that cannot describe the real data rate of UE k, when using DJT CoMP. In fact, there are [absolute value of ([[PI].sub.k])] options of [[OMEGA].sup.n.sub.k], which obviously increases the complexity of the exhaustive searching for an optimal solution. In the rest of this section, we propose a low complexity algorithm, which can reach a suboptimal solution to scheduling index set with rational requirement of computations on the basis of the result obtained from Step One.

Consider the nth RB of TP j assigned to UE k by the previous selection (i.e., [[beta].sup.n.sub.[mu],k], = 1). On this RB, the proposed algorithm calculates the utility functions of other UEs in set [[LAMBDA].sub.[mu]] to figure out whether there is a UE that could reach a higher weighted data rate, if it occupies the current RB instead of k. If the algorithm finds a UE k [member of] [[LAMBDA].sub.[mu]] (k [not equal to] k) who satisfies the condition, the scheduling index set should be reset, and [R.sup.n.sub.k] becomes

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (20)

As a result of adding TP[mu] into UE k's transmission set on the nth RB [[OMEGA].sup.n.sub.m], [R.sub.n.sub.k] is increased by a variation expressed as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (21)

Correspondingly, the data rate of UE k decreases because of losing the cooperation of TP [mu]. Similarly, we have the decreased data rate of UE k as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (22)

and the corresponding data rate variation is

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (23)

Algorithm 2 DJT Scheduling Algorithm

Output: The scheduling index set.

% Step One
1: for n=1:[N.sub.RB] do
2:    for m=1:M do
3:       Find [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]
           are defined as Eqs. (19) and (11).
4:       [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
5: end for
6: end for
% Step Two
7: for [mu]=1:M do
8:   for n=1:[N.sub.RB] do
9:      Find k which satisfies that [[beta].sup.n.sub.[mu],k'], = 1.
10:       [k.sup.*] [left arrow] k', [DELTA] [left arrow] 0.
11:       Calculate [[gamma].sup.n.sub.k'], [R.sup.n.sub.n],
            [([R.sup.n.sub.k']).sup.-[mu]] and
            [([R.sup.n.sub.k']).sup.[DELTA]] according to
            Eqs. (9), (4), (22), (23).
12:       for k = 1:K, k [not equal to] k' do
13:          Calculate [[gamma].sup.n.sub.k], [R.sup.n.sub.k],
               [([R.sup.n.sub.k]).sup.+[mu]] and
               [([R.sup.n.sub.k]).sup.[DELTA]] according to
               Eqs. (9), (4), (20), (21).
14:          Calculate [DELTA](k [right arrow] k') according to
               Eqs. (24) and (25).
15:          if [DELTA](k [right arrow] k') > [DELTA] then
16:              [DELTA] [left arrow] [DELTA](k [right arrow] k'),
                   [k.sup.*] [left arrow] k.
17:          end if
18:       end for
19:       if [k.sup.*] [not equal to] k' then
20:          [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
21:       end if
22:     end for
23:  end for
% Step Three
24: for m = 1:M do
25: Calculate [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII].
26:    while [L.sub.m] > [C.sub.m] do
27:       Find [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII],
            where SLNRlk is defined as Eq. (18).
28:       [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], update
            [L.sub.m] and [[??].sup.n(DJT).sub.k].
29: end while
30: end for


The variation of the target utility function caused by this change can be written as

[DELTA](k [right arrow] k') = [([R.sup.n.s.ub.k]).sup.[DELTA]]/[[bar.R].sub.k] + [([R.sup.n.sub.k']).sup.[DELTA]]/[[bar.R].sub.k']. (24)

In fact, [([R.sup.n.sub.k']).sup.[DELTA]] / [[bar.R].sub.k], is constant on RB n of TP [mu]. We denote it as [PHI]([mu], n, k') determined by instantaneous and time-averaged data rates of UE k previously scheduled on RB n of TP [mu] Rewrite the variation of utility function as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], (25)

where [DELTA](k [right arrow] k') > 0 indicates that the gain of utility function is positive, if replacing k by k on the nth RB of TP [mu]. In this case, the previous scheduling result is not appropriate, and it is necessary to be adjusted. Let [DELTA](k [right arrow] k) = 0. The algorithm searches all UEs and find k that maximizes Eq. (24), i.e.,

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (26)

Then, the scheduling indices will be reset as [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. The solution can be obtained after repeating this comparison for each TP and RB.

Step Three: The constraint of backhaul capacity should be considered at the same time. According to the backhaul constraint in Eq. (13), if the total data rate of TP m is no less than the capacity limitation of backhaul, no more traffic should be assigned to it. Taking into account of backhaul constraint, scheduling algorithm for DJT scheme includes last step the same as in DCS scheme (Step Two in Algorithm 1).

The algorithm solves the scheduling problem in Eq. (15) and gives a suboptimal solution of scheduling index set. The proposed algorithm for DJT CoMP is summarized in Algorithm 2.

4.3 Analysis of computational complexity

An straightforward method to find the solution, that not only satisfies all the constraints, but also maximizes the objective function, is the exhaustive search; however, since [[beta].sup.n.sub.m,k] is a bit number, there are totally [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], and the computational complexity of the exhaustive search is 0([MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]). This is complexity prohibitive when parameters M, NRB, and K increase.

The first idea to reduce complexity is to utilize the predetermined CoMP sets of each UE. For UE k with CoMP set nk, the feasible space of the index set, i.e., set {[[beta].sup.n.sub.m,k], [for all]m,n}, is [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. Therefore, the total required search to solve the formulated problem are reduced to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], and the corresponding computation complexity is O([MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]), where K [less than or equal to] [[summation].sub.k][absolute value of ([PI]k)] [less than or equal to] KM. [[summation].sub.k][absolute value of ([[PI].sub.k])] = K indicates that each UE is served by only one TP, while [[summation].sub.k][absolute value of ([[PI].sub.k])] = KM implies that the CoMP set for each UE is comprised of all TPs. With the help of CoMP sets, the complexity of exhaustive search can be reduced to some extent. However, it is still an exponential complexity anlgorithm with respects to M, [N.sub.RB], and K.

The proposed algrighm further reduces the computation complexity. With the predetermined CoMP sets, the proposed search method for DCS scheme calculates the estimated data rate [[??].sup.n(DCS).sub.k] for each UE, and then accomplishes comparison operation expressed in Eq. (11) to obtain the solution. The computation complexity for calculating all the [[??].sup.n(DCS).sub.k] consists of multiplication operations O(M-[absolute value of ([[PI].sub.k])]+1) and a logarithm operation O(KNRB). In addition, the proposed searching method contains comparison operations O(NRBXmen|AJ), where [[summation].sub.m] [member of] [PI] [absolute value of ([[LAMBDA].sub.m])] [less than or equal to] KM (the equation holds only if all TPs cooperatively work together). Similarly, the proposed search method for DJT scheme contains multiplication operations O(M) and a logarithm operation O(KNRB) for calculating [[??].sup.n(DJT).sub.k] and comparison operations O([N.sub.RB][[summation].sub.m] [member of] [PI][absolute value of ([[LAMBDA].sub.m])]). From the analysis above, it is observed that the proposed algorithms reduce the computational complexity with respects to M, [N.sub.RB], and K from exponential complexity to polynomial complexity, that is to say, the problem can be solved in polynomial time.

5. Power Allocation Algorithm

In this section, we propose an algorithm to solve the PA problem based on the obtained scheduling index set {[[beta].sup.n.sub.m,k]}. We first divide the PA problem into NRB independent sub-problems, and then, solve each sub-problem by an iterative KKT-method.

The problem in terms of PA can be rewritten as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (27)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (28)

The dual function of the problem with respect to the backhaul capacity constraint in Eq. (28) is

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (29)

where Am, Vm are the non-negative dual variables. There are MNRB variables except the dual variables in the optimization problem. To make it easier to solve, we decompose the dual problem into NRB independent sub-problems, each of which includes M variables, such that the

computational complexity is reduced. Since [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], we can rewrite Cm as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (30)

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is a constant when scheduling index set {[[beta].sup.n.sub.m,k]} is determined. Substituting Eq. (30) into Eq. (29), we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (31)

Therefore, the problem is decoupled into [N.sub.RB] independent sub-problems as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (32)

The objective of Eq. (32) is a well-known non-convex function, for which finding the global optimum solution is believed to be difficult. In this work, we use an iterative method based on KKT condition to achieve a local optimum solution.

Taking the first derivative of the objective in Eq. (32) with respect to [p.sup.n.sub.m], we have

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (33)

It is easy to obtain the first derivative of [R.sup.n.sub.k] with respect to [p.sup.n.sub.m] as follows:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (34)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (35)

For ease of expression, we denote

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (36)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII](37)

m en\{m}

For simplicity, we use {[P.sup.n.sub.m]} of the last iteration to calculate Eqs. (36) and (37), such that [T.sup.n.sub.m] and [A.sup.n.sub.m] can be calculated as constants when computing [p.sup.n.sub.m]. Substitute Eqs. (34)-(37) into Eq. (33), and let it be 0, we obtain the expression of [[??].sup.n.sub.m]:

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (38)

Combining with power constraint 0 [less than or equal to] [p.sup.n.sub.m] [less than or equal to] S, we have the solution to PA as:

[P.sup.n.sub.m] = max {min {[[??].sup.n.sub.m], S}, 0} (39)

Since it is almost impossible to obtain closed-form solution of [p.sup.n.sub.m], we employ a sub-gradient iteration approach to achieve the suboptimal solution. The multipliers [[lambda].sub.m] can be updated using the sub-gradient method [17] in each step as

[[lambda].sup.t+1.sub.m] = max {[[lambda].sup.t.sub.m] - [v.sup.t] ([[N.sub.RB].summation over (n = 1)][K.summation over (k = 1)] [[beta].sup.n.sub.m,k][R.sup.n.sub.k] - [C.sub.m]), 0} (40)

where t refers to iteration times.

The proposed iterative KKT-method solves each sub-problem to obtain a set of [p.sup.n.sub.m], [for all]m. The final solution of PA can be achieved after solving the total [N.sub.RB] sub-problems.

6. Simulation Results

To evaluate the performance of the proposed algorithms, we simulate the system described in Section 2. We use the Space Channel Model (SCM) [18] to create MIMO radio links in an urban environment, where obstacles like buildings and trees obstruct Line of Sight (LOS) of radio links. The suggested simulation parameters therein are listed in Table 1. Due to obstacles existing in radio environment, shadowing and penetration loss are considered in channel model. The coverage radiuses of TPs are set as 250 m, since we consider a densely-deployed HetNet system. The network topology in Fig. 2 simply illustrates the relative positions of TPs and UEs without details of channels. In this paper, we adopt a wrap-around simulation technology, which has been used to simulate large-scale cellular systems [20]. In our simulation, we have built a scenario containing 37 hexagon cells, where 19 TPs in the middle actually communicate with UEs, and the others 18 TPs wrapping them around produce interference with assumed strength.

For comparisons, two more scheduling schemes are considered, besides the proposed DCS and DJT: max capacity and fixed JT (FJT). Max capacity is a non-CoMP greedy algorithm, in which each UE selects the TP with the highest SINR to communicate on each RB, without

consideration of UEs' fairness. In FJT scheme, all the TPs in UEs' CoMP set must transmit data signals simultaneously. Although the data rate of cell-edge UEs is improved in this way, the overall data rate cannot be maximized due to its inflexibility.

Fig. 3 shows average data rate of each TP without backhaul constraint. The results show that max capacity has the highest data rate, followed by the proposed DJT. Both of these two schemes can achieve higher than 80 Mbps average date rate per TP; however, data rate per TP goes lower than 60 Mbps in the proposed DCS and further decreases to 50 Mbps or lower in FJT, respectively. Additionally, it is also observed that the proposed PA method is effective to further improve data rate for all scheduling schemes.

Nevertheless, the fairness of max capacity is unfavorable, as shown in Fig. 4. The reason is that in max capacity scheme, RB and power resources are preferred to allocate to those UEs with better channel conditions (cell-in UEs). In contrast, since CoMP schemes are inclined to improve the data rate of cell-edge UEs, the corresponding fairness factor is higher than that of max capacity. In addition, the results in Fig. 3 and 4 show that the proposed DJT scheme performs excellently in terms of both data rate and UEs' fairness.

Fig. 5 compares average data rate of cell-in UEs with that of cell-edge UEs. This figure gives another way to explain the results in Figs. 3 and 4. It is obvious that the DJT scheme can provide better services for cell-edge UEs than the other three schemes.

Figs. 6, 7 and 8 show average data rate and traffic on backhaul link of each TP in max capacity, DCS and DJT, respectively. Situations of infinite, 100M, 50M and 20M backhaul limitation are considered. From the simulation results, we can see that the backhaul limitation can be satisfied in all schemes, which verifies the effectiveness of the proposed RRM algorithms in terms of backhaul constraint. In addition, the results also show that average data rate is restricted by backhaul constraint. When backhaul capacity is restricted to 50M and 20M, the average data rate decreases dramatically. This result proves our motivation that it is a key problem to exploit efficient RRM algorithm, when capacity of backhaul link is limited.

Fig. 9 is the power consumptions of the proposed PA algorithm with DCS scheme and DJT scheme, respectively. As shown in Fig. 9, the proposed PA method can greatly save power than constant transmission power solution, without decreasing system performance. By using the proposed PA algorithm, TPs degrade their transmission power according to the instantaneous CSIs. As a result, the leaking interference is reduced and average data rate can be improved, as shown in Fig. 3. Power-saving, as a characteristic of the proposed PA algorithm, tightly meets the requirement of green cells for the environmental purpose.

7. Conclusion

In this paper, we have studied RRM problem in LTE-A HetNet scenario, where JP CoMP is employed. The problem involves practical constraints on transmission power and backhaul capacity. Since the problem is too complicated to achieve the optimal solution, we propose a suboptimal algorithm with applicable computational complexity, which separates the MIP into two solvable problems: RB scheduling and Power Allocation. For RB scheduling, we have considered both DCS and DJT schemes with constant transmission power, and have proposed algorithms based on instantaneous CSIs to assign RBs to UEs. Then, we have substituted the results of RB scheduling into PA problem, and have solved it by an iterative KKT-method. Extensive simulations are conducted to verify the effectiveness of our proposed algorithms. According to the obtained simulation results, we have shown that JP CoMP benefits cell-edge UEs. In particular, the proposed DJT scheduling has outstanding performance in the aspects of both data rate and UEs' fairness. Additionally, the proposed PA method can not only further improve data rate, but also greatly save power consumption.

http://dx.doi.org/10.3837/tiis.2014.11.012

References

[1] http://www.3gpp.org/specifications/releases.

[2] A. Damnjanovic, J. Montojo, Y. Wei, T. Ji, T. Luo, M. Vajapeyam, T. Yoo, O. Song, and D. Malladi, "A survey on 3GPP heterogeneous networks," IEEE Wireless Communications, vol. 18, no. 3, pp: 10-21, June, 2011. Article (CrossRef Link)

[3] L. Electronics, "CoMP configurations and UE/eNB behaviors in LTE-Advanced," in 3GPP TSG RAN WG1 Meeting #5 5bis, R1-090213, 2009. http://www.3gpp.org/ftp/tsg ran/WG1 RL1/TSGR1 55b/Docs/R1-090213.zip

[4] M. H. M. Costa, "Writing on dirty paper (corresp.)," IEEE Transactions on Information Theory, vol. 29, no. 3, pp: 439-441, May 1983. Article (CrossRef Link)

[5] H. Weingarten, Y. Steinberg, and S. Shamai, "The capacity region of the Gaussian MIMO broadcast channel," in Proc. of IEEEInt. Symposium on Information Theory, pp: 174, June 27-July 2 2004. Article (CrossRef Link)

[6] G. Caire and S. Shamai, "On achievable rates in a multi-antenna Gaussian broadcast channel," in Proc. of IEEE Int. Symposium on Information Theory, pp: 147, June 24-29, 2001. Article (CrossRef Link)

[7] E. Pateromichelakis, M. Shariat, A. Quddus and R. Tafazolli, "On the evolution of multi-cell scheduling in 3GPP LTE/LTE-A," IEEE Communications Surveys & Tutorials, vol. 15, no. 2, pp: 701-717, Second Quarter, 2013. Article (CrossRef Link)

[8] Y. Yu, E. Dutkiewicz, X. Huang and M. Mueck, "Downlink resource allocation for next generation wireless networks with inter-cell interference," IEEE Transactions on Wireless Communications, vol. 12, no. 4, pp: 1783-1793, April, 2013. Article (CrossRef Link)

[9] F. Capozzi, G. Piro, L. Grieco, G. Boggia and P. Camarda, "Downlink packet scheduling in LTE cellular networks: key design issues and a survey," IEEE Communications Surveys & Tutorials, vol. 15, no. 2, pp: 678-700, Second Quarter, 2013. Article (CrossRef Link)

[10] Minghai Feng, Xiaoming She, Lan Chen and Yoshihisa Kishiyama, "Enhanced dynamic cell selection with muting scheme for DL CoMP in LTE-A," in Proc. of IEEE 71st Vehicular Technology Conference, pp: 1-5, May 16-19, 2010. Article (CrossRef Link)

[11] H. Maattanen, K. Hamalainen, J. Venalainen, K. Schober, M. Enescu and M. Valkama, "System-level performance of LTE-Advanced with joint transmission and dynamic point selection schemes," EURSIP Journal on Advances in Signal Processing, vol. 2012:247, pp: 1-18, November 27, 2012. Article (CrossRef Link)

[12] O. Tipmongkolsilp, S. Zaghloul and A. Jukan, "The evolution of cellular backhaul technologies: current issues and future trends," IEEE Communications Surveys & Tutorials, vol. 13, no. 1, pp. 97-113, First Quarter, 2011. Article (CrossRef Link)

[13] A. A. Abdulkafi, T. S. Kiong, D. Chieng, A. Ting, and J. Koh, "Energy efficiency improvements in heterogeneous network through traffic load balancing and sleep mode mechanisms," Wireless Personal Communications, vol. 75, no. 4, pp: 2151-2164, April, 2014. Article (CrossRef Link)

[14] A. A. Abdulkafi, D. Chieng, T. S Kiong. A. Ting, J. Koh, and A. M. Ghaleb, "Energy-aware load adaptive framework for LTE heterogeneous network," Transactions on Emerging Telecommunications Technologies, vol. 25, no. 9, pp: 943-953, September, 2014. Article (CrossRef Link)

[15] N. DOCOMO, "Investigation on coordinated multipoint transmission schemes in LTE-Advanced downlink," in 3GPP TSG RAN WG1 Meeting fS5bis, R1-090314, 2009. http://www.3gpp.org/ftp/tsg ran/WG1 RL1/TSGR1 55b/Docs/R1-090314.zip

[16] Zukang Shen, Jeffrey G. Andrews and Brian L. Evans, "Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints," IEEE Transactions on Wireless Communications, vol. 4, no. 6, pp: 2726-2737, November, 2005. Article (CrossRef Link)

[17] D. Palomar and M. Chiang, "A tutorial on decomposition methods for network utility maximization," IEEE Journal on Selected Areas in Communications, vol. 24, no. 8, pp. 1439-1451, August, 2006. Article (CrossRef Link)

[18] J. Salo, G. Del Galdo, J. Salmi, P. Kyosti, M. Milojevic, D. Laselva, and C. Schneider. "MATLAB implementation of the 3GPP Spatial Channel Model (3GPP TR 25.996)," January, 2005. http://read.pudn.com/downloads86/sourcecode/app/331591/scm 11-01-2005.pdf

[19] W. Yu, T. Kwon and C. Shin, "Multicell coordination via joint scheduling, beamforming, and power spectrum adaptation," IEEE Transactions on Wireless Communications, vol.12, no.7, pp: 1-14, July, 2013. Article (CrossRef Link)

[20] Dinnis A. K., and Thompson J. S., "The effects of including wraparound when simulating cellular wireless systems with relaying," in Proc. of IEEE Vehicular Technology Conference (VTC2007-Spring), pp: 914-918, April 22-25, 2007. Article (CrossRef Link)

Jia Yu (1, 2), Shaohua Wu (1), Xiaodong Lin (2) and Qinyu Zhang (1)

(1) Communication Engineering Research Center, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen, Guandong 518055--China

[e-mail: yujia_hitsz@hotmail.com; hitwush@hit.edu.cn; zqy@hit.edu.cn]

(2) Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, Ontario L1H 7K4--Canada

[e-mail: xiaodong.lin@uoit.ca]

* Corresponding author: Qinyu Zhang

Received May 29, 2014; revised July 22, 2014; revised September 4, 2014; accepted October 1, 2014; published November 30, 2014

Jia Yu received her M.S. in Information and Communication Engineering from Harbin Institute of Technology Shenzhen Graduate School, China in 2010. Now she is with her Ph.D. degree at Harbin Institute of Technology Shenzhen Graduate School. Her current research interests include physical technologies of 4G and beyond Cellular Networks and optimization of resource allocation problems in cellular networks.

Shaohua Wu received his Ph.D. degree in Information and Communication Engineering from Harbin Institute of Technology, China in 2008. He is currently an associate professor of Information Theory with the Faculty of Electronic and Information Engineering, Harbin Institute of Technology Shenzhen Graduate School, China. His research interests include wireless communications, channel coding and signal processing.

Xiaodong Lin received his Ph.D. degree in Information Engineering from Beijing University of Posts and Telecommunications, China, in 1998 and another Ph.D. degree (with Outstanding Achievement in Graduate Studies Award) in electrical and computer engineering from the University of Waterloo in 2008. He is currently an associate professor of Information Security with the Faculty of Business and Information Technology, University of Ontario Institute of Technology, Oshawa, Canada. His research interests include wireless network security, applied cryptography, computer forensics, software security, and wireless networking and mobile computing. He was the recipient of a Natural Sciences and Engineering

Research Council of Canada (NSERC) Canada Graduate Scholarships (CGS) Doctoral and the Best Paper Awards of the 18th International Conference on Computer Communications and Networks (ICCCN 2009), the 5th International Conference on Body Area Networks (BodyNets 2010), and IEEE ICC 2007.

Qinyu Zhang received his Ph.D. degree from the University of Tokushima, Japan, in 2003. From 1999 to 2003, he was an assistant professor at the University of Tokushima. He is currently a full professor of Harbin Institute of Technology Shenzhen Graduate School, where he serves as the Dean of School of Electronic and Information Engineering. He is a Senior Member of the IEEE. He is the Founding Chair of the IEEE Communications Society Shenzhen Chapter. His research interests include wireless communications, deep space communications, cognitive radio, and signal processing.

Table 1. Simulation parameters

Parameter                                      Assumption

Layout of cells                      37 hexagon cells; wrap-around
                                                  used
Radius of cells                                   250m
Central frequency                                 2GHz
[N.sub.RB] number of RBs                          100
[S.sub.m]                             46dBm ([approximately equal
                                                to] 40w)
[N.sub.T] X [N.sub.R]                            2 X 2
TTI                                               1ms
[alpha]                                           0.1
Channel model                         SCM (PathLoss + Shadowing +
                                              MIMO fading)
Minimal distance (TP and UE)                      35m
Height of transmit/receive antenna              35m/1.5m
Penetration loss                                  20dB
Traffic Model                                 Full Buffer
Speed of UE                                      10m/s
COPYRIGHT 2014 KSII, the Korean Society for Internet Information
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2014 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:coordinated multi-point
Author:Yu, Jia; Wu, Shaohua; Lin, Xiaodong; Zhang, Qinyu
Publication:KSII Transactions on Internet and Information Systems
Article Type:Report
Date:Nov 1, 2014
Words:8674
Previous Article:A novel routing protocol for cognitive radio networks with cooperation process.
Next Article:Ordered reverse k nearest neighbor search via on-demand broadcast.
Topics:

Terms of use | Privacy policy | Copyright © 2019 Farlex, Inc. | Feedback | For webmasters