Академический Документы
Профессиональный Документы
Культура Документы
Abstract—To improve the cellular energy efficiency, without inter-user interference. To meet this challenge, industry [3] and
sacrificing quality-of-service (QoS) at the users, the network academia [4] are shifting focus from user-deployed femtocells
topology must be densified to enable higher spatial reuse. We to operator-deployed SCAs. The latter can rely on reliable
analyze a combination of two densification approaches, namely
“massive” multiple-input multiple-output (MIMO) base stations backhaul connectivity and joint control/coordination of BS and
and small-cell access points. If the latter are operator-deployed, SCAs; the existence of SCAs can even be transparent to the
a spatial soft-cell approach can be taken where the multiple users, as in the soft-cell approach proposed for LTE in [3].
transmitters serve the users by joint non-coherent multiflow The total power consumption can be modeled with a static
beamforming. We minimize the total power consumption (both part that depends on the transceiver hardware and a dynamic
dynamic emitted power and static hardware power) while satis-
fying QoS constraints. This problem is proved to have a hidden part which is proportional to the emitted signal power [5]–
convexity that enables efficient solution algorithms. Interestingly, [7]. Massive MIMO and small-cell networks promise great
the optimal solution promotes exclusive assignment of users improvements in the dynamic part, but require more hardware
to transmitters. Furthermore, we provide promising simulation and will therefore increase the static part. In other words, dense
results showing how the total power consumption can be greatly network topologies must be properly deployed and optimized
improved by combining massive MIMO and small cells; this is
possible with both optimal and low-complexity beamforming. to actually improve the overall energy efficiency.
This paper analyzes the possible improvements in energy
I. I NTRODUCTION efficiency when the classical macro-cell topology is modified
The classical macro-cell network topology is well-suited for by employing massive MIMO at the BS and/or overlaying
providing wide-area coverage, but cannot handle the rapidly with SCAs. We assume perfect channel acquisition and a back-
increasing user numbers and QoS expectations that we see haul network that supports interference coordination; we thus
today—the energy efficiency would be very low. The road for- consider an ultimate bound on what is practically achievable.
ward seems to be a densified topology that enables very high The goal is to minimize the total power consumption while
spatial reuse. Two main approaches are currently investigated: satisfying QoS constraints at the users and power constraints
massive MIMO [1], [2] and small-cell networks [3], [4]. at the BS and SCAs. We show that this optimization problem
The first approach is to deploy large-scale antenna arrays has a hidden convex structure that enables finding the optimal
at existing macro base stations (BSs) [1]. This enables precise solution in polynomial time. The solution is proved to automat-
focusing of emitted energy on the intended users, resulting ically/dynamically assign each user to the optimal transmitter
in a much higher energy efficiency. The channel acquisition is (BS or SCA). A low-complexity algorithm based on classical
indispensable for massive MIMO, which requires the exploita- regularized zero-forcing (RZF) beamforming is proposed and
tion of channel reciprocity using time-division duplex (TDD). compared with the optimal solution. The potential merits of
This mode makes the channel estimation accuracy limited by different densified topologies are analyzed by simulations.
the number of users and not the number of BS antennas [1].
II. S YSTEM M ODEL
The second approach is to deploy an overlaid layer of
small-cell access points (SCAs) to offload traffic from BSs, We consider a single-cell downlink scenario where a macro
thus exploiting the fact that most data traffic is localized and BS equipped with NBS antennas should deliver information to
requested by low-mobility users. This approach reduces the K single-antenna users. In addition, there are S ≥ 0 SCAs that
average distance between users and transmitters, which trans- form an overlay layer and are arbitrarily deployed. The SCAs
late into lower propagation losses and higher energy efficiency are equipped with NSCA antennas each, typically 1 ≤ NSCA ≤
[4]. This comes at the price of having a highly heterogeneous 4, and characterized by strict power constraints that limit their
network topology where it is difficult to control and coordinate coverage area (see below). In comparison, the BS has generous
power constraints that can support high QoS targets in a large
E. Björnson is funded by the International Postdoc Grant 2012-228 from coverage area. The number of antennas, NBS , is anything from
The Swedish Research Council. This research has been supported by the ERC
Starting Grant 305123 MORE (Advanced Mathematical Tools for Complex 8 to several hundred—the latter means that NBS K and is
Network Engineering). known as massive MIMO. This scenario is illustrated in Fig. 1.
log2 (1 + SINRk ) ≥ γk , where γk is the fixed QoS target and
S
|hH 2
|hH 2
P
k,0 wk,0 | + k,j wk,j |
j=1
SCA S SINRk = K S (3)
|hH |hH 2 + σ2
P 2
P
k,0 wi,0 | + k,j wi,j | k
SCA 1 Base Station (BS) i=1 j=1
i6=k
The information symbols from the BS and the jth SCA to The weighting matrices Q0,` ∈ CNBS ×NBS , Qj,` ∈ CNSCA ×NSCA
user k are denoted xk,0 and xk,j , respectively, and originate for j = 1, . . . , S, are positive semi-definite. The corresponding
from independent Gaussian codebooks with unit power (in limits are qj,` ≥ 0. The parameters Qj,` , qj,` are fixed and can
mW); that is, xk,j ∼ CN (0, 1) for j = 0, . . . , S. These describe any combination of per-antenna, per-array, and soft-
symbols are multiplied with the beamforming vectors wk,0 ∈ shaping constraints [10]. We typically have q0,` qj,` for
CNBS ×1 and wk,j ∈ CNSCA ×1 to obtain the transmitted signals 1 ≤ j ≤ S, because the BS provides coverage. Our numerical
K evaluation considers per-antenna constraints of qj [mW] at the
jth transmitter, given by L0 = NBS , Lj = NSCA , qj,` = qj ∀`,
X
xj = wk,j xk,j , j = 0, . . . , S. (2)
k=1
and Qj,` with one at `th diagonal element and zero elsewhere.
We are now ready to formulate our optimization problem.
The beamforming vectors are the optimization variables in this
We want to minimize the total power consumption while
paper. Note that wk,j 6= 0 only for transmitters j that serve
satisfying the QoS constraints and the power constraints, thus
user k. This transmitter assignment is obtained automatically
and optimally from the optimization problem solved herein. minimize Pdynamic + Pstatic
wk,j ∀k,j
A. Problem Formulation subject to log2 (1 + SINRk ) ≥ γk ∀k,
(7)
This paper considers minimization of the total power con- K
X
H
sumption while satisfying QoS constraints for each user. We wk,j Qj,` wk,j ≤ qj,` ∀j, `.
will define both concepts before formulating the problem. k=1
The QoS constraints specify the information rate [bits/s/Hz] In the next section, we will prove that (7) can be reformu-
that each user should achieve in parallel. These are defined as lated as a convex optimization problem and thus is solvable
∗
in polynomial time using standard algorithms. Moreover, the 1) It is only served by the BS (i.e., Wk,j = 0, 1 ≤ j ≤ S);
∗
optimal power-minimizing solution is self-organizing in the 2) It is only served by the jth SCA (i.e., Wk,0 = 0 and
∗
sense that only one or a few transmitters will serve each user. Wk,i = 0 for i 6= j);
3) It is served by a combination of BS and SCAs, whereof
Remark 1. The static part, Pstatic , of the power consumption
at leastPone transmitter j has an active power constraint
depends on the number of SCAs and antennas. From an energy K ∗
` (i.e., k=1 tr(Qj,` Wk,j ) = qj,` ).
efficiency perspective, it therefore makes sense to put inactive
SCAs and antenna elements into sleep mode. On the other Proof: The proof is given in the appendix.
hand, such adaptive sleep mode techniques make the sensing This corollary shows that although users can be served by
of user mobility and new users complicated. There is also a multiflow transmission, it is usually optimal to assign one
non-negligible transient behavior when switching from sleep transmitter per user. Users that are close to a SCA are served
mode to active mode [5]. Since these problems are outside exclusively by it, while most other users are served by the BS.
the scope of this paper, we will instead compare setups with There are transition areas around each SCA where multiflow
different values on NBS , NSCA , and S by using simulations. transmission is utilized since the SCA is unable to fully
support the QoS targets. Corollary 1 is a positive result since
III. A LGORITHMS FOR N ON -C OHERENT C OORDINATION
a reduced transmission/reception complexity is often optimal.
This section derives algorithms for solving the optimization If the power constraints are removed, then the transition
problem (7). The QoS constraints in (7) are complicated areas disappear. We refer to [14] for prior work on dynamic
functions of the beamforming vectors, making the problem transmitter assignment by means of convex optimization.
non-convex in its original formulation. However, we will
prove that it has an underlying convex structure that can be A. Low-Complexity Algorithm
extracted using semi-definite relaxation. We generalize the The optimal beamforming for spatial soft-cell coordination
original approach in [11] to spatial multiflow transmission. can be computed in polynomial time using Theorem 1. This
To achieve a convex reformulation of (7), we use the complexity is relatively modest, but the algorithm becomes
H
notation Wk,j = wk,j wk,j ∀k, j. This matrix should be infeasible for real-time implementation when NBS and S grow
positive semi-definite, denoted as Wk,j 0, and have large. In addition, Theorem 1 provides a centralized algorithm
rank(Wk,j ) ≤ 1. Note that the rank can be zero, which that requires all channel knowledge to be gathered at the
implies that Wk,j = 0. By including the BS and SCAs in BS. Distributed algorithms can certainly be obtained using
the same sum expressions, we can rewrite (7) compactly as primal/dual decomposition techniques [8], but these require
S
X K
X iterative backhaul signaling of coupling variables—thus they
minimize ρj tr(Wk,j ) + Pstatic (8) are also infeasible for real-time implementations.
Wk,j 0 ∀k,j
j=0 k=1 Theorem 1 should be seen as the ultimate benchmark
subject to rank(Wk,j ) ≤ 1 ∀k, j, when evaluating low-complexity algorithms for non-coherent
S K coordination. To demonstrate the usefulness, we propose the
X 1 X
hH
k,j 1+ W k,j − W 2
i,j hk,j ≥ σk ∀k, low-complexity non-iterative Multiflow-RZF beamforming:
γ̃ k
j=0
K
i=1 1) Each transmitter j = 0, . . . , S computes
X −1
tr(Qj,` Wk,j ) ≤ qj,` ∀j, `, PKr 1 H Kr
i=1 σi2 hi,j hi,j + γ̃k qj I hk,j
k=1 uk,j =
PK
∀k,
1 H + Kr I −1 h
r
where the QoS targets have been transformed into SINR 2 hi,j h k,j
i=1 σi i,j γ̃k qj
targets of γ̃k = 2γk − 1 ∀k. The problem (8) is convex except H 2
gi,k,j = |hi,j uk,j | ∀i, k, Qj,`,k = uH
k,j Qj,` uk,j ∀`, k.
for the rank constraints, but we will now prove that these
constraints can be relaxed without losing optimality. 2) The jth SCA sends the scalars gi,k,j , Qj,`,k ∀k, i, ` to
the BS. The BS solves the convex optimization problem
Theorem 1. Consider the semi-definite relaxation of (8) where
S K
the rank constraints rank(Wk,j ) ≤ 1 are removed. This X X
becomes a convex semi-definite optimization problem. Further- minimize ρj pk,j + Pstatic (9)
pk,j ≥0 ∀k,j
∗ j=0 k=1
more, it will always have an optimal solution {Wk,j ∀k, j}
∗ K
where all matrices satisfy rank(Wk,j ) ≤ 1. X
subject to Qj,`,k pk,j ≤ qj,` ∀j, `,
Proof: The proof is given in the appendix. k=1
This theorem shows that the original problem (7) can be S K
X 1 X
solved as a convex optimization problem. This means that the pk,j gk,k,j 1+ − pi,j gk,i,j ≥ σk2 ∀k.
optimal solution is guaranteed in polynomial time [12]; for j=0
γ̃ k i=1
example, using the interior-point toolbox SeDuMi [13]. 3) The power allocation p∗k,j ∀k that solves
Further structure of the optimal solution can be obtained. p (9) is sent to
the jth SCA, which computes wk,j = p∗k,j uk,j ∀k.
∗
Corollary 1. Consider the optimal solution {Wk,j ∀k, j} to This algorithm applies the heuristic RZF beamforming (see
(8). For each user k there are three possibilities: e.g., [2]) to transform (7) into the power allocation problem
TABLE II
C HANNEL PARAMETERS IN THE N UMERICAL E VALUATION
Parameters Values
SCA 1 SCA 2 Macro cell radius 0.5 km
Radius
40 m
Carrier frequency / Number of subcarriers F = 2 GHz / C = 600
km
Total bandwidth / Subcarrier bandwidth 10 MHz / 15 kHz
5
.3
Small-scale fading distribution hk,j ∼ CN (0, Rk,j )
e0
c
an
Standard deviation of log-normal shadowing 7 dB
ist
D
Path and penetration loss at distance d (km) 148.1+37.6 log10 (d) dB
Radiu
BS s 0.5 km Special case: Within 40 m from SCA 127+30 log10 (d) dB
Noise variance σk2 (5 dB noise figure) −127 dBm
SCA 3 SCA 4
30
TABLE I
10
H ARDWARE PARAMETERS IN THE N UMERICAL E VALUATION 20 30 40 50 60 70 80 90 100
Antennas at the BS, NBS
Parameters Values
1 1 Fig. 3. Average total power consumption in the scenario of Fig. 2. We
Efficiency of power amplifiers ρ0
= 0.388, ρj
= 0.052 ∀j consider different NBS and NSCA , while the QoS constraints are 2 bits/s/Hz.
Circuit power per antenna η0 = 12.85 W, ηj = 0.8 W ∀j
Per-antenna constraints q0,` = 66, qj,` = 0.08 mW ∀j, `
NSCA ∈ {0, 1, 2, 3}. Fig. 3 shows the average total power
(9), which has the same low complexity irrespectively of the consumption (per subcarrier) in a scenario where the 10
number of antennas. The algorithm is non-iterative, but some users have QoS constraints of 2 bits/s/Hz. The optimal spatial
scalar parameters are exchanged between the BS and SCAs multiflow transmission is obtained using Theorem 1 and the
to enable coordination. In practice, only users in the vicinity convex optimization problems were solved by the algorithmic
of an SCA are affected by it, thus only a few parameters are toolbox SeDuMi [13], using the modeling language CVX [16].
exchanged per SCA while all other parameters are set to zero. Fig. 3 demonstrates that adding more hardware can substan-
tially decrease the total power consumption Pdynamic + Pstatic .
IV. N UMERICAL E VALUATIONS This means that the decrease in the dynamic part, Pdynamic ,
This section illustrates the analytic results and algorithms due to better energy-focusing and less propagation losses
of this paper in the scenario depicted in Fig. 2. This figure clearly outweigh the increase in the static part, Pstatic , from the
shows a circular macro cell overlaid by 4 small cells. There extra circuitry. Massive MIMO brings large energy efficiency
are 10 active users in the macro cell, whereof 6 users are improvements by itself, but the same power consumption
uniformly distributed in the whole cell and each SCA has one can be achieved with half the number of BS antennas (or
user uniformly distributed within 40 meters. We evaluate the less) by deploying a few single-antenna SCAs in areas with
average performance over user locations and channel realiza- active users. Further improvements in energy efficiency are
tions. Table I shows the hardware parameters that characterize achieved by having multi-antenna SCAs; a network topology
the power consumption and is based on [6, Table 7]. that combines massive MIMO and small cells is desirable to
The channels are modeled similarly to Case 1 for Hetero- achieve high energy efficiency with little additional hardware.
geneous deployments in the 3GPP LTE standard [15], but Note that the power is shown in dBm, thus there is 100-fold
the small-scale fading is modified to reflect recent works improvement from the highest to the lowest point in Fig. 3.
on massive MIMO. We assume Rayleigh small-scale fading: Although the system allows for multiflow transmission, the
hk,j ∼ CN (0, Rk,j ). The correlation matrix is spatially uncor- simulation shows only a 0-5% probability of serving a user
related, Rk,j ∝ I, between the jth SCA and each user k. The by multiple transmitters. This is in line with Corollary 1. The
correlation matrix between the BS and each user is modeled main impact of increasing NSCA is that each SCA is likely to
according to the physical channel model in [2, Eq. (34)], where being allocated more than one user to serve exclusively; the
the main characteristics are antenna correlation and reduced- probability is 50-80% for NSCA = 3 but decreases with NBS .
rank channels. Note that the propagation loss is different for Next, Fig. 4 considers NBS = 50 and NSCA = 2 for different
BS and SCAs; see Table II for all channel model parameters. QoS constraints. Three beamforming algorithms are compared:
We first analyze the impact of having different number 1) Optimal beamforming using only the BS; 2) Multiflow-RZF
of antennas at the BS and SCAs: NBS ∈ {20, 30, . . . , 100}, proposed in Section III-A; and 3) Optimal spatial soft-cell
35 √
Suppose wk∗ = pk uk is the optimal solution to (7),
Total Power per Subcarrier [dBm]