Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Tp V-1, S 11 (31), thng 6/2014

Ti u hiu nng ca
h thng truyn thng a chng trong
mi trng v tuyn nhn thc dng nn
Optimal Performance for Underlay Cognitive Multihop Networks
Nguyn Vn Chnh, V Nguyn Quc Bo, Nguyn Lng Nht.
Abstract: In this paper, we study underlay
cognitive multihop networks where both power
constraints including the maximum tolerable
interference level at primary receivers and the
maximum transmit power at secondary transmitters
are taken into account. We obtain the exact and
approximated closed-form expressions at high and low
signal-to-noise ratio (SNR) regime for the system
outage probability. Based on the approximated
expressions, the optimization problem on relay
locations are considered. Numerical results show that
underlay multihop networks with optimal relay
positions significantly outperform that with
randomized or uniform relay positions.
I.

GII THIU

V tuyn nhn thc l cng ngh rt tim nng

cho php tn dng cc khong tn s nhn ri to ra
do chnh sch quy hoch tn s tnh. Hin nay, cng
ngh v tuyn nhn thc ang thu ht mnh m s
quan tm ca rt nhiu nh khoa hc trn th gii. Cc
nt mng s dng cng ngh v tuyn nhn thc c
kh nng hot ng song song vi mng s cp
(primary networks), l mng c bn quyn s dng tn
s, vi iu kin rng buc l hot ng truyn pht
d liu ca mng th cp khng gy can nhiu cho
mng s cp [1].
Cho n nay, c ba phng php chnh thit k
mng v tuyn nhn tc l: underlay, overlay v
interweave [2]. Trong ba phng php ny, underlay
l phng php nhn c s quan tm nhiu ca cc
nh nghin cu gn y khi m u im ca n l cho

php cc mng s cp v mng th cp c th tin

hnh hot ng truyn pht song song vi nhau.
Nhc im ca phng php ny l m bo iu
kin can nhiu nhn c ti my thu s cp, cng
sut pht ca cc my pht th cp phi c iu
chnh ph thuc vo li knh truyn can nhiu v
kt qu l vng ph sng ca mng th cp thng b
gii hn.
m rng vng ph sng, truyn thng a chng
l mt gii php n gin v c chp nhn s
dng trong nhiu chun v tuyn hin nay cng nh
chun v tuyn th h mi, v d [3-6]. Trong mng
truyn thng a chng, hiu nng ca ton mng s
ph thuc vo hiu nng ca chng yu nht [7-10], do
bi ton ti u v tr hay phn b cng sut cho cc
nt chuyn tip ca mng thng c vai tr rt quan
trng v cho php ci thin ng k hiu nng ca
mng m khng cn s dng thm ti nguyn mng.
Cho n nay, c mt s bi bo xem xt bi
ton ti u hiu nng ca mng chuyn tip trong mi
trng v tuyn nhn thc, v d [11-14]. Bi bo [11]
xem xt bi ton ti u cng sut ca mng truyn
thng hp tc trong mi trng v tuyn nhn thc s
dng phng php nhn t Lagrange vi gi s mc
rng buc can nhiu trung bnh. Bi bo [12] xem xt
bi ton phn b cng sut ti u gia mng s cp v
mng th cp trong mi trng v tuyn nhn thc
dng xen k. Gn y, hai bi bo [13] v [14] ln lt
xem xt bi ton ti u ca nt chuyn tip th cp
knh truyn fading Rayleigh v Nakagami-m, tuy
nhin c hai bi bo u b qua iu kin rng buc v

- 59 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Tp V-1, S 11 (31), thng 6/2014

cng sut pht ti a ca cc nt pht th cp, lm kt

qu ca bi ton ti u t c c phn khng thc
t.

III. PHN TCH XC SUT DNG CA H

THNG TH CP

Trong bi bo ny, chng ti xem xt ti u v tr

ca cc nt chuyn tip ca mng th cp a chng
trong mi trng v tuyn nhn thc dng nn vi hai
iu kin rng buc v cng sut chu ng can nhiu
ti a ti my thu s cp v cng sut pht ti a ti
my pht th cp. Bi ton ti u c xut v gii
da vo biu thc dng ng ca xc sut dng h
thng c xp x vng t l tn hiu trn nhiu cao
v thp v m hnh knh truyn suy hao n gin. Cc
kt qu s xc nhn tnh ng n ca li gii v
u im ca vic ti u v tr ca cc nt chuyn tip.

chng th cp, ta gi hD ,k v hI ,k ln lt l h s

II. M HNH H THNG

Xem xt h thng truyn thng nhn thc trong
mt cp thu (PU-Rx) v pht (PU-Tx) s cp tn ti
cng vi mt mng th cp a chng. Qu trnh truyn
thng tin gia nt ngun th cp (CR 1 ) v nt ch
th cp

( CR K +1 )

vi knh truyn fading Rayleigh

c thc hin trong K khe thi gian trc giao vi s

h tr ca K 1 nt chuyn tip v tuyn nhn thc,
k hiu CR 2 ,,CR K . Cc nt chuyn tip trong
mng s dng k thut gii m v chuyn tip (DF:
Decode-and-Forward), tc l cc nt trung gian ny s
gii m tn hiu nhn c t cc nt trc n, thc
hin m ha li v sau pht tn hiu c m
ha li ti nt tip theo. u im ca k thut chuyn
tip DF l d dng p dng cho cc h thng c p
dng m ha.
Gi s rng nt ngun th cp v tt c cc nt
chuyn tip u c thng tin trng thi knh truyn
(CSI: Channel State Information) ca tt c cc knh
truyn t CR k n PU, cn gi l knh truyn can
nhiu. Trong thc t, cc my pht th cp c c
cc thng tin trng thi thng tin knh truyn ny
thng qua ng truyn trc tip t PU hoc gin tip
t bn th ba c vai tr qun l ngun ti nguyn ph
ca h thng.

Xt chng th k ca mng v tuyn nhn thc a

knh truyn ca ng truyn t my pht th cp th
k (SU k ) ti my thu th cp tip theo (SU k +1 ) v t
my pht th cp th k (SU k ) ti my thu s cp
(PU-Rx). bo v s truyn dn ca h thng s cp
theo phng php dng nn (underlay), trong h thng
xem xt, cng sut ca tn hiu can nhiu to ra bi
bt k s truyn dn no ca cc nt th cp u phi
thp hn mc cng sut can nhiu chu ng ti a
ca my thu s cp (PU-Rx). Ni cch khc, cc my
pht th cp ch c php s dng di ph cp
php cho h thng s cp min l n khng gy nh
hng ti qu trnh truyn thng ca h thng s cp,
c th l cng sut can nhiu ca mng th cp gy ra
ti my thu s cp phi nh hn mt mc can nhiu
m my thu s cp chu ng c.

c trng cho kh nng chu ng can nhiu

ti a ca h thng s cp, ta t I p l mc cng sut
can nhiu chu ng ti a ca my thu s cp. Do ,
ta d dng nhn thy rng bn cnh cng sut truyn
ti a Pm (quy nh bi phn cng), cng sut pht Pk
ca SU k cn phi b rng buc bi I p . Biu din bng
biu thc ton hc, ta c cng sut pht ca chng th
k nh sau [15]:

Pm ,

Pk =
Ip ,
h 2
I ,k

Ip
hI ,k

(1)

Ip
hI ,k

> Pm

Pm

Vit li biu thc (1) dng rt gn, ta c:

Pk = min
, Pm
2
hI ,k

(2)

Gi k l t s tn hiu trn nhiu tc thi ca

ng truyn chng k , ta c:

- 60 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

k = Pk hD ,k

{ } , vi E{.} biu th ton t trung bnh

I , k = E hI , k

N0

I
h 2
p
D ,k
= min
, Pm
2
hI ,k
N 0

(3)

ti my thu th cp. Theo phng php truyn nn, c

hai h thng s cp v th cp hot ng song song
vi nhau, nn cc my thu th cp s nhn tn hiu can
nhiu t my pht s cp. Khi xem xt can nhiu gy
ra ca my pht s cp n my thu s cp, t s tn
hiu trn nhiu ca chng th k c dng nh sau:

k =

Pp hP ,k + N 0

I
= min Pm , p

hI ,k

(4)

hD ,k

,
2
Pp hP ,k 2 + N 0

vi Pp l cng sut pht ca my pht s cp v hP ,k

l h s knh truyn t my pht s cp n my thu
th cp chng k . Ta d dng nhn thy rng biu
thc (4), t s tn hiu trn nhiu tc thi ca mi
chng s ph thuc vo cng sut pht ti a ca my
pht th cp ( Pm ) , cng sut can nhiu chu ng ti

k vng thng k. Hm mt phn b xc sut

pht s cp ( Pp ) . Tuy nhin, trong iu kin m vng

ph sng ca my pht s cp ln hn rt nhiu so vi
vng ph sng ca my pht th cp, v d chun
IEEE 802.22 [16], chng ta c th xem can nhiu t
my pht s cp n cc nt th cp l nhiu trng
trong mng th cp. Gi thuyt ny c chp nhn
trong nhiu nghin cu gn y, v d [15,17-19], kt
qu l ta c th xp x tn hiu trn nhiu tc thi nh
biu thc (3). K t y, chng ta s s dng biu
thc (3) thc hin cc phn tch tip theo.
Xt knh truyn fading Rayleigh, hD ,k

v hI ,k

l hai bin ngu nhin c phn b hm m vi cc

s

tng

ng

D ,k = E hD ,k

vi Z {D, I } c dng ln lt nh sau:

f

hZ,k

( x) =

Z,k

x
exp

Z,k

(5a)

x
(5b)

hZ,k
Z,k
Tng ng vi biu thc t s tn hiu trn nhiu
cng thc (3), biu thc xc sut dng h thng
truyn thng a chng th cp c xc lp [20,
Eq. (6)]. Tuy nhin, dng ca biu thc OP rt phc
tp, v khng th s dng gii bi ton ti u hiu
nng ca h thng. gii quyt kh khn ny, trong
bi bo ny, chng ti xut s dng k thut xp x
vng t l tn hiu trn nhiu thp v cao t hai quan
st quan trng nh sau:
F

( x ) = 1 exp

+ Trng hp 1: khi I p Pm dn n Pk Pm .
+ Trng hp 2: khi I p Pm dn n Pk

a ca my thu s cp ( I p ) v cng sut pht ca my

tham

(PDF) v hm phn b xc sut tch ly (CDF) hZ,k

vi N 0 biu th phng sai ca nhiu trng (AWGN)

Pk hD ,k

Tp V-1, S 11 (31), thng 6/2014

Ip
hI ,k

Do , bi ton ti u hiu nng h thng s c

chia ra hai trng hp tng ng nh trn. T l tn
hiu trn nhiu tc thi ca chng k ca tng trng
hp s vit li nh sau:
2
Pm
N hD ,k , TH 1
0
2
(6)
k
I p hD ,k , TH 2
N0 h 2
I,k

Vic chia thnh hai trng hp ring bit (TH 1 v

TH 2) s gip cho vic gii bi ton ti u s tr nn
n gin hn. Ch rng trng hp 1 (TH 1) l
tng ng vi trng hp mng truyn thng a
chng dng truyn thng, ngha l cng sut pht ca
my pht th cp ch chu nh hng phn ln bi gi

- 61 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Tp V-1, S 11 (31), thng 6/2014

tr Pm . Sau y, chng ti s nh gi hiu nng ca

k =

h thng theo tng trng hp.

Xc sut dng l mt tham s hiu nng quan
trng cho bt k h thng v tuyn no, cho php
chng ta nh gi hiu nng ca mt h thng v
tuyn m khng cn bit kiu iu ch c th ca h
thng. Xc sut dng thng c nh ngha l xc
sut m t l tn hiu trn nhiu ca h thng nh hn
mt ngng dng cho trc, thng l mc t l tn
hiu trn nhiu h thng gii iu ch ng [2].
Trong phn ny, chng ta s nh gi xc sut
dng ca h thng ang xem xt s dng k thut gii
m v chuyn tip. Vi h thng truyn thng a
chng dng gii m v chuyn tip, h thng c
xem l dng khi v ch khi t s tn hiu trn nhiu
ca chng yu nht nh hn mt gi tr ngng cho
trc, th . iu ny tng ng vi xc xut m t s
tn hiu trn nhiu tng ng ca h thng e2e ca

F k ( ) = 1 e
vi k =

(11)

Pm D ,k
. Thay th (11) vo (9), ta tm c
N0

biu thc dng ng ca xc sut dng h thng nh

sau :
OP = 1 e th
K

vi =
k =1

(12)

Trng hp 2: Cng tng t nh Trng hp 1,

ta bt u t t s tn hiu trn nhiu ca chng th k ,
c dng nh sau:

k =

I p hD ,k
N 0 hI ,k

2
2

(13)

tm hm CDF ca k , ta s dng khi nim

xc sut iu kin, c th nh sau:

I h 2

D ,k

<

F k ( ) = Pr p
N 0 hI,k 2

(8)

x
= Pr hD ,k <
f ( x )dx
I p hI,k 2

N 0

Gi s rng cc knh truyn ca cc chng l c

lp vi nhau, khi t cng thc (8) c th c suy
ra nh sau:
K

(14)

x 1 I ,k

= 1 exp
e dx

Ip
I ,k
0
N D , k

Sau khi thc hin tch phn theo x , ta c

OP = 1 Pr ( k > th )

k =1
K

=1 1 Pr ( k th )

(10)

c dng

nh sau:

e2e = min k =1,,K k

knh truyn fading Rayleigh, hm CDF ca k

K chng thp hn th , c th l
1

OP = Pr log 2 (1 + e2e ) < th

(7)
K

Theo [10, 21], t s tn hiu trn nhiu tng

ng ca h thng, e2e , c th biu bin theo k

Pm
hD ,k
N0

(9)

k =1
K

=1 1 F k ( th )
k =1

F k ( ) =

c th xc nh OP , ta cn xc nh F k ( th )
trong (9) tng ng vi hai trng hp 1 v 2.

Trng hp 1: Ta vit li biu thc t s tn hiu

trn nhiu tc thi ca chng th k nh sau:

- 62 -

+ k

(15)

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

vi k =

Tp V-1, S 11 (31), thng 6/2014

I p D ,k
. Thay th biu thc (15) vo (9), ta
N 0 I ,k

PU(x P, yP )

c xc sut dng ca h thng trong trng hp ny

c dng nh sau
K

OP = 1
k =1

Kt hp hai biu thc (12) v (16), xc sut dng

ca h thng c vit li nh sau :
TH 1

(17)

TH 2

IV. BI TON TI U HIU NNG CA H

THNG
Do mng nghin cu l mng truyn thng a
chng th cp dng nn, cng sut pht ca cc my
pht th cp s b gii hn bi Pm v bi mc can
nhiu chu ng ti a, I p . Do , bi ton ti u
cng sut pht l khng kh thi khi m cng sut pht,
Pk , ca chng th k , ph thuc vo li knh
2

truyn can nhiu hI ,k . Kt qu l Pk thc t l mt

2

bin ngu nhin ph thuc bin ngu nhin hI ,k . Do

, ci thin hiu nng h thng (gim xc sut

dng h thng), th cch kh thi l thay i li knh
truyn trung bnh, hay ni chnh xc hn l ti u v
tr ca cc nt chuyn tip.
Trong phn ny, chng ti tp trung vo cc tiu
ha xc sut dng h thng bng cch tm v tr nt
chuyn tip ti u. C th, cho trc cc tham s ca
mng truyn thng a chng th cp s dng k thut
gii m v chuyn tip (DF) hot ng da trn giao
thc dng nn bao gm ta ca ca nt thu s cp,
nt ngun th cp, nt ch th cp v s lng cc
chng. Vn t ra l xc nh nhng v tr ti u
cho cc nt chuyn tip sao cho xc sut dng h
thng l nh nht.

dI ,3

dI ,2

CR 4 (1, 0)

CR1(0, 0)

(16)

th + k

1 e th ,

K
OP =
k
1 +
k
k =1 th

dI ,1

dD ,2

dD ,1

dD ,3

Hnh 1. M hnh mng v tuyn nhn thc ba chng

DF chuyn tip dng nn cng nm trn mt ng
thng.
n gin, ta xem xt m hnh mng c minh
ha nh trong Hnh 1, y tt c cc nt mng th
cp c kt ni trn mt ng thng t nt ngun
n nt ch ca mng th cp. L do ca vic chn
m hnh ny l tnh ph dng (c la chn nhiu
trong nghin cu mng a chng) v tnh n gin.
ng thi m hnh ny d dng m rng ra cc m
hnh phc tp khc m khng thay i bn cht m
hnh. Ta gi s rng ton b khong cch t ngun ti
ch chun ha bng mt, c th
d D ,1 + d D ,2 + ... + d D , K = 1

(18)

vi d D ,k biu th chiu di ca chng th k . Cho

trc v tr ca my thu s cp ( xp , yp ) v c nh s
chng th cp K , bi ton ti u c pht biu
dng ton hc nh sau:
min OP s.t. d D ,1 + d D ,2 + ... + d D , K = 1

(19)

Ta d dng nhn thy rng cng thc xc sut

dng chnh xc ca h thng, trnh by cng thc
(17) dng phc tp nn thc hin gii quyt bi
ton ti u, ta thc hin xp x biu thc (17) nh sau:
1
1
th + +
, TH 1
K
1
OP
1 + + 1 , TH 2

th
K
1

(20)

Vi TH 1, ta s dng xp x e x 1 x khi x nh,

trong khi vi TH 2, ta s dng xp x (1 + x ) 1 = 1 x
K

k =1

- 63 -

(1 x ) 1 x
k =1

vi x v xk nh.

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

S dng m hnh knh truyn suy hao n gin,
[2], i.e., Z ,k = d Z ,k , vi d Z ,k l khong cch vt l
ca knh truyn loi Z chng k v 2 biu th s

= 2 khi mi trng

m suy hao ng truyn.

Tp V-1, S 11 (31), thng 6/2014

2

k 1

d = y + xp d D ,
(28)
=1

Kt hp (27) v (28), ta c h K phng trnh

khng tuyn tnh cho K bin d D ,1 ,, d D ,K c cho
2
I ,k

2
p

truyn l khng gian t do v = 5 v 6 vi mi

nh sau

trng truyn l vng th nh cao tng, bi ton ti

u cng thc (19) vit li dng r hn nh sau:

d D ,1 + + d D , K 1 = 0

d D ,2
2
2
2
2
+ yp = 0
( xp d D ,1 ) ( xp + yp )

d D ,1
(29)
.
..

2
K 1

d D,K

2
2
2
xp d D ,k ( xp + yp )
+ yp = 0
d
k =1

D ,1
H phng trnh trn l h phng trnh khng
tuyn tnh c th gii bng cc phng php thng
thng, v d Levenberg-Marquardt, nh cp
[22]. Trong thc t, h phng trnh (29) c th gii
bng cc phn mm tnh ton thng dng, v d nh
Matlab vi hm fsolve hoc Mathematica vi hm
Solve. Trong trng hp s chng bng hai, tc l
K = 2 , h phng trnh (29) c th rt gn v phng
trnh bc 4 nh sau

min

P d
k =1

s.t.

D ,k

d
k =1

D ,k

=1

(21)

D ,k

=1

(22)

cho Trng hp 1 v

d
min I ,k

k =1 d D ,k
cho Trng hp 2.
K

s.t.

d
k =1

Trng hp 1: gii bi ton ti u (21), khi

d Z,k l cc s dng v Pm l mt tham s quy nh
trc ca h thng (khi thit k ch to), ta p dng
bt ng thc Cauchy nh sau
1/ K

K
1

k =1 d D ,k
k =1 d D ,k
Du = trong (23) xy ra khi v ch khi
K

1
d D ,1

1
d D ,2

= =

(23)

d D4 ,1 2 x p d D3 ,1 + 2( x 2p + y 2p )d D ,1 ( x 2p + y 2p ) = 0 (30)

1
d D ,K

(24)

Kt hp iu kin rng buc (21) vi (24), ta c

th tnh c gi tr d D ,k vi k = 1,, K nh sau:
d D ,1 = d D ,2 = = d D ,K

(25)

Trng hp 2: Vi bi ton ti u (22), ta cng

p dng bt ng thc Cauchy dn n

d I ,k
d I ,k K
(26)

d
k =1 d D , k
D
,
k

OP ca h thng s cc tiu khi du = din ra,

khi
K

d I ,1 d I ,2
d
=
= = I ,K
d D ,1 d D ,2
d D ,K

D dng chng minh rng phng trnh bc 4 (30)

lun lun c nghim trong khong [0,1] . Tht vy, t
g ( d D ,1 ) = d D4 ,1 2 x p d D3 ,1 + 2( x 2p + y 2p )d D ,1 ( x 2p + y 2p ) ,
ta c
g (1) = 1 2 x p + 2( x 2p + y 2p ) ( x 2p + y 2p ) = y 2p + ( x p 1)2 > 0
( xp , yp ) v

g (0) = ( x 2p + y 2p ) 0 ( x p , y p )

d n

n g (0) g (1) 0 . Phng trnh bc 4 trn c

nghim nh sau:

3
x 1
1
d D ,1* = P 0 + 4 + 2 0 4
2 2
2
2 0 + 4
(31)

(27)

vi
0 = xP2 ,

S dng nh l Pytago, d I ,k , c dng nh sau :

1 = 12d sp2 (x P 1),

- 64 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

2 = 108d I4,1 108d I2,1x p 2 ,

n s c chn ngu nhin trong khong t (0,1) v

3 = 8 x 3p 16d I4,1 ,

ta y ca n c nh 0. Khi cc nt mng chuyn

tip th cp c chn theo phng php phn b
u, th khong cch gia cc nt s l 1 K .

4 =

1
3

Tp V-1, S 11 (31), thng 6/2014

2
3

2 + 2 41

1 3 2 + 2 41
3
2

Kt hp li gii ca hai trng hp 1 v 2, ta c

li gii tng qut cho bi ton ti u h thng truyn
thng a chng th cp cho c hai trng hp
Pm I p v Pm I p . V c bn, khi Pm I p th h
thng th cp khng b rng buc v mc can nhiu
ca h thng s cp nn cc nt chuyn tip t cch
u nhau s cho hiu nng mng th cp ti u.
Ngc li, khi Pm I p , th h thng th cp s ti u
nu cc chng c t s li knh truyn d liu v
knh truyn can nhiu l nh nhau. Trong phn tip
theo, ti s trnh by mt s kt qu s chng minh
tnh ng n ca kt qu t c cng nh u im
vic ti u v tr ca cc nt chuyn tip so vi trng
hp khng ti u.

V. KT QU PHN TCH
Phn ny bao gm hai mc tiu. u tin chng
ti cung cp cc kt qu m phng xc nhn
phng php phn tch xut cc phn trn l ng
n, ng thi ch ra rng hiu nng ca mng (xc
sut dng h thng) th cp s ci thin khi ti u v
tr ca cc nt chuyn tip.
Knh truyn s dng trong ton b chng trnh
m phng l knh truyn fading Rayleigh. Gi s rng
v tr ca nt ngun v nt ch ca mng th cp ln
lt ti ta (0,0) v (1,0). ng thi gi s thm
rng ta ca nt thu s cp l ( xp , yp ) vi tt c cc
ngi dng ca mng th cp c v tr cng nm trn
mt ng thng v khong cch gia nt ngun v
nt ch c chun ha bng mt. kim chng u
im ca bi ton ti u hiu nng, phn b nt
chuyn tip ngu nhin v u s c dng so
snh. Khi cc nt mng chuyn tip th cp c chn
theo phng php ngu nhin ngha l ta x ca

Hnh 2. Xc sut dng h thng theo Pm vi I p N 0 = 10

dB, = 4 , v ( xp , yp ) = (0.5,1) .
Trong Hnh 2, chng ti kho st xc sut dng
ca h thng khi thay i s lng cc chng ca h
thng th cp t 1 n 5. Ch rng trng hp
K = 1 tng ng vi trng hp h thng truyn trc
tip. m bo tnh cng bng trong so snh, cng
sut pht ca h thng l khng i khi tng s chng.
Nh quan st trn Hnh 2, trong iu kin rng buc
v cng sut pht v can nhiu my thu s cp, th
mng vi s chng ln hn khng phi lun lun cho
hiu nng tt hn. So snh mng vi s chng t 1 n
5 ta thy mng c s chng bng K = 3 cho hiu nng
tt nht v mng c 5 chng cho hiu nng km nht.
Khi t s tn hiu trn nhiu nh hn 10 dB, truyn
thng trc tip cho hiu nng tt hn c trng hp
mng c 5 chng. Ch rng cc kt lun nh trn l
khng cn ng vng t s tn hiu trn nhiu cao,
c th l trn 15 dB. vng t s tn hiu trn nhiu
ny th mng c 4 chng s cho hiu nng tt nht, k
tip theo l mng c 5 chng. Do , c th kt lun
rng mi quan h gia s chng v hiu nng ca h
thng a chng th cp khng phi l mt hm tuyn
tnh.

- 65 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Khi vng t l tn hiu trn nhiu thp, t s tn
hiu trn nhiu tng th xc sut dng ca h thng
tng theo, tuy nhin xc sut dng ca h thng s tr
nn bo ha (khng tng) vng t l tn hiu trn
nhiu cao. Hin tng ny d dng l gii khi quan st
cng thc xc nh cng sut pht ca cc my pht
th cp.

Hnh 3. Kim chng cng thc (17) vi I p N 0 = 10

dB, = 4 , v ( xp , yp ) = (0.5,1) .

Tp V-1, S 11 (31), thng 6/2014

cho li gii ti u dng ng. S chng ca m hnh

kho st l 3, tc l K = 3 . Trn Hnh 3, c 4 ng
c th hin bao gm: ng kt qu phn tch chnh
xc (Exact), ng kt qu xp x vng nhiu thp
(Low Approximation) v ng kt qu xp x
vng nhiu cao (High Approximation) v cui cng
l ng kt qu m phng (Simulation). Ta thy
rng ng kt qu phn tch chnh xc v kt qu m
phng l hon ton trng nhau trong ton di t l tn
hiu trn nhiu ang xem xt. Bn cnh , ng xp
x vng nhiu thp v vng nhiu cao cng hi t
tng ng vi ng kt qu chnh xc vng t l
tn hiu trn nhiu xem xt. Kt qu ny cho php
chng ta kim chng li ln na tnh ng n ca xp
x trong cng thc (17).
Hnh 4 thc hin so snh cc phng php phn
b nt chuyn tip cho mng c 4 chng. Ta d dng
nhn thy hiu qu ca phng php phn b ti u
khi gi tr t l tn hiu trn nhiu ln hn 10 dB, l
gi tr ca I p . Khi , xc sut dng ca h thng cho
bi phng php phn b ti u c dch xung di
mt khong ln so vi phng php phn b ngu
nhin. Bn cnh , chng ta cng thy rng xc sut
dng ca h thng s dng phng php phn b u
v phng php phn b ti u vng t l tn hiu
trn nhiu nh hn 10 dB l nh nhau do phn trn
chng ta chng minh c rng vng t l tn hiu
nh th hiu nng ca h thng th cp khng ph
thuc vo gi tr I p v khi mng th cp s t
hiu nng tt nht khi cc chng l phn b u nhau.

Hnh 4. So snh cc phng php phn b nt chuyn

tip th cp vi I p N 0 = 10 dB, = 4 , v
( xp , yp ) = (0.8, 0.4) .
Trong Hnh 3, chng ti kim tra tnh ng n
ca cc xp x ca cng thc (17) l c s ton hc
quan trng gii bi ton ti u hiu nng khi m
cng thc chnh xc dng ng ca xc sut dng h
thng khng dng hp dn v mt ton hc c th

Hnh 5 th hin nh hng ca mi trng truyn

(thng qua h s suy hao ng truyn) ln xc sut
dng ca h thng khi s dng phng php phn b
ti u. Khi gi tr tng ln th th xc sut dng ca
h thng tng ln v ng thi u im ca phng
php phn b ti u cng r nt. L do ca vic ny l
khi h s ng truyn tng ln, nh hng ln n
li knh truyn trung bnh v lm cho t s k thay

i.

- 66 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Tp V-1, S 11 (31), thng 6/2014

VI. KT LUN

Hnh 5. nh hng ca mi trng truyn ln hiu

nng ca h thng th cp.

Trong bi bo ny, chng ti phn tch v nh

gi h thng truyn thng phn tp a chng s dng
k thut gii m v chuyn tip ng dng cng ngh
v tuyn nhn thc hot ng da trn giao thc dng
nn (underlay). ng gp ca bi bo l gii bi
ton phn b ti u v tr nt chuyn tip ca mng
th cp cho trng hp tng qut, thch hp c vng
t l tn hiu trn nhiu cao ln thp. Kt qu m
phng chng minh u im ca phng php phn
b ti u hiu qu hn so vi phng php chia u
khong cch hoc chn khong cch ngu nhin ca
h thng truyn thng phn tp a chng ng dng
cng ngh v tuyn nhn thc trong iu kin rng
buc mc can nhiu v cng sut pht ti a.

LI CM N
Nghin cu ny c ti tr bi Qu pht trin khoa
hc v cng ngh quc gia (NAFOSTED) trong ti
m s 102.04-2012.20.

TI LIU THAM KHO

Hnh 6. nh hng ca v tr nt thu s cp I p N 0 = 10

dB, = 4 , v K = 3 .
Trong Hnh 6, chng ti kho st nh hng ca
nt thu s cp ln hiu nng ca h thng c s dng
phng php phn b ti u nt chuyn tip th cp
v ng thi so snh vi phng php phn b u. Ta
c th thy rng khi v tr ca nt s cp cng xa h
thng th cp th hiu nng ca h thng th cp c
ci thin ng k. V ng thi li cho bi phng
php phn b ti u so vi phng php phn b u
vng t l tn hiu trn nhiu cao c v gim khi nt
chuyn tip tin ra xa mng th cp.

[1] M. Wellens, J. Wu, and P. Mahonen,

"Evaluation of Spectrum Occupancy in Indoor and
Outdoor Scenario in the Context of Cognitive Radio,"
in Proc. 2nd Int. Conf. Cognitive Radio Oriented
Wireless Networks and Communications CrownCom
2007, 2007, pp. 420-427.
[2] A.
Goldsmith,
Wireless
communications,
Cambridge; New York: Cambridge University Press,
2005.
[3] K. Loa, W. Chih-Chiang, S. Shiann-Tsong, Y.
Yifei, M. Chion, D. Huo, et al., "IMT-advanced
relay standards [WiMAX/LTE Update]," IEEE
Communications Magazine, vol. 48, pp. 40-48, 2010.
[4] I.

P.

Chochliouros,

A.

Mor,

K.

N.

Voudouris, G. Agapiou, A. Aloush, M.

Belesioti, et al., "A Multi-Hop Relay Station
Software Architecture Design, on the Basis of the
WiMAX IEEE 802.16j Standard," in Proc. IEEE 69th
VTC Spring Vehicular Technology Conference 2009.,
2009, pp. 1-6.

- 67 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

[5] V. Genc, S. Murphy, Y. Yu, and J. Murphy,
"IEEE 802.16J relay-based wireless access networks:
an overview [recent advances and evolution of WLAN
and
WMAN
standards,"
IEEE
Wireless
Communications, vol. 15, pp. 56-63, 2008.
[6] I. P802.16j, "IEEE Standard for Local and
Metropolitan Area Networks, Part 16: Air Interface for
Fixed and Mobile Broadband Wireless Access Systems:
Multihop Relay Specification," in 802.16 Relay Task
Group
vol.
P802.16j/D3,
ed.
http://ieee802.org/16/relay/docs/80216j-06_026r4.zip,
2008.

[13] V. N. Q. Bao, T. T. Thanh, N. T. Duc, and V. D.

Thanh, "Spectrum Sharing-based Multihop Decodeand-Forward Relay Networks under Interference
Constraints: Performance Analysis and Relay Position
Optimization," Journal of Communications and
Networks, vol. 15, pp. 266-275, 2013.
[14] B. Tae Won, C. Wan, J. Bang Chul, and S. Dan
Keun, "Multi-user diversity in a spectrum sharing
system,"
IEEE
Transactions
on
Wireless
Communications, vol. 8, pp. 102-106, 2009.
[15] C. Cordeiro, K. Challapali, D. Birru, and
N. Sai Shankar, "IEEE 802.22: the first worldwide
wireless standard based on cognitive radios," in Proc.
2005 First IEEE International Symposium on New
Frontiers in Dynamic Spectrum Access Networks
(DySPAN 2005), 2005, pp. 328-337.

[7] M. O. Hasna and M.-S. Alouini, "Optimal power

allocation for relayed transmissions over Rayleighfading channels," IEEE Transactions on Wireless
Communications, vol. 3, pp. 1999-2004, 2004.
[8] M. O. Hasna and M.-S. Alouini, "Harmonic mean
and end-to-end performance of transmission systems
with relays," IEEE Transactions on Communications,
vol. 52, pp. 130-135, 2004.
[9] M. O. Hasna and M.-S. Alouini, "End-to-End
Performance of Transmission System with Relays over
Rayleigh-Fading Channels," IEEE Transactions on
Wireless Communications, vol. 2, pp. 1126-1131,
November 2003.
[10] W. Yue, B. Zheng, and Q. Meng, "Optimal power
allocation for cognitive relay networks," in Proc. 2009
International Conference on Wireless Communications
& Signal Processing (WCSP'09), Nanjing, 2009, pp. 15.
[11] L. Yifan, W. Ping, and D. Niyato, "Optimal
power allocation for secondary users in cognitive relay
networks,"
in
Proc.
2011
IEEE
Wireless
Communications
and
Networking
Conference
(WCNC'11), pp. 862-867.
[12] T.-T. Tran, V. N. Quoc Bao, V. Dinh Thanh,
and T. Q. Duong, "Performance analysis and optimal
relay position of cognitive spectrum-sharing dual-hop
decode-and-forward networks," in Proc. 2013
International Conference on Computing, Management
and Telecommunications (ComManTel'13), 2013, pp.
269-273.

Tp V-1, S 11 (31), thng 6/2014

[16] J. Lee, H. Wang, J. G. Andrews, and D. Hong,

"Outage Probability of Cognitive Relay Networks with
Interference Constraints," IEEE Transactions on
Wireless Communications, vol. 10, pp. 390-395, 2011.
[17] Z. Caijun, T. Ratnarajah, and W. Kai-Kit,
"Outage Analysis of Decode-and-Forward Cognitive
Dual-Hop Systems with the Interference Constraint in
Nakagami-m Fading Channels," IEEE Transactions on
Vehicular Technology, vol. 60, pp. 2875-2879, 2011.
[18] V. N. Q. Bao and D. H. Bac, "A Unified
Framework for Performance Analysis of DF Cognitive
Relay Networks under Interference Constraints," in
Proc. 2011 International Conference on ICT
Convergence, Seoul, Korea, 2011, pp. 537 542.
[19] V. N. Q. Bao and T. Q. Duong, "Outage Analysis
of Cognitive Multihop Networks under Interference
Constraints," IEICE Trans Commun, vol. E95-B, pp.
1019-1022, Mar. 2012.
[20] M. O. Hasna and M.-S. Alouini, "Outage
Probability of Multihop Transmission over Nakagami
Fading Channels," IEEE Communications Letters, vol.
7, pp. 216-218, May 2003.
[21] E. K. P. Chong and S. H. Zak, "An introduction to
optimization," IEEE Antennas and Propagation
Magazine, vol. 38, p. 60, 1996.

Nhn bi ngy: 9/12/2013

- 68 -

Cc cng trnh nghin cu, pht trin v ng dng CNTT-TT

Tp V-1, S 11 (31), thng 6/2014

S LC V TC GI
NGUYN LNG NHT

NGUYN VN CHNH

Sinh ngy 20 thng 1 nm 1969

Sinh ngy 31 thng 7 nm 1968.

Nhn bng thc s chuyn ngnh
v tuyn in t v thng tin lin
lc ti Hc Vin K Thut Qun
S vo nm 2000. Hin l nghin
cu sinh ti Hc Vin Bu Chnh

Nhn bng Tin s chuyn ngnh

Vin Thng ti i Hc Thng
Tin Lin Lc Matxcova.

Vin Thng.

Hin cng tc ti Khoa K Thut

in T, Hc Vin CN Bu Chnh Vin Thng C S
TP. H Ch Minh.

Hin cng tc ti Trng S Quan Thng Tin Nha

Trang

Lnh vc nghin cu: X l s tn hiu cho thng tin

v tuyn

Lnh vc nghin cu: thng tin v tuyn v v tuyn

nhn thc

in thoi: +84-8-37305317
E-mail: nhatnl@ptithcm.edu.vn

in thoi: 0989689387
E-mail: vanchinhsqtt@gmail.com
V NGUYN QUC BO
Sinh ngy 03 thng 6 nm 1979.
Nhn bng tin s chuyn ngnh
thng tin v tuyn ti i Hc Ulsan
Hn Quc vo nm 2010.
Hin l ging vin ti B mn V
Tuyn, Khoa Vin Thng, Hc Vin CN Bu Chnh
Vin Thng C S TP. H Ch Minh.
Lnh vc nghin cu: thng tin v tuyn v thng tin
s, tp trung vo truyn thng hp tc, h thng
MIMO, nng lng xanh, v tuyn nhn thc v bo
mt lp vt l.
in thoi: 0913454446
Email: baovnq@ptithcm.edu.vn

- 69 -