# Performance Analysis of Multihop AF Relaying Systems in the Presence of Cochannel Interferences

Authors: Weifeng Mou; Fang Fang; Xiaoming Xu; Weiwei Yang; Yueming Cai
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

This paper investigates the performance ofN-hop (N
≥
2) amplify-and-forward (AF) relaying systems with both relays and the destination subject to independent and not necessarily identically distributed multiple cochannel interferences (CCIs). Based on a new class of upper bound of the equivalent signal-to-interference ratio (SIR) which is the harmonic mean of the minimum of the first M
≥
0 hop SIRs and the minimum of the remaining N
-
M hop SIRs, new approximate closed-form expressions of the outage probability and the ergodic capacity are derived. Furthermore, we derive the asymptotic expression of outage probability which accurately reveals the achievable coding gain and diversity gain. Finally, numerical results validate the correctness of the derived expressions.


---

## Body

## 1. Introduction

Multihop wireless relaying technique has recently received significant attention especially in cellular, modern ad-hoc, and wireless senor networks for its performance benefits, including hotspot throughput improvements and signal coverage enhancements. The transmission characteristics of multihop relaying systems have been widely investigated in [1–4]. The authors have studied the outage performance of Nakagami-m fading channels and proposed the upper bound of the end-to-end signal-to-noise ratio (SNR) by the geometric mean of multihop SNRs in [1, 2]. The work in [3] has analysed the average error probability of variable-gain multihop amplify-and-forward (AF) systems by regarding the minimum SNR of all hops as the equivalent SNR. The result in [4] is of particular interest where a new class of upper bounds for the end-to-end SNR is proposed. The key idea is to partition the multihop systems into two parts and bind the SNR by the harmonic mean of the minimum of the first M hop SNRs and the next N
-
M hop SNRs, where the parameter M varies from 0 to N. Compared with [3], the resulting outage probability lower bound in [4] is tighter. Moreover, most of the aforementioned works have just considered the noise-limited scenario.Due to the aggressive reuse of frequency channels for high spectrum utilization, cochannel interferences (CCIs) have become an important issue in wireless systems. As well known, CCIs seriously deteriorate the system performances and drastically complicate the analysis. Therefore, consideration of CCIs is indeed necessary. Most of the existing works focus their attention on the impact of CCIs on dual-hop relaying systems. In [5, 6], the performance of dual-hop relaying network considering CCIs has been investigated. For a multihop network with nonregenerative relays, exact closed-form expressions of performance appear to be intractable especially when N
≥
3. Recently, a signal-to-interference-plus-noise ratio (SINR) upper bound by using the minimum SINR of all hops has been proposed to analyse the outage performance for multihop relay systems in [7–10]. In [7], the effect of CCIs on the performance has been investigated in a Rayleigh fading environment. In [8–10], the minimum SINR of all hops has been used to study the impact of CCIs on the system performance over Nakagami-m fading channels. However, the performance bound does not approximate well at the low-to-medium SNR areas. Thus it cannot provide an accurate assessment of the system performance, which motivates us to develop new tighter bounds for the multihop relaying systems in the presence of CCIs.Motivated by these considerations, we investigate the performance of multihop AF relaying systems with both relays and the destination subjected to multiple cochannel interferences. Based on a new class of upper bound of the equivalent signal-to-interference ratio (SIR) which is the harmonic mean of the minimum of the firstM hops SIRs and the minimum of the next N
-
M
(
0
≤
M
≤
N
) hop SIRs, we research the performance in terms of outage probability and the ergodic capacity. Obviously, when M
=
0 or M
=
N, new upper bound reduces to the bound using the minimum SIR of all hops named the minimum lower bound entire paper. New approximate closed-form expressions of the outage probability and the ergodic capacity are derived. Furthermore, we obtain the asymptotic expression of outage probability which accurately reveals the achievable coding gain and diversity gain. The results indicate that the number of interferers is related to coding gain, but it does not affect the diversity gain. Monte-Carlo simulation results are presented to verify the validity of theoretical analysis which indicates that our performance bound is tighter than the minimum lower bound in low SIRs area.


## 2. System Model

As is depicted in Figure1, an N-hop interference-limited wireless relaying system is considered, where the source node T
0 communicates with the destination node T
N via (
N
-
1
) relays T
n
(
n
∈
{
1,2
,
…
,
N
-
1
}
) employing AF relaying protocol. Each node is equipped with a single antenna and works in the half-duplex mode. Furthermore, it is assumed that only one node is allowed to transmit in each time plot.Figure 1
Interference-limited multihop relaying systems.In then
t
h time plot, thenth relay node T
n receives the useful signal just from the immediately transmitting node T
n
-
1. In the meantime, it is interfered by L
T
n independent and not necessarily identically distributed CCIs.As far as we know, the effect of noise can be ignored when the SNR and interference-to-noise ratio (INR) are high which is widely used in [11, 12]. Therefore, the received signal at T
n is expressed as(1)
y
n
=
P
n
-
1
h
n
y
n
-
1
+
P
I
n
∑
j
=
1
L
T
n
h
T
n
,
j
m
T
n
,
j
,where y
n
-
1 and P
n
-
1, respectively, denote the unit-energy signal and energy transmitted from the node T
n
-
1, h
n indicates the Rayleigh fading channel coefficient of T
n
-
1
→
T
n, which satisfies E
[
|
h
n
|
2
]
=
σ
n
2
∝
d
n
-
α, and E
[
·
] denotes the expectation operation. α is the path-loss exponent (normally, α
>
2); d
n is the distance between T
n
-
1 and T
n. Similarly, m
T
n
,
j and P
I
n are the unit-energy signal and transmitting energy of thej
t
h cochannel interference, respectively. L
T
n is the total number of interferences. h
T
n
,
j is the Rayleigh fading channel coefficient of the j
t
h interference to node T
n which satisfies E
[
|
h
T
n
,
j
|
2
]
=
σ
T
n
,
j
2
∝
d
T
n
,
j
-
α and d
T
n
,
j is the distance between thej
t
h interference node and then
t
h node.In the multihop AF relaying systems, then
t
h relay node amplifies the received signal y
n by a gain factor A
n and then forwards the obtained signal to the next node. Therefore, the received signal at the (
n
+
1
)
t
h relay node can be expressed as(2)
y
n
+
1
=
y
n
P
n
A
n
h
n
+
1
+
P
I
n
+
1
∑
j
=
1
L
T
n
+
1
h
T
n
+
1
,
j
m
T
n
+
1
,
j
,where the amplification factor at the relay node T
n is (3)
A
n
=
P
n
-
1
h
n
2
+
P
I
n
∑
j
=
1
L
T
n
h
T
n
,
j
2
-
1
.Therefore, the received signal at the destination nodeT
N for the N-hop AF wireless network in the presence of CCIs is formulated as (4)
y
N
=
P
N
-
1
h
N
∏
i
=
1
N
-
1
A
i
P
i
-
1
h
i
x
0
︸
I
+
P
I
N
∑
j
=
1
L
T
N
h
T
N
,
j
m
T
N
,
j
︸
I
I
+
∑
i
=
1
N
-
1
∏
n
=
i
N
-
1
A
n
P
n
h
n
+
1
P
I
i
∑
j
=
1
L
T
i
h
T
i
,
j
m
T
i
,
j
︸
I
I
I
,where the first part is the valid signal, the second part is the interference signal received at the destination, and the third part is the accumulatively amplified interference signal from all of the relays.Based on (4), the equivalent SIR at T
N is derived as(5)
γ
e
n
d
=
P
N
-
1
h
N
2
∏
i
=
1
N
-
1
A
i
2
P
i
-
1
h
i
2
∑
i
=
1
N
-
1
∏
n
=
i
N
-
1
A
n
2
P
n
h
n
+
1
2
P
I
i
∑
j
=
1
L
T
i
h
T
i
,
j
2
+
P
I
N
∑
j
=
1
L
T
N
h
T
N
,
j
2
.We assume thatγ
i
=
P
i
-
1
|
h
i
|
2 and γ
I
i
=
∑
j
=
1
L
T
i
P
I
i
|
h
T
i
,
j
|
2 are the signal power and the total interference power at the i
t
h relay node, respectively. Then, (5) can be rewritten as (6)
γ
e
n
d
=
∏
i
=
1
N
1
+
γ
I
i
γ
i
-
1
-
1
.In order to investigate the performance of the arbitraryN-hop AF relaying systems, we need to derive the statistical distributing character of γ
e
n
d. Although (6) has accurately described the equivalent SIR, the probability distribution function (PDF) of (6) is not mathematically tractable, particularly for N
≥
3. We adopt the similar method proposed in [4] to partition the set of γ
i
e
f
f
i
=
1
N into two groups, where γ
i
e
f
f
=
γ
i
/
γ
I
i denoting the received signal-to-interference ratio (SIR) at the i
t
h node. Then, the upper bound of the end-to-end equivalent SIR is rewritten as(7)
γ
e
n
d
≤
γ
u
p
=
1
min
1
≤
i
≤
M
⁡
γ
i
e
f
f
+
1
m
i
n
M
+
1
≤
i
≤
N
γ
i
e
f
f
-
1
,where 0
≤
M
≤
N. The derived SIR bound γ
u
p is related to the harmonic mean of the minimum SIR of the first M hops and the minimum SIR of the next N
-
M hops. Intuitively, the tightness of the derived bound increases as M gets closer to N
-
M. Denoting Γ
1
=
min
1
≤
i
≤
M
⁡
(
γ
i
e
f
f
) and Γ
2
=
min
M
+
1
≤
i
≤
N
⁡
(
γ
i
e
f
f
), γ
u
p is expressed as γ
u
p
=
Γ
1
Γ
2
/
(
Γ
1
+
Γ
2
).In particular, whenM
=
0 or M
=
N, (7) can be reduced to the minimum lower bound γ
m
i
n
=
min
1
≤
i
≤
N
⁡
(
γ
i
e
f
f
) which uses the minimum SIR of all hops as the equivalent SIR [11]. In addition, it is worth noting that (7) with N
=
2 and M
=
1 can be reduced to the exact SIR for the case of dual-hop systems [12].


## 3. Outage Probability Analyses

In interference-limited environments, the outage probability is defined as the probability that the received equivalent SIR drops below the thresholdγ
t
h, or mathematically(8)
P
o
u
t
γ
t
h
=
P
r
γ
e
n
d
≤
γ
t
h
=
F
γ
e
n
d
γ
t
h
≥
F
γ
u
p
γ
t
h
,where P
r
⁡
(
x
) denotes the probability and F
X
(
x
) denotes cumulative distribution function (CDF) of X.Based on (7), F
γ
u
p
(
γ
t
h
) is expressed as (9)
F
γ
u
p
x
=
1
-
∫
0
∞
1
-
F
Γ
1
z
+
x
x
z
f
Γ
2
z
+
x
d
z
,where f
X
(
x
) is the PDF of X.In order to obtainF
Γ
1
(
x
) and f
Γ
2
(
x
), we need to know the CDF of SIR of every hop γ
i
e
f
f in T
i
-
1
→
T
i link, which can be expressed as(10)
F
γ
i
e
f
f
γ
=
∫
0
∞
F
γ
i
γ
x
f
γ
I
i
x
d
x
,where F
γ
i
(
x
) is the CDF of γ
i, which follows exponential distribution and can be written as F
γ
i
(
x
)
=
1
-
e
-
x
/
γ
-
i. And f
γ
I
i
(
x
) is the PDF of γ
I
i which denotes the sum of the multiple independent and not necessarily identically random variables. And it is written as f
γ
I
i
(
x
)
=
x
L
T
i
-
1
γ
-
I
i
-
L
T
i
e
x
p
(
-
x
/
γ
-
I
i
)
/
Γ
(
L
T
i
), where γ
-
i
=
E
[
γ
i
]
=
P
i
-
1
σ
i
2. We assume that the distance between each interference and the relay is equal, so γ
-
I
i
=
E
[
γ
I
i
]
=
P
I
i
∑
j
=
1
L
T
i
σ
T
n
,
j
2.SubstitutingF
γ
i
(
x
) and f
γ
I
i
(
x
) into (10), the CDF of γ
i
e
f
f can be rewritten as(11)
F
γ
i
e
f
f
x
=
1
-
1
+
x
γ
-
i
e
f
f
-
L
T
i
,where γ
-
i
e
f
f
=
γ
-
i
/
γ
-
I
i denotes the average SIR at the i
t
h relay node.We have assumed thatΓ
1
=
min
1
≤
i
≤
M
⁡
(
γ
i
e
f
f
) is the minimum SIR of the first M hops and Γ
2
=
min
M
+
1
≤
i
≤
N
⁡
(
γ
i
e
f
f
) is the minimum SIR of the next N
-
M hops. Therefore, the CDF of Γ
1 can be written as (12)
F
Γ
1
x
=
1
-
∏
i
=
1
M
1
+
x
γ
-
i
e
f
f
-
L
T
i
.Utilizing decomposition into partial fractions,F
Γ
1
(
x
) can be rewritten as(13)
F
Γ
1
x
=
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
λ
n
,
i
1
+
x
γ
-
i
e
f
f
-
n
,where λ
n
,
i is expressed as(14)
λ
n
,
i
=
γ
-
i
e
f
f
L
T
i
-
n
L
T
i
-
n
!
×
∂
L
T
i
-
n
∂
γ
L
T
i
-
n
1
+
γ
γ
-
i
e
f
f
L
T
i
∏
i
=
1
M
1
+
γ
γ
-
i
e
f
f
-
L
T
i
γ
=
-
γ
-
i
e
f
f
.Similarly, the CDF ofΓ
2
=
min
M
+
1
≤
i
≤
N
⁡
(
γ
i
e
f
f
) is derived as(15)
F
Γ
2
x
=
1
-
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
m
,
j
1
+
x
γ
-
j
e
f
f
-
m
,where γ
-
j
e
f
f
=
γ
-
j
/
γ
-
I
j denotes the average SIR in the j
t
h relay node and λ
m
,
j is expressed as(16)
λ
m
,
j
=
γ
-
j
e
f
f
L
T
j
-
m
L
T
j
-
m
!
×

∂
L
T
j
-
m
∂
γ
L
T
j
-
m
1

+

γ
γ
-
j
e
f
f
L
T
j


∏
j
=
M
+
1
N

1

+

γ
γ
-
j
e
f
f
-
L
T
j
γ
=
-
γ
-
j
e
f
f
.By taking the derivative ofF
Γ
2
(
x
) with respect to x, the PDF of Γ
2 is obtained as(17)
f
Γ
2
x
=
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
m
λ
m
,
j
γ
-
j
e
f
f
1
+
x
γ
-
j
e
f
f
-
m
-
1
.Substituting (13) and (17) into (9), the integral expression is derived:(18)
F
γ
u
p
x
=
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
m
λ
m
,
j
λ
n
,
i
x
+
γ
-
i
e
f
f
n
+
1
γ
-
j
e
f
f
x
/
γ
-
j
e
f
f
+
1
m
+
1
x
2
/
γ
-
i
e
f
f
n
×
∫
0
∞
z
n
z
+
1
-
m
-
1
α
z
+
1
-
n
d
z
,where α
=
(
x
+
γ
-
i
e
f
f
)
(
x
+
γ
-
j
e
f
f
)
/
x
2.Then, using [13, Eq. 3.197.5], the closed-form expression of CDF of γ
u
p is derived:(19)
F
γ
u
p
x
=
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
m
λ
m
,
j
λ
n
,
i
x
+
γ
-
i
e
f
f
n
+
1
γ
-
j
e
f
f
x
/
γ
-
j
e
f
f
+
1
m
+
1
x
2
/
γ
-
i
e
f
f
n
×
B
n
+
1
,
m
F
2
1
n
,
n
+
1
;
n
+
m
+
1
;
1
-
α
,where B
(
x
,
y
) is the Beta function [13, Eq. 8.380.1] and F
2
1
(
a
,
b
;
c
;
z
) is the Gauss hypergeometric function [13, Eq. 9.111]. It can be computed in many popular software tools, such as MATHEMATICAL and MAPLE.Thus, the lower bound of the outage probability is expressed as(20)
P
o
u
t
γ
t
h
≥
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
m
λ
m
,
j
λ
n
,
i
γ
t
h
+
γ
-
i
e
f
f
n
+
1
γ
-
j
e
f
f
γ
t
h
/
γ
-
j
e
f
f
+
1
m
+
1
γ
t
h
2
/
γ
-
i
e
f
f
n
×
B
n
+
1
,
m
F
2
1
γ
t
h
+
γ
-
j
e
f
f
γ
t
h
2
n
,
n
+
1
;
n
+
m
+
1
;
×
B
n
+
1
,
m
F
1
2
1
-
γ
t
h
+
γ
-
i
e
f
f
γ
t
h
+
γ
-
j
e
f
f
γ
t
h
2
.It is indicated that the outage probability has much to do with the number and power of cochannel interference and the relationship betweenN and M. However, the exact analysis is too complicated to render insight on the impact of cochannel interferences and the relationship between N and M. Therefore, the asymptotic outage probability is investigated at high SIR regime.In particular, whenM
=
0 or M
=
N, (20) is reduced to the minimum lower bound of the outage probability in [11]:(21)
P
o
u
t
γ
t
h
≥
1
-
∑
i
=
1
N
∑
n
=
1
L
T
i
λ
n
,
i
1
+
γ
t
h
γ
-
i
e
f
f
-
n
.WhenN
=
2 and M
=
1, expression (20) is reduced to the accurate outage probability of dual-hop AF relaying systems in the interference-limited environments in [12]: (22)
P
o
u
t
γ
t
h
≥
1
-
∑
n
=
1
L
T
1
∑
m
=
1
L
T
2
m
λ
m
,
2
λ
n
,
1
γ
t
h
+
γ
-
1
e
f
f
n
+
1
γ
-
2
e
f
f
γ
t
h
/
γ
-
2
e
f
f
+
1
m
+
1
γ
t
h
2
/
γ
-
1
e
f
f
n
×
B
n
+
1
,
m
F
2
1
γ
-
2
e
f
f
γ
t
h
2
n
,
n
+
1
;
n
+
m
+
1
;
×
B
n
+
1
,
m
F
1
2
1
-
γ
t
h
+
γ
-
1
e
f
f
γ
t
h
+
γ
-
2
e
f
f
γ
t
h
2
γ
-
2
e
f
f
γ
t
h
2
n
,
n
+
1
;
n
+
m
+
1
;
.These results in (21) and (22) demonstrate the generality of our analysis.


### 3.1. Diversity and Coding Gain

In the high SIR regime, the asymptotic outage probability can be expressed as(23)
P
o
u
t
∞
=
Ψ
·
γ
-
e
n
d
-
Φ
+
o
γ
-
e
n
d
-
Φ
,where o
(
·
) represents the higher order terms (i.e., we write f
(
x
)
=
o
(
g
(
x
)
) as x
→
x
0 if lim
x
→
x
0
⁡
f
(
x
)
/
g
(
x
)
=
0) and γ
-
e
n
d is the average end-to-end equivalent SIR. Φ and Ψ denote the diversity and coding gain, respectively.In order to gain some insight about the achievable diversity and coding gain, another upper boundγ
e
q on the end-to-end equivalent SIR is utilized:(24)
γ
e
q
=
m
i
n
Γ
1
,
Γ
2
.Then, the lower bound of the outage probability can be expressed as(25)
F
e
q
x
=
1
-
1
-
F
Γ
1
x
1
-
F
Γ
2
x
.Asγ
-
i
e
f
f
=
γ
-
i
/
γ
-
I
i
→
∞, using lim
x
→
0
⁡
(
1
+
x
)
-
j
≈
1
-
j
x, F
γ
i
e
f
f
(
x
) can be asymptotically written as(26)
F
γ
i
e
f
f
(
x
)
x
→
0
=
L
T
i
γ
-
i
e
f
f
x
+
o
γ
-
i
e
f
f
-
1
.Furthermore, substituting (26) into (13), we obtain the asymptotic expression for F
Γ
1
(
γ
t
h
) as(27)
F
Γ
1
∞
x
=
∑
i
=
1
M
L
T
i
x
γ
-
i
e
f
f
-
1
+
o
γ
-
i
e
f
f
-
1
.Similarly, by following the similar steps ofF
Γ
1
(
x
), asymptotic expression for F
Γ
2
(
x
) is given by(28)
F
Γ
2
∞
x
=
∑
j
=
M
+
1
N
L
T
j
x
γ
-
j
e
f
f
-
1
+
o
γ
-
j
e
f
f
-
1
.Then, substituting (27) and (28) into (25), we derive the asymptotic expression for outage probability prescribed as(29)
P
γ
e
q
∞
γ
t
h
≈
F
Γ
1
∞
γ
t
h
+
F
Γ
2
∞
γ
t
h
.Based on (29), we obtain the diversity gain Φ
=
1 which determines the slope of the asymptotic outage probability curve. And the coding gain Ψ is derived as(30)
Ψ
=
∑
i
=
1
M
L
T
i
γ
t
h
+
∑
j
=
M
+
1
N
L
T
j
γ
t
h
.From (30), we found that the coding gain has much to do with the number of the cochannel interference and the value of threshold. But these factors do not affect the diversity gain.


## 3.1. Diversity and Coding Gain

In the high SIR regime, the asymptotic outage probability can be expressed as(23)
P
o
u
t
∞
=
Ψ
·
γ
-
e
n
d
-
Φ
+
o
γ
-
e
n
d
-
Φ
,where o
(
·
) represents the higher order terms (i.e., we write f
(
x
)
=
o
(
g
(
x
)
) as x
→
x
0 if lim
x
→
x
0
⁡
f
(
x
)
/
g
(
x
)
=
0) and γ
-
e
n
d is the average end-to-end equivalent SIR. Φ and Ψ denote the diversity and coding gain, respectively.In order to gain some insight about the achievable diversity and coding gain, another upper boundγ
e
q on the end-to-end equivalent SIR is utilized:(24)
γ
e
q
=
m
i
n
Γ
1
,
Γ
2
.Then, the lower bound of the outage probability can be expressed as(25)
F
e
q
x
=
1
-
1
-
F
Γ
1
x
1
-
F
Γ
2
x
.Asγ
-
i
e
f
f
=
γ
-
i
/
γ
-
I
i
→
∞, using lim
x
→
0
⁡
(
1
+
x
)
-
j
≈
1
-
j
x, F
γ
i
e
f
f
(
x
) can be asymptotically written as(26)
F
γ
i
e
f
f
(
x
)
x
→
0
=
L
T
i
γ
-
i
e
f
f
x
+
o
γ
-
i
e
f
f
-
1
.Furthermore, substituting (26) into (13), we obtain the asymptotic expression for F
Γ
1
(
γ
t
h
) as(27)
F
Γ
1
∞
x
=
∑
i
=
1
M
L
T
i
x
γ
-
i
e
f
f
-
1
+
o
γ
-
i
e
f
f
-
1
.Similarly, by following the similar steps ofF
Γ
1
(
x
), asymptotic expression for F
Γ
2
(
x
) is given by(28)
F
Γ
2
∞
x
=
∑
j
=
M
+
1
N
L
T
j
x
γ
-
j
e
f
f
-
1
+
o
γ
-
j
e
f
f
-
1
.Then, substituting (27) and (28) into (25), we derive the asymptotic expression for outage probability prescribed as(29)
P
γ
e
q
∞
γ
t
h
≈
F
Γ
1
∞
γ
t
h
+
F
Γ
2
∞
γ
t
h
.Based on (29), we obtain the diversity gain Φ
=
1 which determines the slope of the asymptotic outage probability curve. And the coding gain Ψ is derived as(30)
Ψ
=
∑
i
=
1
M
L
T
i
γ
t
h
+
∑
j
=
M
+
1
N
L
T
j
γ
t
h
.From (30), we found that the coding gain has much to do with the number of the cochannel interference and the value of threshold. But these factors do not affect the diversity gain.


## 4. Ergodic Capacity Analyses

Besides the outage probability, the ergodic capacity is another important performance measure. The ergodic capacity is defined as the expected value of the instantaneous maximum mutual information. Thus, the end-to-end ergodic capacity of multihop AF relaying systems with CCIs can be expressed as(31)
C
A
F
≈
1
N
∫
0
∞
l
o
g
2
1
+
x
f
γ
u
p
x
d
x
.In order to derive the ergodic capacity, the PDF ofγ
u
p is needed which is found by taking the derivative of F
γ
u
p
(
x
) in (19) with respect to x:(32)
f
γ
u
p
x

=
-

∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
m
λ
m
,
j
λ
n
,
i
γ
-
i
e
f
f
n
B
n
+
1
,
m
γ
-
j
e
f
f
×
x
+
γ
-
i
e
f
f
n
x
/
γ
-
j
e
f
f
+
1
m
+
2
x
2
n
+
1
×

x
2
n
-
m
+
1
γ
-
j
e
f
f

+

n
+
2
-
m
γ
-
i
e
f
f
γ
-
j
e
f
f
x

+
γ
-
i
e
f
f
×
F
2
1
n
,
n
+
1
;
n
+
m
+
1
;
1
-
α
+
n
(
n
+
1
)
x
+
γ
-
i
e
f
f
n
+
1
(
n
+
m
+
1
)
(
x
/
γ
-
j
e
f
f
+
1
)
m
+
1
x
2
/
γ
-
i
e
f
f
n
x
3
×
F
2
1
n
+
1
,
n
+
2
;
n
+
m
+
2
;
1
-
α
×
γ
-
i
e
f
f
x
+
γ
-
j
e
f
f
x
+
2
γ
-
i
e
f
f
γ
-
j
e
f
f
(
x
+
γ
-
i
e
f
f
)
n
(
x
/
γ
-
j
e
f
f
+
1
)
m
+
2
x
2
n
+
1
.Substituting (32) into (31), the ergodic capacity can be derived after the single integrals.


### 4.1. Approximate Analysis

Although the expressionF
γ
u
p
(
x
) in (19) offers an efficient way to evaluate the outage performance, it is too difficult to derive the closed-form expression of the ergodic capacity. Therefore, we derived the closed-form expression of the approximate close analysis for the ergodic capacity when M
=
0 or M
=
N.Substituting (13) and (15) to (25) and by the mathematical calculation, the CDF of γ
e
q is formulated as (33)
F
γ
e
q
x
=
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
γ
-
i
e
f
f
+
x
n
γ
-
j
e
f
f
γ
-
j
e
f
f
+
x
m
.Consequently, the PDF ofγ
e
q is obtained by taking the derivation of F
γ
e
q
(
x
)with respect to x:(34)
f
γ
e
q
x
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
×
n
γ
-
i
e
f
f
+
x
n
+
1
γ
-
j
e
f
f
+
x
m
+
m
γ
-
i
e
f
f
+
x
n
γ
-
j
e
f
f
+
x
m
+
1
.Then, substituting (34) to (31) and integral, we derive the approximate ergodic capacity expression in (35)
C
A
F
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
∫
0
∞
l
o
g
2
(
1
+
x
)
×
n
A
s
γ
-
i
e
f
f
+
x
s
+
n
B
t
γ
-
j
e
f
f
+
x
t
+
m
C
u
γ
-
i
e
f
f
+
x
u
+
m
D
v
γ
-
j
e
f
f
+
x
v
d
x
,where(36)
A
s
=
1
n
+
1
-
s
!
d
n
+
1
-
s
d
x
n
+
1
-
s
1
x
+
γ
-
j
e
f
f
m
x
=
-
γ
-
i
e
f
f
,
B
t
=
1
m
-
t
!
d
m
-
t
d
x
m
-
t
1
x
+
γ
-
i
e
f
f
m
+
1
x
=
-
γ
-
j
e
f
f
,
C
u
=
1
n
-
u
!
d
n
-
u
d
x
n
-
u
1
x
+
γ
-
j
e
f
f
m
+
1
x
=
-
γ
-
i
e
f
f
,
D
v
=
1
m
+
1
-
v
!
d
m
+
1
-
v
d
x
m
+
1
-
v
1
x
+
γ
-
i
e
f
f
n
x
=
-
γ
-
j
e
f
f
.To calculate (35), using [14, Equation (10, 11, 21)] and after some manipulations, the closed-form expression of ergodic capacity is derived as(37)
C
A
F
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
l
n
2
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
×
n
A
s
Γ
(
s
)
γ
-
i
e
f
f
s
G
33
32
1
γ
-
i
e
f
f
-
s
+
1
,
-
1,0
0
,
-
1
,
-
1
+
n
B
t
Γ
(
t
)
γ
-
j
e
f
f
t
G
33
32
1
γ
-
j
e
f
f
-
t
+
1
,
-
1,0
0
,
-
1
,
-
1
+
m
C
u
Γ
(
u
)
γ
-
i
e
f
f
u
G
33
32
1
γ
-
i
e
f
f
-
u
+
1
,
-
1,0
0
,
-
1
,
-
1
+
m
D
v
Γ
v
γ
-
j
e
f
f
v
G
33
32
1
γ
-
j
e
f
f
-
v
+
1
,
-
1,0
0
,
-
1
,
-
1
,where G
·
,
·
·
,
·
(
·
·
,
·
,
·
·
,
·
,
·
) is the Meijer G-function [13, Equation 9.301] that is readily available in the standard mathematical packages such as MATHEMATICA, MATLAB, and MAPLE.


## 4.1. Approximate Analysis

Although the expressionF
γ
u
p
(
x
) in (19) offers an efficient way to evaluate the outage performance, it is too difficult to derive the closed-form expression of the ergodic capacity. Therefore, we derived the closed-form expression of the approximate close analysis for the ergodic capacity when M
=
0 or M
=
N.Substituting (13) and (15) to (25) and by the mathematical calculation, the CDF of γ
e
q is formulated as (33)
F
γ
e
q
x
=
1
-
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
γ
-
i
e
f
f
+
x
n
γ
-
j
e
f
f
γ
-
j
e
f
f
+
x
m
.Consequently, the PDF ofγ
e
q is obtained by taking the derivation of F
γ
e
q
(
x
)with respect to x:(34)
f
γ
e
q
x
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
×
n
γ
-
i
e
f
f
+
x
n
+
1
γ
-
j
e
f
f
+
x
m
+
m
γ
-
i
e
f
f
+
x
n
γ
-
j
e
f
f
+
x
m
+
1
.Then, substituting (34) to (31) and integral, we derive the approximate ergodic capacity expression in (35)
C
A
F
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
∫
0
∞
l
o
g
2
(
1
+
x
)
×
n
A
s
γ
-
i
e
f
f
+
x
s
+
n
B
t
γ
-
j
e
f
f
+
x
t
+
m
C
u
γ
-
i
e
f
f
+
x
u
+
m
D
v
γ
-
j
e
f
f
+
x
v
d
x
,where(36)
A
s
=
1
n
+
1
-
s
!
d
n
+
1
-
s
d
x
n
+
1
-
s
1
x
+
γ
-
j
e
f
f
m
x
=
-
γ
-
i
e
f
f
,
B
t
=
1
m
-
t
!
d
m
-
t
d
x
m
-
t
1
x
+
γ
-
i
e
f
f
m
+
1
x
=
-
γ
-
j
e
f
f
,
C
u
=
1
n
-
u
!
d
n
-
u
d
x
n
-
u
1
x
+
γ
-
j
e
f
f
m
+
1
x
=
-
γ
-
i
e
f
f
,
D
v
=
1
m
+
1
-
v
!
d
m
+
1
-
v
d
x
m
+
1
-
v
1
x
+
γ
-
i
e
f
f
n
x
=
-
γ
-
j
e
f
f
.To calculate (35), using [14, Equation (10, 11, 21)] and after some manipulations, the closed-form expression of ergodic capacity is derived as(37)
C
A
F
=
∑
i
=
1
M
∑
n
=
1
L
T
i
∑
j
=
M
+
1
N
∑
m
=
1
L
T
j
λ
n
,
i
λ
m
,
j
l
n
2
γ
-
i
e
f
f
n
γ
-
j
e
f
f
m
×
n
A
s
Γ
(
s
)
γ
-
i
e
f
f
s
G
33
32
1
γ
-
i
e
f
f
-
s
+
1
,
-
1,0
0
,
-
1
,
-
1
+
n
B
t
Γ
(
t
)
γ
-
j
e
f
f
t
G
33
32
1
γ
-
j
e
f
f
-
t
+
1
,
-
1,0
0
,
-
1
,
-
1
+
m
C
u
Γ
(
u
)
γ
-
i
e
f
f
u
G
33
32
1
γ
-
i
e
f
f
-
u
+
1
,
-
1,0
0
,
-
1
,
-
1
+
m
D
v
Γ
v
γ
-
j
e
f
f
v
G
33
32
1
γ
-
j
e
f
f
-
v
+
1
,
-
1,0
0
,
-
1
,
-
1
,where G
·
,
·
·
,
·
(
·
·
,
·
,
·
·
,
·
,
·
) is the Meijer G-function [13, Equation 9.301] that is readily available in the standard mathematical packages such as MATHEMATICA, MATLAB, and MAPLE.


## 5. Numerical and Simulation Results

In this section, numerical and Monte-Carlo simulation results are provided to verify the accuracy of our analytical results. And we have compared our performance bound with the minimum lower bound [11] and the exact simulations. In all scenarios, the outage threshold is selected as γ
t
h
=
0
d
B, and the path-loss factor α
=
4. We assume that the distance of T
i
-
1
→
T
i is {
d
i
}
i
=
1
5
=
{
0.8,0.8,0.7,0.7,0.6
} and the distance among interference to relay nodes is {
d
L
T
i
}
i
=
1
3
=
{
1.5,1.6,1.7
}. In addition, the signal transmit power at node T
i
-
1 is expressed as {
P
i
-
1
}
i
=
1
N
=
{
P
0
,
1.1
P
0
,
0.9
P
0
,
0.8
P
0
,
0.7
P
0
} and the transmit power of the CCIs is normalized, for example, {
P
I
i
}
i
=
1
N
=
1. We find excellent agreements between the simulated and analytical results. The asymptotic results accurately provide valuable insights in terms of the diversity order and coding gain of the systems which confirm the validities of our analysis.In Figure2, the outage probability of a three-hop relaying system versus the number of CCIs at each hop is shown. We assume that the distances between different relay nodes are identical: {
d
i
}
i
=
1
3
=
{
0.8,0.8,0.7
}, and the distance between interference and relay node is {
d
L
T
i
}
i
=
1
3
=
{
1.5,1.6,1.7
}; the number of CCIs at each hop is equal and each interference has the same transmission power, and the relaying node T
n
n
=
0
2 has a different transmission power. We set M
=
2 that is to regard the first two hops as the one section and the third hop as the other section. As expected, we observe that the outage performance decays with the increasing of the number of CCIs at each relay and destination. Furthermore, our performance bound is tighter than minimum lower bound at the low-to-medium SIR areas and in accordance with the exact simulations.Figure 2
Outage probability of three-hop AF relaying systems versus different numbers of CCIs.In Figure3, the proposed lower bounds of the outage probability for N
=
3,4
,
5 hops relaying systems are plotted. We assume that the number of interferers is fixed at L
T
n
=
2. We find that, as the number of hops increases, the outage performance deteriorates significantly and both classes of the lower bounds turn to be more deviant from the exact simulations. What is more, compared with the minimum lower bound, our performance bound outperforms well and is more approximate to the exact simulations. Furthermore, it is observed that an increase in the number of hops brings about an obvious decline in outage probability. This can be explained by the fact that the diversity order is Φ
=
1.Figure 3
Outage probability of multihop AF relaying systems versus different numbers of hops.Figure4 compares the ergodic capacity performance of multihop relay networks for different numbers of hops. Observing the results in the figure, we can see that the more the number of hops is, the worse the capacity performance is. The approximated ergodic capacity obtained in terms of the Meijer-G function is illustrated along with the upper bound derived in (30) and the gap is about 1.5 dB. And the gap between the exact and the upper bound capacity is just 0.5 dB.Figure 4
The ergodic capacity of multihop AF relaying systems versus different numbers of hops.


## 6. Conclusions

This paper investigates the performance of the interference-limitedN-hop (
N
≥
2
) AF relaying systems. Based on a new class of upper bounds on the equivalent SIR which is the harmonic mean of the minimum of the first M hop SIRs and the minimum of the remaining N
-
M hop SIRs, we derive new approximate closed-form expressions of the outage probability and the ergodic capacity. Compared with minimum lower bound [11], our performance bound of outage probability is tighter at the low-to-medium SIR areas. Further, the diversity and coding gain are derived from the asymptotic outage probability at the high SIR regime. We find that the number of CCIs can affect coding gain but cannot affect diversity gain. And the closed-form expression of approximate ergodic capacity is used to research the system performance. Finally, numerical results are presented to validate our analysis.



---

*Source: 508987-2015-06-14.xml*