SLIDE 1
Resource Management Approach in Heterogeneous Wireless Access etworks Based on IEEE1900.4 Architecture
Min Sheng
The State Key Lab. of IS & Information Science Institute, Xidian University
msheng@mail.xidian.edu.cn
- !"##
Resource Management Approach in Heterogeneous Wireless Access - - PowerPoint PPT Presentation
Resource Management Approach in Heterogeneous Wireless Access - - PowerPoint PPT Presentation
Resource Management Approach in Heterogeneous Wireless Access etworks Based on IEEE1900.4 Architecture Min Sheng The State Key Lab. of IS & Information Science Institute, Xidian University msheng@mail.xidian.edu.cn
SLIDE 2
SLIDE 3
- Diverse coexisting Radio Access Technologies (RATs) with cognitive
ability are the most important features of future wireless systems, which form heterogeneous cognitive wireless networks.
， !"#$%&'&(% &))&*+,- .
A cognitive network is a network with a cognitive process that can perceive current network conditions, and then plan, decide and act on those
- conditions. The network can learn
from these adaptations and use them to make future decisions, all while taking into account end3to3end goals. OBSERVE
Monitoring Discovery
PLA
Optimization
ACT
Reconfiguration Profiles Policies Context Dicision
GOALS
Feedback3ew Knowledge
SLIDE 4
- &''("#)*++,-
./ 01.2#3'$))4* 567'##7787
1### )) )9!6
- !6)
")9
)! "6) #)* ""#)
SLIDE 5
- In the European projects End3to3End Reconfigurability (E2R II) and End3to3End Efficiency (E3,
and in Japanese projects on SDR and CR systems, the study of JRRM which deals with the radio resource allocation among RATs have been studied.
- In paper “A fuzzy3neural based Approach for Joint Radio Resource Management in a beyond
3G framework ”, a fuzzy3neural based approach for JRRM in the B3G framework is introduced.
- In paper “etwork Selection in an Integrated Wireless LA and UMTS Environment Using
Mathematical Modeling and Computing Techniques ” a scheme is brought forward to solve the JRRM problem in cellular networks.
- In paper “Adaptive Threshold Joint Load Control in an End3to3end Reconfigurable System ”,
the authors present an adaptive threshold joint load control mechanism.
- A noncooperative game3theoretic framework for Radio Resource Management in 4G
heterogeneous wireless access networks is present in “A oncooperative Game3Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access etworks “, while cognitive ability is not considered. /
SLIDE 6
+4)##
- Heterogeneous Wireless etwork scenario
SLIDE 7
+4)##
- Inter3etwork:
Maximum resource utility assignment policy Intra3etwork: Dynamic resource reservation policy
SLIDE 8
+4)##
- Inter3network
resource allocation RA Resource Reservation Access etwork Selection RRM
SLIDE 9
8 +
Objective of inter3network resource allocation
Allocate bandwidth dynamically compatible with the network environment to a particular service area from each of the available networks in that service areas so that all of the service providers are satisfied.
When the network environment changes, such as the traffic intensity and the distribution of users, the system resources are reallocated
SLIDE 10
8 +
- The neural network model
eural etwork Original Data Forecasting Data
ˆ i x
Input Layer (k)
- Training Process
=Forward Propagation +Back Propagation Concealed Layer
- (p)
Output Layer (1)
i k
x −
- i
x −
- (
) i k
x −
−
- History Data: m
(i<=m) Forward Propagation Back Propagation
i
- i
T
SLIDE 11
8 +
- The neural network model
eural etwork Original Data Forecasting Data
m
x
7 ( ) m k
x
− −
- ˆ m
x
+
- (
) m k
x
− −
Input Layer Concealed Layer Output Layer
- Prediction
Process (k) (p) (1)
SLIDE 12
8 +
- B. Maximum etwork Resource Utility
- #' 6""
#
- .6" i " "b
x)w #"6"
: ; '
: ;
con i x
U w b α =
- B l
7
m
Bm
7B l
- Bc
7
Bc
<m
- m
m
7
c
- c
: ; ' con i x
U
α
1! Bm' Bc1'Bc2'Bl1'Bl2'#!6>mi )" ""6.4/i' c2 c3 ""6 7<'c4 c5 ""6 =' Bl1 Bl2 )" !").>/ <=
=
- i
m i
m B
=
=
∑
7 <
- c
c c B + =
- =
7 c
c c B + =
SLIDE 13
8 +
The total utility of the entire network can be obtained from
( ) ( ) ( ) ( )
7 7 < <
- 7
<
- 7
<
- =
= 7
- =
- =
- :
' ;
- l
tol i i l
m c m c B m
- U
m c w m c m c B
- α
α α α α + + + + + = + + + + + 012
To maximize total utility, an optimization problem is formulated as follows:
49)* $
: ' ;
tol i i
U m c
&0
= 7 <
- =
7
- '
'
i m cl c i
m B c c B c c B
=
= + = + =
∑
- 7
7 7 <
- =
7 7
- 7
< 7 <
- =
<
- 7
- 7
<
- =
- =
- =
7 <
- =
= 7
- 7
< 7 7 7 7 <
- 7
- total
m total m c l total m total m c l total c l
U
- m
B m m m m m c U
- m
B m m m m m B c B U
- m
B m m m m m c U
- m
B m m m m m B c B U
- c
m c m B c B ∂ = ⇒ = ∂ − − − − + ∂ = ⇒ = ∂ − − − − + − + ∂ = ⇒ = ∂ − − − − + ∂ = ⇒ = ∂ − − − − + − + ∂ = ⇒ = ∂ + + − +
=
- =
7
- 7
- total
c l
U
- c
m c m B c B ∂ = ⇒ = ∂ + + − +
SLIDE 14
+/++!
#6"""'! )')' ')"" )#)""""
- +/*
- "
- )")+/
#)6#" 6#"!##+/ 6#"!66!) !#" "" )'
SLIDE 15
+/++!
.) !#!""!) #))" ?""""''# !")!""6) "# 6#"' !6 ))#
: ; : ; R R t R t t t t
- βδ
- =
− − = +
- 1?6
""+/ # ) ! ) )!
- #)
))! :';
t
- t
δ
SLIDE 16
+/++!
>t )') 6)!' #!6'")#!"#! k )!0
R
- δ
τ
δ τ
[ ] [ ] [ ]
' ' ' 7 ' : ; ' t t t t t k t k τ τ τ τ τ − − − − − −
- >)#!"' )#!"
- ( )
r t
( )
R t R
- (
)
'
- t
i t i τ τ − − +
( ) ( )
r t i r t i τ τ τ − − − −
- 7
- : :
; : ;; : ; : ; ' 7= : : ; : ; ;
- k
i k i
r t i r t i r t r t k k k k r t i r t i u k τ τ τ τ
- τ
τ τ τ τ τ δ τ
− ∧ = − ∧ ∧ =
− − − − − − = = ≥ − − − − − =
∑ ∑
SLIDE 17
+/++!
CDP（ （ （ （handoff call dropping probability） ） ） ）
- :
;
- b
R L CDP
- ≤
= −
- :
;
- R
u t L u t
- b
CDP t t δ δ − − ≤ = −
- 7
+ @ /: ' ; t t
- δ
- @
:'; R u t
- t
δ −
- ( )
L t L L = +
Exp： ： ： ：$AB7C' $AB<C
7< L t t δ
- =
+ = L t t δ
- =
+
SLIDE 18
/
!""" '
- .!' +/
)9)) !"+/D "?)' &66)
SLIDE 19
!"##
1
- 3
4 5
- 5
1 15
- 5
3 35 4
!"% 666''*6 %7 λ =148 λ =148 λ =98 λ =98 λ =48 λ =48
1
- 3
4 5
- 4
- 9
1 1 14 1 19
- 4
- :&++66''*6
%7 λ B'$++4 λ B'++4 λ B7E'$++4 λ B7E'++4 λ B7'$++4 λ B7'++4
SLIDE 20
!"##
5
- ;
9 < 1 11 1 13 14 15 5 ; 9 < 1111131415 5
- ;
9 < 1
- 5
1 15
- 3
4 5
- 5
1 15
- 5
3 35 4 =1
4
+6v.s ! 16)
SLIDE 21
$
- 6)6
#)#" ""!!""" ""' # )) ## ' !6)6)68 "+/'#")"6)
SLIDE 22
- 谢