Full-Duplex MIMO Small-Cell Networks: Performance Analysis

Italo Atzeni and Marios Kountouris Mathematical and Algorithmic Sciences Lab, France Research Center, Huawei Technologies Co. Ltd.
{italo.atzeni, marios.kountouris}@huawei.com

Abstract

Full-duplex small-cell relays with multiple antennas constitute a core element of the envisioned 5G network architecture. In this paper, we use stochastic geometry to analyze the performance of wireless networks with full-duplex multi-antenna small cells, with particular emphasis on the probability of successful transmission. To achieve this goal, we additionally characterize the distribution of the self-interference power of the full-duplex nodes. The proposed framework reveals useful insights on the benefits of full-duplex with respect to half-duplex in terms of network throughput.

Full-duplex, multiple antennas, small cells, performance analysis, stochastic geometry.

I Introduction

The employment of full-duplex (FD) technology in wireless networks has been recognized as a promising solution to cope with the ever-growing demand for high data rates. A key drawback of FD wireless communication is the self-interference received at the FD nodes from their own transmission. However, thanks to recent advances in self-interference mitigation techniques [1], it is now possible to implement FD radios in practical settings [2]. In this regard, small-cell (SC) systems prove especially suitable for the deployment of FD technology due their low transmit powers and the low mobility of their users [3].

Several recent works, such as [4, 5], have examined the performance of hybrid FD/HD large-scale networks, despite considering only single-antenna nodes; in addition, the self-interference channel gain has been modeled as a constant value, which is a very coarse approximation and is only meaningful when digital cancellation is applied [4, 6]. On the one hand, it is timely and relevant to investigate FD nodes with multiple antennas in view of the promising concept of FD multiple-input multiple-output (MIMO) relays [6], even if the extension from the single-antenna to the multiple-antenna case sensibly complicates the analysis. On the other hand, the residual self-interference channel is known to be subject to Ricean fading¹ and, therefore, its modeling in a MIMO context represents a challenging problem when receive combining and transmit beamforming techniques are employed. In addition, the precise knowledge of the distribution of the self-interference power is essential for a rigorous system-level performance analysis.

In this paper, we fill these gaps by providing the following contributions: i) using powerful tools from stochastic geometry, we study the performance of wireless networks with randomly distributed FD MIMO nodes and derive tight bounds for the probability of successful transmission; ii) we characterize the distribution of the FD self-interference power under Ricean fading for arbitrary receive and transmit beamforming strategies. In our setting, the FD nodes resemble small-cell relays, which are envisioned to be at the foundation of 5G [8]. Finally, numerical results are reported to corroborate our theoretical findings and to establish under which conditions the employment of FD is beneficial for the network.

Fig. 1: System model with full-duplex MIMO small cells (SC $_{F D}^{(M I M O)}$ ), half-duplex backhaul base stations (BH $_{H D}$ ), and half-duplex user terminals (UT $_{H D}$ ), with corresponding desired transmissions and interferences.

Ii System Model

Ii-a System Setup

Consider the scenario in Figure 1, where a set of FD SCs acts as relays between a set of backhaul (BH) base stations (BSs) and a set of mobile user terminals (UTs), both operating in half-duplex (HD) mode; all communications occur in the same frequency band. In our setting, the SCs are equipped with multiple antennas, whereas the UTs have a single antenna; on the other hand, a multiple antenna BH BS performing space division multiple access (SDMA) and sending one stream to the SC can be considered, hence being equivalently seen as single-antenna BS by each SC. During a given time-slot, we assume that each SC communicates exactly with one desired BH BS and with one desired UT. The analysis of the downlink (i.e., from the BH BS to the mobile UT) and of the uplink (i.e., from the mobile UT to the BH BS) are equivalent since they both consist of a succession of a single-input multiple-output and a multiple-input single-output transmissions: therefore, in the following, we generalize our model and refer to HD transmitting and receiving nodes.

Let us thus introduce the stationary, independently marked Poisson point process (PPP) $Φ_{m} ≜ {(x_{n}, ˜ m (x_{n}), ˆ m (x_{n}))}$ on $R^{2} \times R^{2} \times R^{2}$ . We use $Φ ≜ {x_{n}}$ to denote the PPP of the FD nodes with spatial density $λ$ ; likewise, $˜ Φ ≜ ˜ m (Φ) = {˜ m (x)}_{x \in Φ}$ and $ˆ Φ ≜ ˆ m (Φ) = {ˆ m (x)}_{x \in Φ}$ are the isotropic marks of $Φ$ denoting the HD transmitting and receiving nodes, respectively, with fixed distances of the desired links given by $∥ x - ˜ m (x) ∥ = ˜ R$ and $∥ x - ˆ m (x) ∥ = ˆ R$ , $\forall x \in Φ$ : evidently, $˜ Φ$ and $ˆ Φ$ are PPPs dependent on $Φ$ and have also density $λ$ . In our scenario, it is reasonable to assume that $˜ R ≫ ˆ R$ , since the SCs cover a rather small area compared to the range of the BH BSs. For convenience, in the rest of the paper we use the notation ${˜ m}_{x} ≜ ˜ m (x)$ and ${ˆ m}_{x} ≜ ˆ m (x)$ .

Ii-B Channel Model

We assume that the FD nodes and the HD transmitting nodes transmit with constant power $ρ$ and $˜ ρ$ , respectively; furthermore, the FD nodes are equipped with $N_{R}$ receive antennas and $N_{T}$ transmit antennas. The propagation through the wireless channel is characterized as the combination of a pathloss attenuation and a small-scale fading. The pathloss function between the nodes $x$ and $z$ given by $l (z, x) ≜ ∥ z - x ∥^{- α}$ , with pathloss exponent $α > 2$ .

Given transmitting node $x$ and receiving node $z$ , we use the following notation.² The channels are denoted as $H_{x z} \in C^{N_{R} \times N_{T}}$ if $x, z \in Φ$ , as $h_{x z} \in C^{N_{R}}$ if $x \in ˜ Φ$ and $z \in Φ$ , as $h_{x z} \in C^{N_{T}}$ if $x \in Φ$ and $z \in ˆ Φ$ , and as $h_{x z} \in C$ if $x \in ˜ Φ$ and $z \in ˆ Φ$ ; in particular, $H_{x x}$ models the self-interference at $x \in Φ$ resulting from its own transmission. Furthermore, $s_{x}$ represents the data symbol transmitted by $x$ with $E {| s_{x} |^{2}} = 1$ , whereas the additive noise is denoted by $n_{z} \in C^{N_{R}}$ if $z \in Φ$ and by $n_{z} \in C$ if $z \in ˆ Φ$ , with elements distributed independently as $C N (0, σ^{2})$ . Lastly, $v_{z} \in C^{N_{R}}$ indicates the receive combining vector applied by $z \in Φ$ and $w_{x} \in C^{N_{T}}$ is the transmit beamforming vector applied by $x \in Φ$ , with $∥ v_{z} ∥^{2} = ∥ w_{x} ∥^{2} = 1$ .

We assume that all the channels, except the self-interference channel, are subject to Rayleigh fading with elements distributed independently as $C N (0, 1)$ . On the other hand, the self-interference channel is subject to Ricean fading [7] and, therefore, the elements of $H_{x x}$ are distributed independently as $C N (μ, ν^{2})$ . In this regard, one can measure the Ricean $K$ -factor and the self-interference attenuation $Ω$ and determine the mean and standard deviation of $H_{x x}$ as (cf. [9])

μ ≜ \sqrt{\frac{K Ω}{K + 1}}, ν ≜ \sqrt{\frac{Ω}{K + 1}} .

(1)

Ii-C SINR Characterization

In this section, we characterize the signal-to-interference-plus-noise ratio (SINR) for the FD nodes and the HD receiving nodes, which are needed in the next section to analyze the probability of successful transmission. In doing so, we study the first hop (i.e., the SINR at the FD nodes) and the second hop (i.e., the SINR at the HD receiving nodes) separately under the assumption that the whole point process is reshuffled after the first hop (see details in Section III).

First Hop: Consider a reference FD node indexed by $k$ . Building on Slivnyak’s theorem [10, Ch. 8.5], we assume that this is located at the origin and, due to the stationarity of $Φ$ , the statistics of its signal reception are seen by any FD node: we can thus write $l (k, x) = | X_{x} |^{- α}$ , with $| X_{x} |$ being the distance of $x$ from the origin. Hence, the received signal at FD node $k$ (its desired transmitter being ${˜ m}_{k}$ ) is given by

	$y_{k} ≜$	$\sqrt{˜ ρ} {˜ R}^{- \frac{α}{2}} h_{{˜ m}_{k} k} s_{{˜ m}_{k}}      (a) + \sum ℓ \in Φ ∖ {k} \sqrt{ρ} \| X_{ℓ} \|^{- \frac{α}{} 2} H_{ℓ k} w_{ℓ} s_{ℓ}      (b)$
		$+ \sum ℓ \in Φ ∖ {k} \sqrt{˜ ρ} \| X_{{˜ m}_{ℓ}} \|^{- \frac{α}{2}} h_{{˜ m}_{ℓ} k} s_{{˜ m}_{ℓ}}      (c) + \sqrt{ρ} H_{k k} w_{k} s_{k}      (d) + n_{k}$		(2)

where (a) represents the desired signal, (b) and (c) indicate the interference coming from FD node $ℓ$ and its associated HD transmitting node ${˜ m}_{ℓ}$ , respectively, and (d) represents the self-interference. Given the receive combining vector $v_{k}$ , the resulting SINR reads as

{S I N R}_{k}

≜ \frac{˜ ρ {˜ R}^{- α} S_{{˜ m}_{k} k}}{I_{k} + σ^{2}}

(3)

where we have defined

(4)

and where $I_{k}$ is the overall interference at $k$ , i.e.,

I_{k}

≜ \sum ℓ \in Φ ∖ {k} (ρ | X_{ℓ} |^{- α} S_{ℓ k} + ˜ ρ | X_{{˜ m}_{ℓ}} |^{- α} S_{{˜ m}_{ℓ} k}) + ρ S_{k k} .

(5)

The success probability of the first hop is derived in Section III-A.

Second Hop: Consider a reference HD receiving node indexed by ${ˆ m}_{k}$ . Again, following Slivnyak’s theorem, we assume that this is located at the origin and, due to the stationarity of $ˆ Φ$ , the statistics of its signal reception are seen by any HD receiving node: we can thus write $l ({ˆ m}_{k}, x) = | X_{x} |^{- α}$ . Hence, the received signal at HD receiving node ${ˆ m}_{k}$ (its desired transmitter being $k$ ) is given by

	$y_{{ˆ m}_{k}} ≜$	$\sqrt{ρ} {ˆ R}^{- \frac{α}{2}} h_{k {ˆ m}_{k}}^{H} w_{k} s_{k}      (a) + \sum ℓ \in Φ ∖ {k} \sqrt{ρ} \| X_{ℓ} \|^{- \frac{α}{2}} h_{ℓ {ˆ m}_{k}}^{H} w_{ℓ} s_{ℓ}      (b)$
		$+ \sum ℓ \in Φ \sqrt{˜ ρ} \| X_{{˜ m}_{ℓ}} \|^{- \frac{α}{2}} h_{{˜ m}_{ℓ} {ˆ m}_{k}} s_{{˜ m}_{ℓ}}      (c) + n_{{ˆ m}_{k}}$		(6)

where (a) represents the desired signal, (b) indicates the interference coming from FD node $ℓ$ , and (c) is the interference from HD transmitting node ${˜ m}_{ℓ}$ . The resulting SINR is given by

{S I N R}_{{ˆ m}_{k}}

≜ \frac{ρ {ˆ R}^{- α} S_{k {ˆ m}_{k}}}{I_{{ˆ m}_{k}} + σ^{2}}

(7)

where we have defined

S_{x {ˆ m}_{k}} ≜ {\begin{matrix} | h_{x ˆ m_{k}}^{H} w_{x} |^{2}, & x \in Φ | h_{x {ˆ m}_{k}} |^{2}, & x \in ˜ Φ \end{matrix}

(8)

and where $I_{{ˆ m}_{k}}$ is the overall interference at ${ˆ m}_{k}$ , i.e.,

I_{{ˆ m}_{k}} ≜ \sum ℓ \in Φ ∖ {k} ρ | X_{ℓ} |^{- α} S_{ℓ {ˆ m}_{k}} + \sum ℓ \in Φ ˜ ρ | X_{{˜ m}_{ℓ}} |^{- α} S_{{˜ m}_{ℓ} {ˆ m}_{k}} .

(9)

The success probability of the second hop is derived in Section III-B.

Iii Success Probability

The successful transmission of a packet over the complete path, i.e., from the HD transmitting node to the HD receiving node through the FD node, is given by the joint ccdf of ${S I N R}_{k}$ and ${S I N R}_{{ˆ m}_{k}}$ , which is denoted by [11] for a given SINR threshold $θ$ (without loss of generality, we consider the same SINR threshold for the two hops). Assuming no correlation between the two hops due to independent sampling of a point process being reshuffled after each hop, i.e., the transmission in the two hops occurs over two uncorrelated instances of $Φ_{m}$ , it follows that

P_{s u c} = P_{s u c}^{(1)} P_{s u c}^{(2)}

(10)

where we have defined $P_{s u c}^{(1)} ≜ P ({S I N R}_{k} > θ)$ and $P_{s u c}^{(2)} ≜ P ({S I N R}_{{ˆ m}_{k}} > θ)$ . The case where the interference is spatio-temporally correlated will be analyzed in a longer version of this paper. Note that, based on the Fortuin-Kasteleyn-Ginibre inequality, the uncorrelated case considered here can be shown to be a lower bound on the network performance. In addition, for notational simplicity, we assume that the system performance is interference-limited and, hence, we consider $I_{k} ≫ σ^{2}$ and $I_{{ˆ m}_{k}} ≫ σ^{2}$ .

Iii-a First Hop

In this section, we analyze the success probability of the first hop $P_{s u c}^{(1)} = P ({S I N R}_{k} > θ)$ , i.e., the probability of successful transmission from HD transmitting node ${˜ m}_{k}$ to FD node $k$ . First, considering ${S I N R}_{k}$ in (3), we have $S_{{˜ m}_{k} k} \sim χ_{2 N_{R}}^{2}$ (desired signal) and $S_{x k} \sim χ_{2}^{2}$ , $\forall x \in (Φ ∖ {k}) \cup (˜ Φ ∖ {{˜ m}_{k}})$ (interferers).³ The following lemma gives a tight approximation of the distribution of the self-interference power $S_{k k}$ .

Lemma 1.

The self-interference power $S_{k k} = | v_{k}^{H} H_{k k} w_{k} |^{2}$ is Gamma distributed⁴ with shape parameter $a$ and scale parameter $b$ given by

a ≜ \frac{(μ^{2} + ν^{2})^{2}}{γ μ^{4} + 2 μ^{2} ν^{2} + ν^{4}}, b ≜ \frac{γ μ^{4} + 2 μ^{2} ν^{2} + ν^{4}}{μ^{2} + ν^{2}}

(11)

respectively, where $μ$ and $ν$ are the mean and standard deviation, respectively, of the self-interference channel $H_{k k}$ (see (1)) and where we have defined

γ ≜ \frac{4 N_{R} N_{T} - (N_{R} + 1) (N_{T} + 1)}{(N_{R} + 1) (N_{T} + 1)} .

(12)

Proof:

See Appendix A-A. ∎

Lemma 1 represents a key result of this paper since it provides a formal characterization of the self-interference power experienced by a FD MIMO node with arbitrary beamforming vectors, based on the knowledge of the parameters $K$ and $Ω$ (whose values are available either by design or by measurements).

The next theorem provides the success probability of the first hop.

Theorem 1.

The success probability of the first hop is given by

P_{s u c}^{(1)}

≜ N_{R} - 1 \sum n = 0 [\frac{(- s)^{n}}{n!} \frac{d^{n}}{d s^{n}} L_{I_{k}} (s)]_{s = θ {˜ ρ}^{- 1} {˜ R}^{α}}

(13)

where

(14)

is the Laplace transform of $I_{k}$ (cf. (5)), where we have defined

Υ (s) ≜ \int_{0}^{\infty} (2 π - \frac{1}{1 + s ρ r^{- α}} Ψ (s, r)) r d r

(15)

with

Ψ (s, r) ≜ \int_{0}^{2 π} \frac{d φ}{1 + s ˜ ρ ({˜ R}^{2} + r^{2} + 2 ˜ R r cos φ)^{- \frac{α}{2}}} .

(16)

Proof:

See Appendix A-B. ∎

Given the integral form of $Υ (s)$ in (15), the success probability $P_{s u c}^{(1)}$ is not in closed-form and needs to be evaluated numerically; nonetheless, we derive the following lower and upper bounds.

Corollary 1.

The Laplace transform of $I_{k}$ in (14) is bounded as $L_{I_{k}} (s) \in [L_{I_{k}}^{(min)} (s), L_{I_{k}}^{(max)} (s)]$ , with

	$L_{I_{k}}^{(min)} (s)$	$≜ \frac{1}{(1 + s b ρ)^{a}} exp (- λ Υ^{(max)} (s)),$		(17)
	$L_{I_{k}}^{(max)} (s)$	$≜ \frac{1}{(1 + s b ρ)^{a}} exp (- λ Υ^{(min)} (s))$		(18)

where we have defined

	$Υ^{(min)} (s)$	$≜ (1 + \frac{2}{α}) (ρ + ˜ ρ) \frac{π^{2} s^{\frac{2}{α}}}{α sin (\frac{2 π}{α})},$		(19)
	$Υ^{(max)} (s)$	$≜ 2 (ρ + ˜ ρ) \frac{π^{2} s^{\frac{2}{α}}}{α sin (\frac{2 π}{α})} .$		(20)

Then, the lower and upper bounds of the success probability of the first hop $P_{s u c}^{(1)}$ are obtained by substituting $L_{I_{k}} (s)$ in (24) with $L_{I_{k}}^{(min)} (s)$ and $L_{I_{k}}^{(max)} (s)$ , respectively.

Proof:

See Appendix A-C. ∎

Remark 1.

In order to efficiently compute the derivatives of the bounds (17)–(18), one can resort to the well-known general Leibniz rule [12, Eq. 3.3.8] for the differentiation of the product of two functions $f (s) g (s)$ : for instance, for $L_{I_{k}}^{(min)} (s)$ , we can write $f (s) = \frac{1}{(1 + s b ρ)^{a}}$ and $g (s) = exp (- λ Υ^{(max)} (s))$ . In turn, the derivatives of $g (s)$ can be computed using Faà di Bruno’s formula [13] for the differentiation of the composition of two functions $(g_{1} \circ g_{2}) (s)$ , with $g_{1} (s) = exp (s)$ and $g_{2} (s) = - λ Υ^{(max)} (s)$ . These considerations apply equivalently to the bounds provided in Corollary 3.

The following corollary provides a sufficient condition under which FD outperforms HD in terms of throughput in the case of single-antenna nodes.

Corollary 2.

Assume that $N_{R} = N_{T} = 1$ and let $s = θ {˜ ρ}^{- 1} {˜ R}^{α}$ . The lower bound for an achievable throughput in the first hop is given by

T_{F D}^{(min)} (s) ≜ \frac{2}{(1 + s b ρ)^{a}} exp (- λ Υ^{(max)} (s)) {log}_{2} (1 + θ)

(21)

whereas, if the FD nodes operate in HD mode, the upper bound for an achievable throughput is given by

T_{H D}^{(max)} (s) ≜ exp (- λ (1 + \frac{2}{α}) ˜ ρ \frac{π^{2} s^{\frac{2}{α}}}{} α sin (\frac{2 π}{α})) {log}_{2} (1 + θ) .

(22)

Then, $T_{F D}^{(min)} (s) \geq T_{H D}^{(max)} (s)$ whenever the following condition holds:

(1 + s b ρ)^{a} \leq 2 exp (- λ ((1 - \frac{2}{} α) ˜ ρ + 2 ρ) \frac{π^{2} s^{\frac{2}{α}}}{} α sin (\frac{2 π}{α})) .

(23)

Iii-B Second Hop

In this section, we analyze the success probability of the second hop $P_{s u c}^{(2)} = P ({S I N R}_{{ˆ m}_{k}} > θ)$ , i.e., the probability of successful transmission from FD node $k$ to HD receiving node ${ˆ m}_{k}$ . First, considering ${S I N R}_{{ˆ m}_{k}}$ in (7), we have $S_{k {ˆ m}_{k}} \sim χ_{2 N_{T}}^{2}$ (desired signal) and $S_{x {ˆ m}_{k}} \sim χ_{2}^{2}$ , $\forall x \in (Φ ∖ {k}) \cup ˜ Φ$ (interferers).

The success probability of the second hop is given next in Theorem 2, whereas its bounds are provided in Corollary 3.

Theorem 2.

The success probability of the second hop is given by

P_{s u c}^{(2)} ≜ N_{T} - 1 \sum n = 0 [\frac{(- s)^{n}}{n!} \frac{d^{n}}{d s^{n}} L_{I_{{ˆ m}_{k}}} (s)]_{s = θ ρ^{- 1} {ˆ R}^{α}}

(24)

where

L_{I_{{ˆ m}_{k}}} (s) ≜ Ψ (s, ˆ R) exp (- λ Υ (s))

(25)

is the Laplace transform of $I_{{ˆ m}_{k}}$ (cf. (9)), with $Υ (s)$ and $Ψ (s, r)$ defined in (15) and in(16), respectively.

Proof:

See Appendix B-A. ∎

Corollary 3.

The Laplace transform of $I_{{ˆ m}_{k}}$ in (25) is bounded as $L_{I_{{ˆ m}_{k}}} (s) \in [L_{I_{{ˆ m}_{k}}}^{(min)} (s), L_{I_{{ˆ m}_{k}}}^{(max)} (s)]$ , with

	$L_{I_{{ˆ m}_{k}}}^{(min)} (s)$	$≜ \frac{1}{1 + s ˜ ρ (˜ R - ˆ R)^{- α}} exp (- λ Υ^{(max)} (s))$		(26)
	$L_{I_{{ˆ m}_{k}}}^{(max)} (s)$	$≜ \frac{1}{1 + s ˜ ρ (˜ R + ˆ R)^{- α}} exp (- λ Υ^{(min)} (s))$		(27)

with $Υ^{(min)} (s)$ and $Υ^{(max)} (s)$ defined in (19) and in (20), respectively. Then, the lower and upper bounds of the success probability of the second hop $P_{s u c}^{(2)}$ are obtained by substituting $L_{I_{{ˆ m}_{k}}} (s)$ in (24) with $L_{I_{{ˆ m}_{k}}}^{(min)} (s)$ and $L_{I_{{ˆ m}_{k}}}^{(max)} (s)$ , respectively.

Proof:

See Appendix B-B. ∎

Fig. 2: Success probability: simulations and theoretical bounds for different values of the spatial density $λ$ , with $Ω = - 80$ dB and $θ = 0$ dB.

Iv Numerical Results

In this section, we present numerical results to assess our theoretical findings and, specifically, to compare the performance of FD with respect to HD. In the following, the pathloss exponent is $α = 4$ , the distances characterizing the marked PPP are set to $˜ R = 5$ m and $ˆ R = 0.5$ m, the transmit powers are $ρ = 0.5$ W and $˜ ρ = 1$ W, and the considered SINR threshold is $θ = 0$ dB; the parameters $a$ and $b$ of the self-interference power are computed according to (11), where $μ$ and $ν$ are obtained from (1) with Ricean $K$ -factor $K = 1$ (see [7] for an experimental characterization of $K$ ) and self-interference attenuation $Ω = - 80$ dB. Lastly, the FD nodes adopt maximum ratio combining and maximum ratio transmission and, therefore, the beamforming vectors are given by

v_{z} = \frac{h_{{˜ m}_{z} z}}{∥ h_{{˜ m}_{z} z} ∥}, w_{x} = \frac{h_{x {ˆ m}_{x}}}{∥ h_{x {ˆ m}_{x}} ∥} .

(28)

Figure 2 plots the success probability $P_{s u c}$ in (10) over different values of the density $λ$ . Remarkably, the theoretical bounds obtained in the previous section are reasonably tight. Furthermore, the employment of multiple antennas allows to mitigate the effect of the self-interference of the FD nodes, thus producing substantial SINR gains (observe that to higher values of $N_{R}$ correspond more terms in the summation (13)).

We now focus our attention on the first hop (subject to self-interference) in order to analyze the benefits of FD. With this objective in mind, we introduce the minimum throughput gain

{T G}^{(min)} ≜ \frac{T_{F D}^{(min)}}{T_{H D}^{(max)}},

(29)

with $T_{F D}^{(min)}$ and $T_{H D}^{(max)}$ defined in (21) and (22), respectively: this parameter denotes the worst-case gain of FD mode over HD mode in terms of throughput, with ${T G}^{(min)} > 1$ indicating that FD outperforms the equivalent HD setup. Figure 3 plots ${T G}^{(min)}$ over different values of the self-interference attenuation $Ω$ with $λ = 10^{- 3}$ , whereas all the other parameters are the same as in the previous simulation. In this setting, we have ${T G}^{(min)} \geq 1$ even for moderate values of the attenuation and, in the specific, when: $Ω \leq - 52$ dB for $N_{R} = N_{T} = 1$ , $Ω \leq - 44$ dB for $N_{R} = N_{T} = 2$ , $Ω \leq - 36$ dB for $N_{R} = N_{T} = 4$ , and $Ω \leq - 28$ dB for $N_{R} = N_{T} = 8$ . Moreover, the minimum throughput gain is analyzed in Figure 4 as a function of the SINR threshold $θ$ with $λ = 10^{- 3}$ and $Ω = - 80$ dB: in this respect, it is shown that FD achieves improved performance with respect to HD for any reasonable value of $θ$ .

Fig. 3: Comparison between FD and HD modes in the first hop: minimum throughput gain for different values of the self-interference attenuation $Ω$ , with $λ = 10^{- 3}$ and $θ = 0$ dB.

Fig. 4: Comparison between FD and HD modes in the first hop: minimum throughput gain for different values of the SINR threshold $θ$ , with $λ = 10^{- 3}$ and $Ω = - 80$ dB.

V Conclusions

This paper analyzes the performance of wireless networks with FD MIMO small cells using stochastic geometry. We characterize the distribution of the self-interference power of the FD nodes for arbitrary receive/transmit beamforming strategies and we derive tight bounds for the success probability. Our framework highlights the beneficial effect of FD, which produces substantial throughput gains over HD for realistic values of number of antennas, node density, self-interference attenuation, and SINR threshold.

Appendix A Success Probability of the First Hop

A-a Proof of Lemma 1

Due to space limitations, we only provide here a sketch of the proof. For notational simplicity, in the following we omit the sub-indices in the beamforming vectors and in the channel matrix and write $S_{k k} ≜ | v^{H} H w |^{2}$ , with

| v^{H} H w |^{2} = N_{R} \sum i, k = 1 N_{T} \sum j, ℓ = 1 v_{i}^{*} v_{k} h_{i j} h_{k ℓ}^{*} w_{j} w_{ℓ}^{*}

(30)

where $v_{i}$ is the $i$ -th element of $v ≜ (v_{i})_{i = 1}^{N_{R}}$ , $w_{j}$ is the $j$ -th element of $w ≜ (w_{j})_{j = 1}^{N_{T}}$ , and $h_{i j}$ is the $(i, j)$ -th element of $H ≜ ((h_{i j})_{i = 1}^{N_{R}})_{j = 1}^{N_{T}}$ . Recalling that $h_{i j} \sim C N (μ, ν^{2})$ , we have $E (| h_{i j} |^{2}) = μ^{2} + ν^{2}$ and $E (| h_{i j} |^{4}) = μ^{4} + 4 μ^{2} ν^{2} + 2 ν^{4}$ ; on the other hand, for any normalized receive/transmit beamforming vector, we have $E (| v_{i} |^{4}) = \frac{1}{N_{R} (N_{R} + 1)}$ and $E (| w_{j} |^{4}) = \frac{1}{N_{T} (N_{T} + 1)}$ . Building on the central limit theorem for causal functions [14], we approximate a sum of positive random variables $x = \sum_{i} x_{i}$ by a Gamma distribution with shape parameter $a$ and scale parameter $b$ defined, respectively, as

a ≜ \frac{(E (x))^{2}}{V a r (x)}, a ≜ \frac{V a r (x)}{E (x)} .

(31)

	$L_{I_{k}} (s)$	$= E (exp (- s ρ S_{k k})) E (\prod ℓ \in Φ ∖ {k} exp (- s (ρ \| X_{ℓ} \|^{- α} S_{ℓ k} + ˜ ρ \| X_{{˜ m}_{ℓ}} \|^{- α} S_{{˜ m}_{ℓ} k})))$		(38)
	$L_{I_{{ˆ m}_{k}}} (s)$	$= E (exp (- s ˜ ρ \| X_{{˜ m}_{k}} \|^{- α} S_{{˜ m}_{k} {ˆ m}_{k}})) E (\prod l \in Φ ∖ {k} exp (- s (ρ \| X_{ℓ} \|^{- α} S_{ℓ {ˆ m}_{k}} + ˜ ρ \| X_{{˜ m}_{ℓ}} \|^{- α} S_{{˜ m}_{ℓ} {ˆ m}_{k}})))$		(41)

In order to compute $a$ and $b$ , we need to derive the second and fourth moments of $| v^{H} H w |^{2}$ . Let $σ_{i}$ denote the $i$ -th singular value of $H$ and $N_{min} ≜ min (N_{R}, N_{T})$ : from (30), after some algebraic manipulations we obtain

	$E (\| v^{H} H w \|^{2})$	$= E (N_{R} \sum i = 1 N_{T} \sum j = 1 \| v_{i} \|^{2} \| h_{i j} \|^{2} \| w_{j} \|^{2})$		(32)
		$= μ^{2} + ν^{2}$		(33)

and

$E (\| v^{H} H w \|^{4})$	$= E (N_{min} \sum i = 1 \| v_{i} \|^{4} \| σ_{i} \|^{4} \| w_{j} \|^{4})$
	$+ 2 E (N_{min} \sum \begin{matrix} i, j = 1 i \neq j \end{matrix} \| v_{i} \|^{2} \| v_{j} \|^{2} \| σ_{i} \|^{2} \| σ_{j} \|^{2} \| w_{i} \|^{2} \| w_{j} \|^{2})$	(34)
	$= \frac{4 N_{R} N_{T}}{(N_{R} + 1) (N_{T} + 1)} μ^{4} + 4 μ^{2} ν^{2} + 2 ν^{4} .$	(35)

Since , we readily obtain $a$ and $b$ in (11) from (31). ∎

A-B Proof of Theorem 1

The success probability of the first hop is given by

	$P_{s u c}^{(1)}$	$= P (\frac{˜ ρ {˜ R}^{- α} S_{{˜ m}_{k} k}}{I_{k}} > θ)$		(36)
		$= P (S_{{˜ m}_{k} k} > θ {˜ ρ}^{- 1} {˜ R}^{α} I_{k})$		(37)

where $I_{k}$ is defined in (5) and denotes the overall interference at $k$ . Since FD node $k$ is equipped with $N_{R}$ receive antennas, the power of its desired signal is distributed as $S_{{˜ m}_{k} k} \sim χ_{2 N_{R}}^{2}$ and our case falls into the general framework [15]; hence, the expression in (13) results from applying [15, Th. 1]. On the other hand, the Laplace transform of $I_{k}$ is obtained as in (38) at the top of the page using the moment-generating function of the Gamma and of the $χ_{2}^{2}$ distributions. Finally, applying [4, Th. 1], the expression in (14) readily follows. ∎

A-C Proof of Corollary 1

Building on [4, Th. 2], we obtain that $Υ (s)$ in (15) is bounded as $Υ (s) \in [Υ^{(min)} (s), Υ^{(max)} (s)]$ , with $Υ^{(max)} (s)$ and $Υ^{(min)} (s)$ defined in (19) and in (20), respectively, from which we immediately derive the lower and upper bounds of $L_{I_{k}} (s)$ in (17)–(18). ∎

Appendix B Success Probability of the Second Hop

B-a Proof of Theorem 2

The success probability of the second hop is given by

	$P_{s u c}^{(2)}$	$= P (\frac{ρ {ˆ R}^{- α} S_{k {ˆ m}_{k}}}{I_{{ˆ m}_{k}}} > θ)$		(39)
		$= P (S_{k {ˆ m}_{k}} > θ ρ^{- 1} {ˆ R}^{α} I_{{ˆ m}_{k}})$		(40)

where $I_{{ˆ m}_{k}}$ is defined in (9) and denotes the overall interference at ${ˆ m}_{k}$ . Since FD node $k$ is equipped with $N_{T}$ transmit antennas, the power of the desired signal of ${ˆ m}_{k}$ is distributed as $S_{k {ˆ m}_{k}} \sim χ_{2 N_{T}}^{2}$ and, similarly as in Appendix A-B, the expression in (24) results from applying [15, Th. 1]. On the other hand, the Laplace transform of $I_{{ˆ m}_{k}}$ is obtained as in (41) at the top of the page using the moment-generating function of the $χ_{2}^{2}$ distribution. Again, we resort to [4, Th. 2] and the expression in (25) readily follows. ∎

B-B Proof of Corollary 3

Given the definition of $Ψ (s, r)$ in (16), we observe that

Ψ (s, ˆ R) \in [\frac{1}{1 + s ˜ ρ (˜ R - ˆ R)^{- α}}, \frac{1}{1 + s ˜ ρ (˜ R + ˆ R)^{- α}}]

(42)

where we recall that $˜ R ≫ ˆ R$ . Then, the lower and upper bounds of $L_{I_{{ˆ m}_{k}}} (s)$ in (26)–(27) are a straightforward result of combining (42) and Corollary 1. ∎

Footnotes

Before applying active cancellation, the magnitude of the self-interference channel can be modeled as a Ricean distribution with large $K$ -factor due to the strong line-of-sight component; after applying active cancellation, the line-of-sight component is reduced, resulting in smaller $K$ -factor [7].
To improve readability, in the rest of the paper, $x$ always refers to a transmitting node and $z$ to a receiving node (either FD or HD).
We define a $χ_{2 n}^{2}$ random variable to have pdf $f (x) = \frac{x^{n - 1} e^{- x}}{Γ (n)}$ .
We define a Gamma random variable with shape parameter $a$ and scale parameter $b$ to have pdf $f (x) = \frac{x^{a - 1} e^{- x / b}}{b^{a} Γ (a)}$ .

References

A. Sabharwal, P. Schniter, G. Dongning, D. W. Bliss, S. Rangarajan, and R. Wichman, “In-band full-duplex wireless: Challenges and opportunities,” IEEE J. Sel. Areas Commun., vol. 32, no. 9, pp. 1637–1652, Sept. 2014.
D. Bharadia, E. McMilin, and S. Katti, “Full duplex radios,” in Proc. ACM Special Interest Group on Data Commun. (SIGCOMM), Hong Kong, China, Aug. 2013, pp. 375–386.
D. Nguyen, L.-N. Tran, P. Pirinen, and M. Latva-aho, “On the spectral efficiency of full-duplex small cell wireless systems,” IEEE Trans. Wireless Commun., vol. 13, no. 9, pp. 4896–4910, Sept. 2014.
Z. Tong and M. Haenggi, “Throughput analysis for full-duplex wireless networks with imperfect self-interference cancellation,” 2015. [Online]. Available: http://arxiv.org/pdf/1502.07404v1.pdf
J. Lee and T. Q. S. Quek, “Hybrid full-/half-duplex system analysis in heterogeneous wireless networks,” IEEE Trans. Wireless Commun. (To be published), 2015.
T. Riihonen, S. Werner, and R. Wichman, “Mitigation of loopback self-interference in full-duplex MIMO relays,” vol. 59, no. 12, pp. 5983–5993, Dec. 2011.
M. Duarte, C. Dick, and A. Sabharwal, “Experiment-driven characterization of full-duplex wireless systems,” IEEE Trans. Wireless Commun., vol. 11, no. 12, pp. 4296–4307, Dec. 2012.
V. Jungnickel, K. Manolakis, W. Zirwas, B. Panzner, V. Braun, M. Lossow, M. Sternad, R. ApelfroÌjd, and T. Svensson, “The role of small cells, coordinated multipoint, and massive MIMO in 5G,” IEEE Commun. Mag., vol. 52, no. 5, pp. 44–51, May 2014.
C. Tepedelenlioglu, A. Abdi, and G. B. Giannakis, “The Ricean $K$ -factor: estimation and performance analysis,” IEEE Trans. Wireless Commun., vol. 2, no. 4, pp. 799–810, July 2003.
M. Haenggi, Stochastic Geometry for Wireless Networks. New York, NY, USA: Cambridge University Press, 2012.
R. Vaze, K. T. Truong, S. Weber, and R. W. Heath, “Two-way transmission capacity of wireless ad-hoc networks,” IEEE Trans. Wireless Commun., vol. 10, no. 6, pp. 1966–1975, June 2011.
M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, with Formulas, Graphs, and Mathematical Tables. Mineola, NY, USA: Dover, 1972.
W. P. Johnson, “The curious history of Faà di Bruno’s formula,” American Mathematical Monthly, vol. 109, no. 3, pp. 217â–234, Mar. 2002.
A. Papoulis, The Fourier Integral and Its Applications. New York, NY, USA: McGraw-Hill, 1962.
A. M. Hunter, J. G. Andrews, and S. Weber, “Transmission capacity of ad hoc networks with spatial diversity,” IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 5058–5071, Dec. 2008.

Back to home

24834

Comments 0

Request comment

The feedback must be of minumum 40 characters

Add comment

Cancel

Loading ...

Full-Duplex MIMO Small-Cell Networks: Performance Analysis

Abstract

I Introduction

Ii System Model

Ii-a System Setup

Ii-B Channel Model

Ii-C SINR Characterization

Iii Success Probability

Iii-a First Hop

Lemma 1.

Proof:

Theorem 1.

Proof:

Corollary 1.

Proof:

Remark 1.

Corollary 2.

Iii-B Second Hop

Theorem 2.

Proof:

Corollary 3.

Proof:

Iv Numerical Results

V Conclusions

Appendix A Success Probability of the First Hop

A-a Proof of Lemma 1

A-B Proof of Theorem 1

A-C Proof of Corollary 1

Appendix B Success Probability of the Second Hop

B-a Proof of Theorem 2

B-B Proof of Corollary 3

Footnotes

References

Request Comment