Академический Документы
Профессиональный Документы
Культура Документы
I.
INTR ODUCTION
341
&
Technology, Bangladesh
A.
D
<1.1
B.
Available femlocell
Available macrocell
'"
J;
t ...
5:::
"
.
5
.
ro
ro
ro
ro
ro
ro ... ro ro
ro
ro
5
5 5 5 :5 :5 :5 :5 5 5
13
...
...
...
...
...
...
.1;
c:J
c::J
Figure 2. Allocated (a) resource status and (b) resource actual utilization
status in a channel for existing advanced heterogeneous wireless network.
'
342
..=
ro
..sJ
ro
.:2
ro
.s
ro
.$)
ro
"
"
UG" UG,2
llO(),kA'c llO(),kA'c
"
"
"
UG,4
lO(),kA'c
.$
ro
..!O
ro
..!o
ro
:5
:5
"
"
"
.
:::
-:-:-:
:llGJ1 :8G;2
f{,i;,\u :r-t1i_'';-,r
G.i
ltG,; :uq :G;6 \ji IWi.;
. B':
1"kir . tT,,:!i' l1_i"n :Ffl,l''J; f-r:cJ
\J.i,::Vd
:!..:J uri;
Time slot number, Nts
Oedicated resource utilization by dedicated user of channel number k
D
o Opportunistic resouce available for cognitive user of channel number k
Figure 6. Allocated resource rescheduled status in a channel for poposed
IRR scheme in existing advanced heterogeneous wireless network.
Figure 3. Scenario of capacity problem in existing advanced heterogeneous
wireless network.
them to new users (FAPs with light blue colored coverage area
as shown in Fig. 7). As in the network, rate of association of
new users increases in a particular area causes congestion
problem so, as reverse process (rate of existing user leaving
the network) reduces this problem. But there is a predefined
minimum resource allotment is required to allow a new user in
a network which put limits to minimization of congestion.
Therefore, proposed IRR scheme outperforms over existing
scheme in mllllmlzlllg congestion in the advanced
heterogeneous wireless network. In proposed IRR scheme,
when capacity increases for a certain user groups (causing
congestion for existing system), causes less congestion as
shown in Fig. 7 problem by opportunity creation by the system
itself in an intelligent way.
III.
SYSTEM MODELING
343
A.
where
H01 k
,
H10 k
,
(n Full Empty n)
C.
1, 2, ... ,K .
CL,k
"'C
D k ZU_j,k
(3)
k=l
1, 2, ... ,K .
B.
H11 k
(n Full Occupied n) No Opportunity (NO)
,
where 0 (channel utilization absent) and 1 (channel utilization
present), respectively gives user channel utilization states over
channel k and k 1, 2, ... ,K .
=
_i.k
(n Partial Occupied n)
(n Partial Emptyn)
,j
z1I
Co LJ. - L.J
"'C" U{l.l
-"'c,, """
;\, ([-Z11-1 A )
11\-.LlnnJ. XI-ZU-1 Ie ) 4k L.J
k=l
(4)
k=l
(1)
(6)
and
(where
channel k and k
user u
1, 2, ... ,K .
D.
)
10k (Hoo,
k
'
Z11 -j k _
iJ",,, (HaLk )
)
/'k (HlOR
rjk
and
(2)
344
j ,j
rate
=
of
fixed
cost
for
contribution
of
1, 2, ... ,K .
e)
Step
avalable
hypothesis
5:
(rOk)
HOOk
as
all
users
shown
then
m
system
Fig.
2(a)
selects
for
1, 2, ... ,K .
channel k and k
IV.
NUMERICAL RESULT
A.
1)
Sl.
No.
Full opportunity",
Hoo.k
No opportunity" ,
HOJ.k
HlO.k
ll.k
11
_If
jap
Jape
-
jill
- Jllle
Lower
limit
Upper
limit
0.76
1.00
0.51
0.75
0.26
0.50
0.00
0.25
100
20
1000
400
10
Number of channel, k
10
11
12
0.00
0.95
Zu _
.
Ik
345
C.
t5
20
'hi
. =
= 1=
1D ,.,=
1==
_______
80
;;l
'5
'"
(UGc
60
40
20
CONCLUSIONS
10
Time slot number of resource utilization for channel number k, Nts [Nos]
REFER ENCES
[I]
[2]
[3]
[4]
[5]
[6]
10
[7]
[8]
346