Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
Mt thut ton iu khin
mn knh cn bng ti ng mng di ng t bo

A control algorithm channel borrowing
for dynamic load balancing cellular mobile network

Thi Quang Vinh
(1)
, H Mnh o
(2)
Vin Cng ngh thng tin(IOIT)
tqvinh@ioit.ac.vn
(1)
, hmdao@ioit.ac.vn
(2)

Tm tt
Trong bi bo ny, chng ti xut thut ton mn
knh cn bng ti ng mng di ng t bo vi tp
lut c pht sinh t ng trn c s s dng b iu
khin mng n ron m vi php o subsethood nng
cao cht lng ca b iu khin. Sau chng ti
thc hin m phng v so snh kt qu vi cc phng
php truyn thng LBSB v Adapt. Kt qu m phng
cho thy thut ton mi tt hn cc thut ton truyn
thng nh s dng mng n ron m vi u im ca
php o subsethood.
Abstract
In this paper, we proposed channel borrowing
algorithm for dynamic load balancing in cellular
mobile network with the set rules are generated
automatically based on the Neuro-fuzzy controller
using subsethood measurements to improve the quality
of the controller. We then perform simulations and
compare the results with traditional methods.
Simulation results show that new algorithms for better
performance traditional algorithms by the advantages
of measurements subsethood.
K hiu
Hm lin thuc m
{} Tp cc i lng
e
Thuc tp cc i lng
A
i
, B
i
C
i
Gi tr hm lin thuc m tp m i
x,y,z Cc bin m
f
(i)
Mng u vo nt n ron
Hng s hc
IL, OL Gi tr ngn ng tp m u vo v ra
R
k
Lut th k
, c
k
Tham s hm Gauss
Trng lin kt lp iu kin vi lp lut
Trng lin kt lp lut vi lp kt lun
Php subsethood lin kt m
Trng lin kt lp kt lut vi lp ra
E Hm mc tiu
Bc thi gian
Ch vit tt
NFS Neuron-Fuzzy-Subsethood
MISO multi input single output
FIFO Fist-In-Fist-Out
QoS Quality of Service
BS Base station
MSC Mobile switch Center
FCL Fuzzy Control Logic
BP Back Propagation

1. Gii thiu
Trong nhng nm gn y, s pht trin s lng thu
bao mng di ng t bo tng ln nhanh chng cng
vi nhu cu s dng dch v a phng tin, truy cp
internet i hi cn s lng knh truyn thng
nhiu hn cho mt cuc gi ca ngi s dng. Nhng
do ph tn s cp cho mng gii hn nn vic qun l
hiu qu v chia s knh gia cc thu bao tr thnh
vn cc k quan trng trnh tc nghn mng v
m bo cung cp cht lng dch v(QoS) theo yu
cu[6,7,8,9,10,11,12,13,14,15,16,18,19,20,21,22].
Trong thc t ti phn b trong h thng mng khng
u, bin i theo thi gian v bin i t t bo ny
ti t bo kia. Mt s t bo tr nn qu ti hay cn gi
l t bo nng, trong khi mt s t bo khc th ti nh
hay cn gi l t bo lnh. thc hin cn bng ng
ti t bo c nhiu thut ton c xut
[6,7,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,
24,25,26,27]. Trong cc thut ton da trn mn
knh t cc t bo lnh c s dng ph bin. Mt
vn quan trng cn bng ng ti l phi thu thp
c thng tin v ti t bo. y l mt vn phc
tp v tn nhiu thi gian. Cc phng php mn
knh truyn thng thng phn bit trng thi ti ca t
bo bng cch s dng cc gi tr ngng c nh
phn bit [5,6,7,8,9,10,11,12,13,14,22]. Mt t bo
c gi l nng nu t s ca s cc knh cho php
ca mt t bo v tng s knh c cp cho t bo
l nh hn hoc bng gi tr ngng, ngc li gi l t
bo lnh. Hn ch ca cc thut ton ny l gi tr
ngng c nh[23,26,27] c th gy cho t bo xut
hin mt chui thay i trng thi ti bt thng khi ti
ca t bo dao ng xung quanh gi tr ngng.
iu ny gy cho h thng mt n nh v truyn cc
thng ip khng cn thit mc cao. Trong thc t
gii quyt vn cc t bo nng bin i theo thi
835
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
gian bng cch gia tng rng bng thng cho t bo
t tng dung lng h thng. Nhng cch ny
khng hiu qu i vi ti khng cn bng bin i
theo thi gian. Cch hiu qu nht gii quyt vn
ny l chuyn knh t t bo c ti nh(t bo lnh)
sang t bo c ti nng(t bo nng). Thng tin ti thu
c khng nhng cho php c lng ti lu lng
bin i theo thi gian m cn cung cp thng tin hu
ch ra quyt nh cp pht li knh cho h thng
mng.
Xut pht t hn ch ca cc thut ton truyn thng
cng nh s khng r rng, bt nh ca s cuc gi
yu cu, thi gian thc hin cuc gi v s cc thng
ip overhead gia BS v MSC, i hi cn phi c
mt c ch d bo ph hp hn, hiu qu hn. T
nhiu thut ton mn knh thng minh c
xut cn bng ti v khc phc c hn ch do s
dng gi tr ngng[23,24,25,26,27]. Trong cc thut
ton phi k n thut ton c xut bi Yao-
Tien Wang[23,26] xut thut ton mn knh s
dng b iu khin logic m v b iu khin mng
n ron- m thc hin mn knh ng v cn bng
ti mng di ng t bo. Nhng cc b iu khin ny
c hn ch l ph thuc nhiu vo tri thc chuyn gia,
tn hiu u ra khng mn, s lut m nhiu v
khng nh gi c tc ng ca phn iu kin ln
phn kt lun ca cc lut, cho nn hn ch chnh
xc tn hiu u ra v nh hng n qu trnh, thi
gian hun luyn mng n ron m s dng trong thut
ton.
khc phc hn ch , chng ti s xut mt
phng php iu khin mn knh thng minh trn
c s b iu khin logic m, vi tp m c xy
dng trn c s tp d liu hun luyn bng mng n
ron m s dng php o subsethood cho lin kt m
ti u tp lut, v t nng cao ch s QoS ca mng
di ng t bo.
Ni dung bi bo c chng ti phn b nh sau:
Phn hai s trnh by m hnh mng di ng t bo, v
trnh by thit k thut iu khin mn knh m
cn bng ng ti t bo vi mng n ron m s dng
subsethood. Phn ba trnh by m phng thut ton
mi v nh gi kt qu m phng . Cui cng trong
phn bn s trnh by mt s im kt lun ca bi
bo.
2. B iu khin mn knh cn bng ti
ng mng di ng t bo
2.1. M hnh mng di ng t bo
Mng gm mt tp cc t bo hnh lc gic[3,5]. Mi
t bo c cung cp mt trm c s BS t trung
tm. Hai t bo c th s dng cng knh nu khong
cch a l gia chng ti thiu l ln hn ngng
D
min
. Ngc li phin truyn thng s gy nhiu cho
cc knh khc v c gi l hin tng nhiu knh.
Mt tp t bo ln cn gy nhiu cho C
i
c nh
ngha bi IN
i
th IN
i
={C
j
|dist(C
i
,C
j
)<D
min
} vi R l
bn knh t bo, D
min
l khong cch s dng li knh
cc tiu. Gi s mng di ng phn hoch thnh mt
s tp t bo con phn bit, G
0
, G
1
, ..., G
k-1
. Tng t,
tp tt c cc knh cng c phn hoch thnh K tp
con phn bit: P
0
, P
1
, ..., P
k-1
. Cc knh trong P
i
(i=0,1,
...,k-1) l cc knh c bn ca cc t bo trong G
i
v l
knh th cp ca cc t bo trong G
j
(ji). Mt knh
yu cu mt knh th cp ch khi khng cn cc knh
c bn c php na.
2.2. Thit k b iu khin mn knh cn bng ti
ng.
B iu khin mn knh thng minh c xut
(hnh 2) gm 4 khi thnh phn: B iu khin logic
m, b xc lp ch th trng thi ti t bo, khi thc
hin qu trnh mn/cho mn knh v khi hc tham
s s dng mng n ron m vi php o subsethood
m.
2.2.1. Thit k b iu khin thng minh
Ht nhn ca b iu khin thng minh a ra quyt
nh trng thi ti t bo l b iu khin logic
m(FLC). B iu khin ny thc hin lp lun xp x
a ra quyt nh trng thi ti t bo, v s knh
mn/cho mn sau khi gii m trn c s tn hiu u
vo l s knh cho php v thng tin ti lu lng ca
t bo. B iu khin logic m gm 4 khi c bn:
Khi m ho, khi c s lut m, khi suy din m v
khi gii m. Trong tp lut m c pht sinh bi
b iu khin NFS.
- Khi m ho
Khi m ho thc hin chc nng m ho chuyn
gi tr o thnh gi tr ngn ng. Mc lin thuc
c biu din bi gi tr trong khong 0 v 1. Ni mt
cch khc, tp m biu din thng qua gi ca tp m.
Gi s tp m A l tp r rng ca tt c x thuc khng
gian U sao cho u
x
(x)>0:
{ } ( ) | ( ) 0
A
Supp A x U u x = e > .Cc php b, giao

H. 1. a) Nhm t bo N=7
b)M hnh phn hoch mng t bo
836
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011



v hp m cng c nh ngha theo nh ngha m
ca Zadeh[3]. p dng c s l thuyt m ny v s
dng cc k thut phn vng d liu vo kiu li hoc
FCM, chng ti thc hin nh x cc tn hiu r AC, TL
thnh cc tp m nh sau: Gi s tn hiu u vo l s
knh cho php(AC) v ti lu lng(TL). Tn hiu knh
cho php AC gi s thuc khong [c
min
, c
max
] v c
m ho thnh cc tp m vi gi tr bin ngn ng nh:
VeryCol(VC), Col(C), Moderate(M), Hot(H),
VeryHot(VH) (hnh 3). Vi
4
[ , ]
o
x c c e , hm thuc ca
cc tp m dng Gauss c xc nh nh sau:

2 2
( ) /
( )
j aj i ai
i
x c
A e
o

= (1)

Vi c
i
l tm ca hm lin thuc,
{ }
0 1 2 3 4
, , , ,
i
c c c c c c e ,
j
i
A l gi tr hm lin thuc
tp m i tng ng gi tr u vo x
aj
,
{ } , , , ,
i
A VC C M H VH e . vi x
1
l tn hiu u vo
AC. Tng t vi tn hiu TL thuc khong [b
min
, b
max
]
v c m ho thnh cc tp m Low(LL),
Mederate(ML), Heigh(HL)(hnh 3). Hm lin thuc m
ca cc tp m ny c xc nh nh sau:
2 2
( ) / 2
( )
j bj i bi
i
x b
B e
o

= (2)

Vi { }
0 1 2
, ,
i
b b b b e ,
j
i
B l gi tr hm lin thuc tp
m i tng ng gi tr u vo x
bj
,
{ } , ,
i
B LL LM LH e .
- Khi gii m
Khi gii m dng phng php trng tm cho php nh
x gi tr bin ngn ng u ra b iu khin m thnh
gi tr r rng. Gi s tn hiu u ra l s knh cho php
mn c xc nh trong khong [-d, d]. Nu qui c s
knh m t bo cho php cc t bo ln cn mn l
khong [-d,0] v s knh m t bo hin thi cn
mn t cc t bo ln cn l khong [0,+d] th khi
gii m s thc hin nh x gi tr m u ra vo khong

gi tr [-d,d]. Trong b iu khin ny chng ti nh
ngha cc tp m u ra thnh phn ln lt l cc gi
tr ngn ng nh bng 1. Vi cc gi tr bin ngn ng
u ra:z= { NVL, NL, NM, NS, AZ, PS, PM, PL, PVL}
s dng hm lin thuc l hm Gauss, quan h gia u
ra m v khong gi tr gii m [-d, d]. Gi tr u ra b
gii m cng m(NL) c ngha s knh ca t bo c
kh nng cho cc t bo khc mn cng nhiu. Ngc
li, gi tr gii m cng dng(PL), c ngha t bo cn
mn s knh cng nhiu. Cn gi tr bng 0(AZ) tng
ng khng thc hin mn knh vi cc t bo ln cn.
- C s lut m
C s lut m c c trng bi tp m IF-THEN thu
c m trong phn iu kin v phn kt lun l cc
bin ngn ng. Tp cc lut m ny n gin l th hin
quan h vo/ra ca h thng. Dng chung ca lut iu
khin m trong trng hp MISO gm 2 u vo mt
u ra c dng sau:
R
i
: IF x is A
i
AND y is Bi
THEN z is C
i
i=1,2,...,n (3)
Vi x, y, z l cc bin ngn ng biu din cc bin iu
khin, cn A
i
, B
i
, C
i
l cc gi tr ngn ng ca cc


H. 3. Hm lin thuc cc tp m
u vo AC v TL

H. 2. B iu khin mn knh cn bng ti ng
837
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
bin x, y, z tng ng. Tp lut m ny c th thu c
s dng mt trong 2 phng php:
S dng tri thc chuyn gia
Pht sinh tp lut da vo tp d liu hun
luyn
Trong b iu khin thng minh s dng, chng ti s
dng b iu khin mng n ron-m-
subsethood(NFS)[28,29,30] pht sinh tp lut IF-
THEN m. NFS s dng lin kt m vi php o
subsethood nh gi nh lng mc nh hng
ca phn iu kin ln phn kt lun ca tp lut m
cho php thu c tp lut c cht lng tt hn b
iu khin n ron -m bnh thng. B iu khin NFS
gm 5 lp(hnh 5):
Lp 1 l lp vo
(1)
i i
f x = ,
(1) (1)
i i
y f = ; lp 2 l lp
iu kin:
(2) (1) 2 2
( ) /
n n n
i i i
i i i
i
IL IL IL
f x c o = ,
( 2) (1) 2 2
( ) /
(2)
n i n n
i i i
IL IL IL
i i i
n
i
i
f x c
IL
x e e
o
= = , i=1,2,...N v n
i

thuc N
i
, mi nt l mt gi tr ngn ng ca bin vo;
lp 3 l lp lut:
(3) (2)
,
1
n n
i i
i i
N
k
IL k IL
i
f x e
=
=

,
(3) 2 2
( ) / (3)
k k k
f c
k
x e
o
= ; lp 4 l lp biu din phn kt
lun ca lut R
k
(c
k
,
k
):
(4) (3)
,
( , )
m m
k k
OL k OL
f x R c v = ,
(4) (4) (4)
, , , , ,
1 1
( ) / ( )
m m m m m
K K
c
k
OL k OL k OL k OL k OL k
k k
x f f
o o
v v v
= =
=

, mi nt l mt nhn ngn ng ca bin ra v n thc
hin gii m. Lp 5 l lp u ra:
(5) (4)
1
m
M
m
OL
m
f x
=
=

,
(5) (5)
x y f = = .
Cc nt lp 2, 3 u s dng hm thnh vin m dng
Gauss. im c bit ca mng n ron m ny so vi
cc mng n ron m khc l n s dng cc lin kt
m y gia lp lut v lp mnh kt lun. Cc
lin kt m ny th hin mc tc ng ca mi phn
iu kin trong mi lut n phn kt lun nh th no.
Mi lin kt m cng s dng hm thnh vin m dng
Gauss v xc nh mc ging nhau gia n vi tp
m ca lut R
k
tng ng bng cch s dng php o
subsethood m (
OL
m
,k
, R
k
) c nh ngha[4]:
,
,
, ,
( )
( , )
( ) ( ) ( )
m
m
m m
k
OL k
k
OL k
k k
OL k OL k
C R
R
C C R C R
v
c v
v v

=
+
(4)
vi
,
( , ) [0,1]
m
j
j
k
OL k
R c v e .
NFS s dng tn hiu u vo x
1
l AC c m ho
thnh cc tp m IL
1
= {VH, H,M,C,VC}, x
2
l TL c
m ho thnh cc tp m OL
2
={LL, ML, HL}. Vi d
liu hun luyn gm d liu {x, y
d
}, trong x=(AC,
TL)
T
, y
d
l tn hiu u ra mong mun.
m


l trng crisp
t gi tr ngn ng u ra OL
m
ti nt ca lp u ra.

2.2.3. Thut cp nht tham s cho cc lp NFS
Gi s NFS c hun luyn vi cp d liu vo/ra
{ }
( ), ( )
d
x y t t v gi y() l tn hiu u ra thc s
bc thi gian , hm mc tiu E ca mng c nh
ngha nh sau:

2
1
( )
2
d
E y y = (5)
Hm mc tiu E c NFS s dng hun luyn mng
theo thut truyn ngc BP, cc tham s mng NFS
c cp nht n gi tr ti u theo hm mc tiu s
dng thut gim gradient. Cng thc cp nht tham s
v trng lin kt ca cc lp ti bc thu c nh
sau:
Lp 5:
,
( 1) ( ) ( ( ) / ( ))
m
c
m m
OL k
E t t q t v t + = c c (6)
Lp 4:
, , ,
( 1) ( ) ( ( ) / ( ))
m m m
OL k OL k OL k
E
o o o
v t v t q t v t + = c c (7)
, , ,
( 1) ( ) ( ( ) / ( ))
m m m
c c c
OL k OL k OL k
E v t v t q t v t + = c c (8)
Lp 3:
( 1) ( ) ( ( ) / ( ))
k k k
c c E c t t q t t + = c c (9)
( 1) ( ) ( ( ) / ( ))
k k k
E o t o t q t o t + = c c (10)
Lp 2:
, , ,
( 1) ( ) ( ( ) / ( ))
n n n
i i i
i i i
k IL k IL k IL
E e t e t q t e t + = c c (11)
( 1) ( ) ( ( ) / ( ))
n n n
i i i
i i i
IL IL IL
c c E c t t q t t + = c c (12)

H. 5. Cu trc mng n ron m
s dng subsethood(NFS)

838
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
( 1) ( ) ( ( ) / ( ))
n n n
i i i
i i i
IL IL IL
E o t o t q t o t + = c c (13)
Vi 0<<1 l hng s hc.
Cc biu thc o hm trong cc cng thc (6) n (13)
c xc nh nh sau:
(4)
1
( )
m
M
l
OL
l m l m
E E y
d y x
y
=
c c c
= =
c c c

(14)
(4) (4)
,
(4) (4)
1
, , ,
m m
m m m m m
M
OL k OL
l l
C C C
l l l
OL k OL k OL k OL OL
x x
E E y E y
y x y x v v v
=
c c
c c c c c
= =
c c c c c c c

(15)
(4) (4)
(4) (4)
1
, , ,
. . . .
m m
m m m m m
M
OL OL
l l
l l l
OL k OL OL k OL OL k
x x
E E y E y
y x y x
o o o
v v v
=
c c
c c c c c
= =
c c c c c c c

(16)
(4) (4)
,
(4) (4)
1
,
. .
m m
m m
M
OL OL k
m k k
OL OL k
x f
E E y
C y x f C
=
c c
c c c
=
c c c c c

(17)
(4) (4)
,
(4) (4)
1
,
. .
m m
m m
M
OL OL k
m k k
OL OL k
x f
E E y
y x f o o
=
c c
c c c
=
c c c c c

(18)
(4) (4)
3 (3)
,
(4) (4) 3 (3)
1
, , ,
. . .
m m
n m m n
i i
i i
M
OL OL k
k k
m k k
OL OL k k IL k IL
x f
E E y x f
y x f x f e e
=
c c
c c c c c
=
c c c c c c c

(19)
(4)
1
.
n m
i
i
M
m
OL IL
y E E
y x o
=
c c c
=
c c c

.
(4) (2) (2) (4)
3 (3)
,
(4) 3 (3) (2) (2)
1 1
,
m n n m i i
i i
m n n n
i i i
i i i
K N
OL l IL IL OL
l k
l k
l l
OL l IL IL IL
f x f x
x f
f x f x f o
= =
c c c c
c c
c c c c c c

(20)
(4) (4)
3
,
(4) (4) 3 (3)
1 1
,
.
m m
n m m
i
i
M K
OL OL l
l
m l
l l
OL OL l IL
x f
x E E y
C y x f x f
= =
c c
c c c c
=
c c c c c c


(2) (2)
(3)
(2) (2)
1
n n
i i
i i
n n n
i i i
i i i
K
IL IL
k
k
IL IL IL
x f
f
x f C
=
c c
c
c c c

(21)
Sau khi thc hin hun luyn vi mu, lut m thu c
c dng:
R
j
: IF x
1
is
1
1
j
IL
A and ... x
i
is
j
i
IL
i
A and x
N
is
j
N
IL
N
A THEN y is y
k
with
j
c
- Khi suy din m.
Trong h thng suy din m, tri thc lin quan n bi
ton iu khin cho c pht biu di dng thut
ng ca mt tp lut suy din m. Qu trnh suy din
m s dng cc php ton t-norms hoc t-conorm.
Trong h thng suy din m ca NFS s dng lin kt
m vi php o subsethood thay v s dng cc php
ton t-norms. C th vi tp lut thu c phn c s
lut trnh by trn, c ch suy din NFS c th biu din
di dng c th nh sau:


Vi: ( )
k
y A biu din s gii m ca gi tr ngn ng
y
k
.
T chng ti xut thut hun luyn pht sinh tp
lut m nh sau:
step1: Khi to cc tham s hm lin thuc m u vo,
lut m R, hm lin thuc lin kt m v , hng s hc
, sai s cho php E
0
.
step 2: t d liu vo/ra hun luyn {x, y
d
} vo NFS
step 3: Thc lp lun m vi tn hiu u vo x bng
cch s dng phng trnh mng u vo, tn hiu u
ra cc lp 1->lp 4 v s dng cng thc (22) i vi
mi lut m v u ra ca lp lun m s c tnh
ton.
step 4: Thc hin cng thc (14), (6) iu chnh
m
.
step 5: Thc hin lp li lp lun m t bc 3
step 6: Thc hin iu chnh cc tham s hm thuc
lin kt m, lut R, hm thuc u vo theo cc cng
thc (15)-(21) v (7)-(13).
step 7: Hm mc tiu (5) c tnh ton, qu trnh lp
li t step 3 n step 6 cho n khi E()-E(-1) nh hn
gi tr ngng yu cu E
0
.
839
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
2.3. Khi thc hin qu trnh mn/cho mn knh
2.3.1. Xc nh trt t cc ln cn mn knh
Khi ny c nhim v nhn thng tin trng thi ti ca
hin thi, thc hin trao i thng tin vi cc ln
cn v ng knh thu thp knh cho php, v cp
nht vo ma trn cha thng tin v cc knh s dng.
Sau nhn s knh cho php tnh ton t b gii m
thc hin mn hoc cho mn knh, tu thuc vo
ch th ca khi ra quyt nh trng thi ti t bo v s
knh tnh ton c l dng hay m. xc nh t
bo mn knh, khi ny cng s dng b tm t bo
m da trn chnh lch ti vi cc t bo ln cn Tr, t
s tn hiu /nhiu SIR v cng tn hiu nhn c
ca ngi s dng c th RSS. Cc tn hiu ny cng
c m ho t xc nh t bo ln cn ph hp
nht mn knh. Qu trnh ny lp li trong trng
hp mn nhiu knh. Sau khi thc hin xong n cung
cp thng tin s knh cho php ti b iu khin logic
m v khi hc tham s thc hin iu chnh tham s
hm lin thuc m v tp m.
2.3.2. Thc hin cn bng ti
Vic thc hin cn bng ti l cn thit phn b li
ti nguyn cp pht cho cc t bo trong mng di ng
nhm nng cao QoS ca ton mng khi ti lu lng
ca mng bin i theo thi gian. V d nh mng di
ng trong mt ngy m c th phn b ti lu lng
theo thi gian l khc nhau nh: ban ngy ti lu lng
c th cao im nhng ban m c th thp hn. V
trong cng mt thi im, ti lu lng trong cc t
bo cng khc nhau nh trong thnh ph c th cao hn
nng thng Vn cn phi nh gi v thc hin
phn b li ti m bo cht lng dch v ca mng
l cao nht. Vi b iu khin thng minh xut,
vic nh gi trng thi ti ca t bo v tnh s knh
cho php mn/cn mn l thng s quan trng ra
quyt nh phn b li ti t bo bng cch di chuyn s
knh gia cc t bo lnh sang cc t bo nng khi
gia cc t bo ny c s chnh lch v ti lu lng,
thm ch l chnh lch rt ln. T b iu khin m
xut, s dng phng php gii m trng tm v cng
thc (22) chng ta xc nh c s knh cn mn/cho
mn gia hai t bo l:
Y=Y*- IN(c) (23)
S knh di chuyn cn bng ti gii hn theo biu thc
sau[23,26]:
S knh =
min[Borrowing cell(Y), Lending cell(Y)] (24)
Sau khi cc knh di chuyn dng cp pht li, b
iu khin NFS s thc hin iu chnh li tp lut.
2.4. Thut ton mn v cn bng ti ng


3. M t mng di ng m phng
Mng di ng t bo c s dng trong m phng gm
190 t bo hnh dng lc gic c bn knh l n v.
Cc t bo ny s c xc nh bi 190 BS. V tr cc
trm c s c xc nh bi to (x,y). Cc thng tin
mng c ct trong ma trn baseinfo kch c 190x2. V
d baseinfo(5,1) v baseinfo(5,2) tng ng vi to
(x,y) ca trm c s t bo th 5. M phng thc
hin:1)Tnh ton cc BS; 2)Xc nh cc t bo ln cn
cho mi t bo; 3) Khi to gn knh cho cc t
bo;4)Khi to b iu khin thng minh cho cc t bo
v xc lp trng thi ban u
Trong m phng chng ti tp trung vo cc php
o:1)o xc sut kho cuc gi;2)o xc sut bt buc
kt thc cuc gi;3)Xc nh s knh ri ca cc t bo.
Xc sut kho cuc gi v xc sut kt thc cuc gi bt
buc s c nh ngha nh sau:
bl
blocknum
P
callnum
= (2.1)

fc
forcenum
P
callnum blocknum
=

(2.2)
vi callnum, blocknum, forcenum l tng s cuc gi, s
cuc gi b kho v s cuc gi bt buc kt thc tng
ng. Cu trc chng trnh m phng c thc hin
trong khong thi gian timeend vi bc thi gian l
timestep. Thng tin thc hin trong mi vng lp c
ct trong ma trn userinfo gm cc thng tin sau:1)To
(x,y) ca ngi s dng;2)Suy gim ng truyn
ca ngi s dng c kt ni;3)Thng tin kt ni hay


H. 6. Thut ton iu khin mn/kho knh cn bng ti
840
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
khng kt ni: 1->c kt ni, 0-> l khng kt
ni;4)Thi gian kt thc cuc gi;5)S knh kt ni
c cp pht
Kt qu m phng vi mi trng Matlab:
M phng c thc hin vi nhm compact N=19, s
knh cp pht cho mi l C=100 knh tn s, bn knh
ca l 1, ti lu lng t 100 n 2000 cuc gi/ gi..
Hai tham s shift nhn gi tr 3 v 2, rng vng bng
r trong mi t bo nhm xc nh thu bao ri l 0,8.
Khong thi gian xc nh thu bao ri l 10. Cuc
gi n mi theo hm phn phi Poisson vi gi tr
trung bnh
i
i vi t bo th i. Thi gian ch cuc
gi gi s l phn phi m vi 1/ ca 500 giy. Trm
BTS ca mi s nhn bit nhng no l ln cn,
no l cng nhm compact vi n hoc nhng no l
ng knh gn nht. Kt qu thu c vi thng s
knh ri th hin nh bng 1, hnh 6,7 v c so snh
vi phng php LBSB v thut ton gn knh thch
nghi ca Yongbing Zhang.


4. Kt lun
Bi bo xut phng php iu khin mn knh
mi cn bng ti trn c s mng n ron m vi
php o subsethood cho mng di ng t bo. Kt qu
m phng thut ton mi cho thy thut ton mi
khc phc c hn ch ca cc thut ton truyn thng
l vic s dng ngng trng thi ti t bo. Thut ton
mi cng th hin s knh ri nhiu hn, kh nng
mn knh cn bng ti s tt hn, xc xut kho
cuc gi v dt cuc gi thp hn so vi phng php
s dng ngng phn tch trng thi ti t bo.ng
thi thut ton mi cng th hin kh nng hc,
chnh xc tt hn, mm do hn v ti u hn so vi
cc thut ton mn/kho knh n ron, m
khc[23,24,25,26].

Ti liu tham kho
[1] Thai Quang Vinh, Ha Manh Dao, Ho Si Bang,
Decentralized stabilization of complex systems by
combination of conventional and fuzzy controls,
International Journal of Uncertaity, Fuzziness and
Knowledge-Base System. Vol 7, No. 4, 423-427,1999
[2] Cornelia-Ionela Badoi , Neeli Prasad ,Victor
Croitoru , Ramjee Prasad, 5G Based on Cognitive
Radio, Published online: 8 July 2010, Springer
Science+Business Media, LLC., 2010
[3] Zadeh, L. A., Fuzzy Algorithm Information and
Control, p.94-102, 1968.
[4] B. Kosko, Fuzzy entropy and conditioning,
Information Sciences, Vol. 40, No. 20, 1990.
[5] V. H. Mac Donald, Advanced Mobile Phone
Service: The Cellular Concept, The Bell System
Technical Journal, volume 58, number 1 (1979), pages
15-41, 1999
[6] H Mnh o at al., Mt s ci tin i vi phng
php cp pht knh tn s mng di ng t bo, Cc
cng trnh nghin cu, pht trin v ng dng Cng
ngh thng tin v Truyn thng, Tp ch Thng tin,
Khoa hc Cng ngh ca B Thng tin v Truyn
thng, Tp V-1, s 1(21), 2009
[7] H Mnh o et al, Ci tin cc thut ton mn v
kho knh tn s mng di ng t bo, Tp ch khoa hc
v Cng ngh, i hc Nng, ISSN 1859-1531,
6(29), 2008
[8] Ha Manh Dao et. al, Improved Frequency Chnnel
Borrowing and Locking Algorithm in Cellular Mobile
Systems, The 11
th
International Conference on
Advanced Communication Technology,IEEE,
Proceedings, Volume I, 2009.
[9]Ozan K. Tonguz, Member, IEEE, and Evs en
Yanmaz, Member, IEEE, The Mathematical Theory of

H. 6. S knh ri ca cc t bo sau mi ln chy

H. 7. S knh c kh nng mn sau mi ln chy vi
cc thut ton khc nhau

Bng 1. Kh nng mn knh ca cc t bo

841
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011
Dynamic Load Balancing in Cellular Networks, IEEE
Transactions on mobile computing, Vol. 7,No. 12.
december 2008.
[10] I.Katzela and M.Naghshineh, Channel Asignment
Schemes for Cellular Mobile Telecommunication
Systems: A Comprehensive Survey, IEEE Personal
Communications Magazine, vol 3, No 2, pages 10-
31,1996.
[11] Sajal K.Das, Sanjoy K.Sen, Rajeev Jayaram, A
Dynamic Load Balancing Strategy for Channel
Assignment Using Selective Borrowing in Cellular
Mobile Environment, Wireless Networks, volume 3,
page 333-347, 1997
[12] Yongbing ZHANG, A New Adaptive Channel
Assignment Algorithm in Cellular Mobile Systems, Proc
32 nd Hawaii International Conference on System
Science 1999.
[13]. H. Jiang and S.S. Rappaport, CBWL: A new
channel assignment and sharing method for cellular
communication systems, IEEE Transactions on
Vehicular Technology, volume 43, number 2, papes
313-322, 1994
[[14] Zhang, Y., A new adaptive channel assignment
algorithm in cellular mobile systems, IEEE Systems
Sciences Conference, p.1-7, 1999.
[15] Karlsson, J. and Eklundh, B., A cellular mobile
telephone system with load sharing-an enhancement of
directed retry, IEEE Communications, pp.530-535,
1989.
[16] Mitra, S. and DasBit, S., A load balancing strategy
using dynamic channel assignment and channel
borrowing in cellular mobile environment, IEEE
Personal Wireless Communications, pp.278-282, 2000.
[17] 3rd Generation Partnership Project. Technical
Specication Group. Radio Access Network, Radio
Interface Protocol Architecture, TS25.301 v4.2.0. 202.
[18] Das, S. K., Sen, S. K. and Jayaram, R., A
structured channel borrowing scheme for dynamic load
balancing in cellular networks, IEEE Distributed
Computing Systems, pp.116-123, 1997.
[19] Kim, J., Lee, T. and Hwang, C. S., A dynamic
channel assignment scheme with two thresholds for load
balancing in cellular networks, IEEE Radio and
Wireless Conference, pp.141-145, 1999.
[20] T. Lee J. Kim and C. S. Hwang, A dynamic
channel assignment scheme with two thresholds for load
balancing in cellular networks, IEEE Radio and
Wireless Conference, pages 141-145, 1999.
[21] Kim, S. and Varshney, P. K., Adaptive Load
Balabcing with Preemption for Multimedia Cellular
Network, IEEE Wireless Communications and
Networking Conference, pp.1680-1684, 2003.
[22] Sen, S. K., Das, S. K. and Jayaram, R., A
structured channel borrowing scheme for dynamic load
balancing in cellular networks, IEEE Distributed
Computing Systems, p.116-123, 1997.
[23] Wang, Yao-Tien, A fuzzy-based dynamic channel
borrowing scheme for wireless cellular networks, IEEE
Vehicular Technology Conference, p.1517-1521, 2003.
[24] C.Y. Ngo and V.O.K. Li, Fixed Channel
Assignment in Cellular Radio Networks using A
Modified Genetic Algorithm, IEEE Transactions on
Vehicular Technology, vol. 47, no. 1, pp. 163-72,1998
[25] 1801 K.A. Smith, Genetic Algorithm for The
Channel Assignment Problem, in Global
Telecommunications Conference, GLOBECOM 1998,
vol. 4. pp. 2013-2018..,1998
[26] Yao-Tien Wang, Kuo-Ming Hung, A Genetic-
Fuzzy Controller for Load Balancing in Wireless
Cellular, Information and Management Sciences
Volume 18, Number 4, pp. 467-494, 2007.
[27] Nguyn Xun Qunh, Thi Quang Vinh, H Mnh
o, Mt phng php iu khin mn knh tn s
thng minh trong mng di ng t bo trn c s h
m-n ron, Tp ch Khoa hc&Cng ngh, Trng i
hc Cng nghip H Ni, ISSN 1859-3585, s 02, 2010.
[28] Song Hengjie, Miao Chunyan, Shen Zhiqi,Miao
Yuan, Bu-Sung Lee, A fuzzy neural network with fuzzy
impact grades, Neurocomputing 72, 30983122, 2009.
[29] Amit Mishra, Zaheeruddin, Design of Fuzzy Neural
Network for Function Approximation and
Classification, IAENG International Journal of
Computer Science, 37:4, IJCS_37_4_02, 2010.
[30] Zsolt Csaba Johanyak, Fuzzy Rule Interpolation
based on Subsethood Values, 978-1-4244-6588-0/101
2010 IEEE.



842
Hi ngh ton quc v iu khin v T ng ho - VCCA-2011

VCCA-2011


PGS.TS Thi Quang Vinh
Chc danh hc v: Ph gio s, Tin s, Nghin cu
vin chnh.
Ni lm vic: Phng Cng ngh T ng ha, Vin
Cng ngh thng tin, Vin KHCN VN, 18 Hong
Quc Vit, Cu Giy, H Ni
o to:
1977 - Tt nghip k s ngnh iu khin t ng,
i hc Bch khoa -t-xa, Ucraina
1991 Tt nghip Tin s ngnh iu khin t ng
ti Trng i hc Nng lng Mt-xc-va, CHLB
Nga.
Cc lnh vc nghin cu chnh:
ng dng cc cng ngh cao trong o lng v iu
khin.
H thng nhng, X l tn hiu s.
iu khin cc h thng phc hp , iu khin m v
mng N ron.
Mt s kt qu chnh:
Complex Systems by Combination of Conventional
and Fuzzy Controls, International Journal of
Uncertainty, Fuzziness and Knowledge-Based
Systems, Vol 7, No.4, 1999, pp. 423-428.
Decentralized Robust Fuzzy Sliding Mode Control
Design of Interconnected Uncertain System.
International Journal of Advanced Computational
Intelligence, 6(2002), No1,56-61.
A Novel Fast Noise Robust Vietnamese Speech
Recognition Applied for Robot Control. Proceedings
of the 10th International Conference on Control,
Automation, Robotics and Vision,
ICARCV2008,2008 ISBN:978-1-4244-2287-6,IEEE
Catalog N
o
:CFP08532-CDR.

Ths. NCVC H Mnh o
Ni cng tc: Vin cng ngh thng tin(VAST)
o to:Tt nghip i hc s phm Vit bc, 1990;
o to tin hc i hc S phm I H Ni, 1994;
Thc s:1986, P. T ng ha Vin Vt l, Vin
Khoa hc v Cng ngh Vit Nam; NCS Vin Nghin
cu in t , Tin hc, T ng ha
Lnh vc nghin cu:Vi x l, vi iu khin, nhng,
PLC; Tr tu nhn to (Mng n ron, logic m, GA,
EA); o v iu khin thng minh; X l tn hiu, tn
hiu m; Wireless Network v ng dng trong o,
iu khin; Cng ngh ASIC, FPGA.
Lnh vc khc: Ging dy i hc; Trin khai thc
t.










843