Академический Документы
Профессиональный Документы
Культура Документы
RESEARCH ARTICLE
ABSTRACT
In this paper, a study on the end-to-end performance of multi-hop non-regenerative relaying networks over independent
generalized-gamma (GG) fading channels is presented. Using an upper bound for the end-to-end signal-to-noise ratio (SNR),
novel closed-form expressions for the probability density function, the moments, and the moments-generating function of
the end-to-end SNR are presented. Based on these derived formulas, lower bounds for the outage and the average bit error
probability (ABEP) are derived in closed form. Special attention is given to the low- and high-SNR regions having practical
interest as well as to the Nakagami fading scenario. Moreover, the performance of the considered system when employing
adaptive square-quadrature amplitude modulation is further analyzed in terms of the average spectral efciency, the bit
error outage, and the ABEP. Computer simulation results verify the tightness and the accuracy of the proposed bounds.
Copyright 2011 John Wiley & Sons, Ltd.
KEYWORDS
adaptive square-QAM; amplify-and-forward; average bit error probability (ABEP); bit error outage (BEO); generalized-gamma fading;
multi-hop relaying; Nakagami; outage probability; Weibull
*Correspondence
Nikos C. Sagias, Department of Telecommunications Science and Technology, School of Applied Sciences and Technology, University
of Peloponnese, End of Karaiskaki Street, 22100 Tripoli, Greece.
E-mail: nsagias@ieee.org
1. INTRODUCTION
Recently, multi-hop networks technology has attracted
great interest as it is a promising solution to achieve high
data rate coverage required in future cellular wireless local
area and hybrid networks, as well as to mitigate wireless
channels impairment. In a multi-hop system, intermediate nodes are used to relay signals between the source and
the destination terminal. Relaying techniques can achieve
network connectivity when the direct transmission is difcult for practical reasons, such as large path-loss or power
constraints. As a result, signals from the source to the destination propagate through different hops/links. A special
class of multi-hop networks is the serial relaying networks
for which various works have shown that they are able to
achieve high performance gains [1,2].
In the open technical literature, there are several works
dealing with the performance analysis of multi-hop systems.
h1
R1
h2
R2
h3
...
hN-2
C. K. Datsikas et al.
RN-2
hN-1
RN-1
hN
D
Figure 1. The serial relaying communication system under consideration.
i mi i /21
2(mi )(i i )mi i /2
exp
i i
i /2
(1)
where i > 0 and mi > 1/2 are parameters related to fading severity, i = Ei with E denoting expectation,
and i = (mi )/ (mi + 2/i ) where () is the gamma
function. For i = 2, Equation (1) reduces to the square
Nakagami-m fading distribution, whereas for mi = 1, the
Weibull distribution is obtained. Also the CDF of i is given
by
1
mi ,
Fi () = 1
(mi )
i i
i /2
(2)
C. K. Datsikas et al.
Fi () = 1 exp
i i
i /2
i!
Fb () = 1 exp N
ii /2
mi 1
1
i=0
(3)
i i
/2
m1 i/2 N
1
i=0
i!
(8)
equ =
N
i=1
1
1+
i
Fb () = 1 N! exp N
(4)
N
N
1
1
i
min{1 , 2 , . . . , N }
(6)
m1
(i!)ni ni !()ini /2
m1
i=1
ini /2
N /21 N!
exp N
fb () =
2()/2
N
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
/2
/2
m1
i=1
ini /2
N!
2
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
[1 Fi ()]
1
mi ,
(mi )
N
N
N
exp N
(10)
i=1
i=0
i=1
where
= 1
/2
(9)
(5)
Fb () = 1
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
equ b = min{1 , 2 , . . . , N }
i=1
1
equ
i i
i /2
1+
m1
i=1
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
m1
ini
(11)
i=1
(7)
ini /2
N
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
with n0 + n1 + . . . + nm1 = N.
k,l
where G l,k
[] is the Meijers G-function, see Reference [17,
equation (9.301)], k and l are two minimum integers that
satisfy = 2l/k, (k, ) = k , +1
, . . . , +k1
, and
k
k
3.3. Moments
The th order moment of b is dened as
b () Eb =
C. K. Datsikas et al.
fb ()d
(12)
b () = N!
n0 , n1 , . . . , nm1 = 0
m1
i ni
2
1 =
n0 + n1 + + nm1 = N
N 2 2 / ( )2
2 1
N
N!
(17)
i=1
N
Mb (s) = 1 N!
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
Nm
2 ! 1 +
s
2 1
(18)
n0 , n1 , . . . , nm1 = 0
where
n0 + n1 + + nm1 = N
( )2
2 /
N 2
2 2
m1
i ni
(13)
i=1
m1
ini 1
(i!)ni ni !
i=0
where
(19a)
and
m1
1 = +
ini +
2
2
(14a)
2 = 2
i=1
and
(14b)
Mb (s) = 1
The MGF of b dened as Mb (s) Eexp(sb ), can be
extracting from the CDF of b as
Mb (s) = sL{Fb (); s}
(15)
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
s exp(s )
0
Mb (s) = 1 N!
(19b)
2 = 1
2
N
N
i=1
1
mi ,
(mi )
i i
i /2
d.
(20)
L
N
i=1 j=1
wi
mj
mj ,
xi
sj j
j /2
(21)
An0 ,n1 ,...,nm1
+ 1
kl l
kl 1 2 s 1 k, l
N l /s
G
(2)(k+l)/21 l, k ()k/2 kk
(l, 1 )
(k, 0)
(16)
xi
.
(L + 1)2 L2L+1 (xi )
(22)
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
C. K. Datsikas et al.
Next, based on Equation (16), asymptotic MGF expressions for high- and low-SNR regions are presented. We
show that the MGF of b can be signicantly simplied
expressing it only in the form of elementary functions.
Mb (s) = 1 N!
n0 , n1 , . . . , nm1 = 0
n0 + n1 + + nm1 = N
(2)
(ah aj )
j = 1
+ 1 l l
kl 1 2 s 1
k+l
2 1
h=1
j
= h
k
(1 + bj ah )
j=1
N k ll
( )k/2 kk sl
(26)
Mequ (s)
(27)
i=1
where tmin = mini {mi i /2}. Note once again that the above
expression is given in terms of elementary functions only.
4. END-TO-END PERFORMANCE
ANALYSIS
i
i mi /21
2(mi )(i i )mi i /2
ah 1
(24)
ti 0,
> 0, then the series expansion of the
where ai > 0,
N
PDF of Z = ( i=1 1/Xi )1 is given by
fZ (z) =
N
ai ztmin + o(ztmin + )
(28)
(25)
i=1,ti =tmin
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
/2
Mb
0
d
sin2 ()
(29)
Fb
0
t2
2
exp
t2
2
x1 1/2 (1 x)1/2
k, l
G
l, k
(l, 1 )
N k l l xl
()k/2 kk l (k, 0)
dx
k, 2l
G
2l, k + l
1
N
+ tmin
i
t
(mi )(i i )mi i /2
4tmin min
(35)
i=1
According to the fast adaptive QAM technique, the constellation size is selected based on the instantaneous received
SNR at the destination. In particular, for a xed target bit
error probability, SNR thresholds for different constellation sizes are calculated. By comparing the instantaneous
SNR at the destination with these thresholds, the size of
the constellation M is adapted to provide the best possible
throughput while satisfying QoS requirements. Information
on which value of M to be set is determined after communicating the source with the destination through a reliable and
low-delay feedback link. Note that an error-free feedback
from the destination to source is being assumed.
(31)
I = l1/2
P be
(30)
C. K. Datsikas et al.
(32)
J1
j=0
1
= N!
2
k, 2l
G
2l, k + l
N
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
kl1 1
(2)
k+l
2
2
2
N
(22 1)!!
(2)2
Nm
1+
j Fequ j+1
Fequ j
M
J 1 Fequ J
+M
(36)
Pb (e | equ ) =
M log2 ( M)
log2 ( M) (12h ) M1
n0 ,n1 ,...,nm1 =0
n0 +n1 ++nm1 =N
J1
j=0
(33)
P be =
h=1
2 21
(34)
h1
(1)i2
i=0
1
i2h1
+
2
M
h1 /
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
C. K. Datsikas et al.
Q
(2i + 1)
3equ
M1
(37)
(40)
J1
j=0
j Pj
M
j=0
j j
M
P be = J1
(38)
(41)
}=
In the above equation j = P{j equ j+1
Fequ (j+1
) Fequ (j ) and Pj is the bit error probability of
the jth transmission mode, given by
Pj =
j+1
(42)
Pj = Fequ (j+1
)PMj (j+1
) Fequ (j )PMj (j )
j+1
dPMj ()
Fequ ()d
d
(43)
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
C. K. Datsikas et al.
Figure 5. End-to-end ABEP of BPSK for multi-hop wireless communication systems operating over i.i.d. GG fading channels as
a function of the average input SNR per bit (m = 3, = 1, and
N = 2, 3, 5).
C. K. Datsikas et al.
Figure 8. End-to-end BEO of a multi-hop wireless communication system operating over non identical GG fading channels
versus 1 , for an adaptive QAM scheme with Pb = 102 , N = 3,
m = 1.4, = 2.25, 2 = 2 1 , 3 = 3 1 and different constellation sizes M.
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
Figure 10. End-to-end ABEP of a multi-hop wireless communication system operating over non identical GG fading channels
versus 1 , for non-adaptive and adaptive 256-QAM schemes with
Pb = 102 , N = 3, m = 1.4, = 2.25, 2 = 2 1 and 3 = 3 1 .
6. CONCLUSIONS
In this paper, we provided union tight bounds for multihop transmissions with non-regenerative relays in series,
operating over independent GG fading channels. Using a
tight upper bound of the end-to-end SNR, novel closedform expressions for the MGF, PDF, and CDF of this
upper bounded SNR were derived. Additionally, tight lower
bounds for the OP and the ABEP were presented. Moreover the performance of fast adaptive QAM was addressed,
deriving tight bounds for the ASE, the BEO, and the ABEP.
Also, it is obvious that all the derived bounds gets tighter
as the number of relays decreases. Numerical results were
presented and demonstrated the accuracy and the tightness
of the proposed bounds. The obtained results show that the
proposed bounds gets tighter with the increase of the SNR
corresponding to computer simulation results which are also
included and verify the accuracy and the correctness of the
proposed analysis.
REFERENCES
1. Boyer J, Faloner DD, Yanikomeroglou H. Multi-hop
diversity in wireless relaying channels. IEEE Transactions on Communications 2004; 52(10): 18201830.
2. Sadek AK, Su W, Liu KJR. Multinode cooperative
communications in wireless networks. IEEE Signal Processing Letters 2007; 55(1): 341355.
3. Ikki S, Ahmed MH. Performance of Multi-Hop Relaying
Systems over Weibull Fading Channels. New Technologies, Mobility and Security. Springer: Netherlands, 2007;
3138.
4. Laneman JN, Tse DNC, Wornell GW. Cooperative diversity in wireless networks efcient protocols and outage
behaviour. IEEE Transactions on Information Theory
2004; 50(12): 30623080.
C. K. Datsikas et al.
C. K. Datsikas et al.
AUTHORS BIOGRAPHIES
Christos K. Datsikas was born in
Agrinio, Greece, in 1973. He holds
a B.Sc. from the Department of
Informatics and Telecommunications
of the University of Athens and
an M.Sc. in Techno-Economics from
the National Technical University of
Athens (NTUA). He is currently a
Ph.D. candidate at the Physics Department of the University of Athens. He is a highly skilled
I.T. Administrator and SW Engineer and has served as a
reviewer in various journals and conferences. His research
interests include multihop networks and communication
theory issues.
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm
C. K. Datsikas et al.
Wirel. Commun. Mob. Comput. (2011) 2011 John Wiley & Sons, Ltd.
DOI: 10.1002/wcm