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
Outline
Introduction and Background
IEEE1900.4 standard
A Solution
Prediction the resource in both Inter and Intra
network
Evaluation of proposed solution
Conclusions
Future works
Introduction and Background
Diverse coexisting Radio Access Technologies (RATs) with cognitive
ability are the most important features of future wireless systems,
which form heterogeneous cognitive wireless networks.
Ryan W. ThomasIEEE Communications Magazine December 2006 Cognitive
Networks: Adaptation and Learning to Achieve End-to-End Performance Objectives
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
fromthese adaptations and use them
to make future decisions, all while
taking into account end-to-end goals.
OBSERVE
Monitoring
Discovery
PLA
Optimization
ACT
Reconfiguration
Profiles
Policies
Context
Dicision
GOALS
Feedback-ew Knowledge
Introduction and Background
Soodesh Buljore, etc, Architecture and Enablers for Optimized Radio Resource Usage in Heterogeneous
Wireless Access Networks: The IEEE 1900.4 Working Group, IEEE Communications Magazine
January 2009,pp122-129
The corresponding approaches based
on 1900.4 resource management
elements are not extensively studied.
IEEE1900.4 standard
the overall system architecture
information exchange between the
network and mobile devices in the
heterogeneous wireless networks
facilitates the distributed dynamic
optimization of the usage of spectrum
Introduction and Background
Other related works
In the European projects End-to-End Reconfigurability (E2R II) and End-to-End 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 fuzzy-neural based Approach for Joint Radio Resource Management in a beyond
3G framework , a fuzzy-neural 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 End-to-end Reconfigurable System ,
the authors present an adaptive threshold joint load control mechanism.
A noncooperative game-theoretic framework for Radio Resource Management in 4G
heterogeneous wireless access networks is present in A oncooperative Game-Theoretic
Framework for Radio Resource Management in 4G Heterogeneous Wireless Access etworks ,
while cognitive ability is not considered.

Resource Management Approach under
IEEE1900.4 Architecture
Heterogeneous Wireless etwork scenario
Resource Management Approach under
IEEE1900.4 Architecture
Inter-etwork:
Maximum resource
utility assignment policy
Intra-etwork:
Dynamic resource
reservation policy
Resource Management Approach under
IEEE1900.4 Architecture
Inter-network
resource allocation
RA Resource
Reservation
Access etwork
Selection
RRM
Inter-network Resource Allocation
Objective of inter-network 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
Inter-network Resource Allocation
A. Traffic Flow Prediction Model
The neural network model
eural etwork
Original
Data
Forecasting
Data

i
x
Input
Layer
(k)
M
Training Process
=Forward Propagation
+Back Propagation
Concealed
Layer
M
(p)
Output
Layer
(1)
i k
x

1 i
x

1 ( ) i k
x

M
History Data: m
(i<=m)
Forward
Propagation
Back
Propagation
i

i
T
Inter-network Resource Allocation
A. Traffic Flow Prediction Model
The neural network model
eural etwork
Original
Data
Forecasting
Data
m
x
2 ( ) m k
x

1

m
x
+
1 ( ) m k
x

Input
Layer
Concealed
Layer
Output
Layer
M
M M
Prediction
Process
(k) (p) (1)
Inter-network Resource Allocation
B. Maximum etwork Resource Utility
In each resource allocation process, we use a utility function of
throughput
Where is the utility of network i for an allocated bandwidth of b
to connection x. Parameters w and are constants indicating the
scale and the shape of the utility function.
( )
,
log( )
con
i x
U w b =
1
B
l
2
m
B
m
2
B
l
1
B
c
2
B
c
3
m
4
m
5
m
2
c
4
c
( )
,
con
i x
U

The total available bandwidth in these networks are B

m
,
B
c1
, B
c2
, B
l1
, and B
l2
, respectively. Let m
i
denote the
amount of bandwidth offered by WMAN to area i, let
c
2
and c
3
denote bandwidth offered by cellular network
to area 2 and area 3, and let c
4
and c
5
denote bandwidth
offered by cellular network to area 4 and area 5, and
let B
l1
and B
l2
denote the amount of bandwidth
available from WLANs in area 3 and area 5.
5
1
i m
i
m B
=
=

2 3 1 c
c c B + =
4 5 2 c
c c B + =
Inter-network Resource Allocation
The total utility of the entire network can be obtained from
( ) ( )
( ) ( )
2 2 3 3 1
1
1 2 3
1 2 3
4 4 5 5 2
4 5
4 5
log log log
( , )
log log
l
tol i i
l
m c m c B
m


U m c w
m c m c B

+ + + | |

+ +
|



\

=

+ + +
+ +




(1)
To maximize total utility, an optimization problem is
formulated as follows:
Maximize :
( , )
tol i i
U m c
Subject to :
5
2 3 4 5 2
1
, ,
i m cl c
i
m B c c B c c B
=
= + = + =

1 2
2 2 3 4 5 2 2
1 2
3 2 3 4 5 3 1 2 1
1 4
4 2 3 4 5 4 4
5 1
5 2 3 4 5 5 2 4 2
3 2
2 2 2 3 1 2 1
0
0
0
0
0
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

= =
+

= =
+ +

= =
+

= =
+ +

= =
+ + +
5 4
4 4 4 5 2 4 2
0
total
c l
U
c m c m B c B

= =

+ + +

RAN Resource Reservation

In order to guarantee the priority of handoff calls, reservation
resource methods, such as guard channel scheme, are used .
In a heterogeneous wireless network, a large number of factors
can impact the resource demands of future handoff calls.
RAN sizes
network configuration
number of mobile stations in each RAN
speed and mobility pattern of users
types of services supported in each RAN
types of services used by each user at any given time
arrival processes of new and handoff calls
call and channel holding times, etc.
RAN Resource Reservation
Wiener models have been proven effective in modeling stochastic
processes that are similar in nature to the amount of resources
required for future handoff calls, i.e., stochastic processes where
the values of the random variables are affected by a large number
of independent or weakly dependent factors, each with a relatively
small impact.
( ) ( ) R R t R t t t t u = = +
The resources required by
handoff calls in a RAN which is
a stochastic process
Prediction time
interval
standard normal
random variable
constant
parameters
A normal random variable with ( , ). t u
t
RAN Resource Reservation
Let t be the current time, then and can be estimated
by setting and to the mean and standard deviation,
respectively, of the sample values of in the previous k
time intervals:
R
u

u

| | | | | |
, , , 2 , ( 1) , t t t t t k t k L
Let be the sample value of , the sample value of in
will be
( )
r t ( )
R t
R
( )
, 1 t i t i +

( ) ( )
r t i r t i
1
0
1
2
0
( ( ) ( ))
( ) ( )
, 25
( ( ) ( ) )
1
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

= =

RAN Resource Reservation

CDP handoff call dropping probability
Pr ( ) 1 ob R L CDP =
Pr ( ) 1
R u t L u t
ob CDP
t t

=

2
R ~ N( , ) t t u
~ (0,1)
R u t

( )
L t L L = +
Exp CDP=2%,
CDP=3%
2.3 L t t u = +
0.5 L t t u = +
Access Network Selection
Based on the current available resource for handoff
connections or new connections, access network selection will
be done.
When a connection arrivals, it will select a RAN which has the
maximum residual resource according to current network
resource allocation and reservation. If no RANs residual
resources are satisfied its requirement, this connection is
rejected by the system.
Evaluation of proposed solution
1 2 3 4 5
0.00
0.05
0.10
0.15
0.20
0.25
0.30
0.35
0.40
N
e
w

A
r
r
i
v
a
l

C
a
l
l

D
r
o
p
p
o
i
n
g

P
r
o
b
a
b
i
l
i
t
y
Areas in System
= 14, CRRM
= 14, RRM
= 28, CRRM
= 28, RRM
= 42, CRRM
= 42, RRM
1 2 3 4 5
0.000
0.002
0.004
0.006
0.008
0.010
0.012
0.014
0.016
0.018
0.020
0.022
0.024
0.026
H
a
n
d
o
f
f

C
a
l
l

D
r
o
p
p
i
n
g

P
r
o
b
a
b
i
l
i
t
y
Area in System
= 14, CRRM
= 14, RRM
= 28, CRRM
= 28, RRM
= 42, CRRM
= 42, RRM
Evaluation of proposed solution
5
6
7
8
9
10
11
12
13
14
15
5
6
7
8
9
10
11
12
13
14
15
0.5
0.6
0.7
0.8
0.9
1
0
5
10
15
20
30
40
50
60
0
0.5
1
1.5
2
2.5
3
3.5
4
x 10
4
Resource utility v.s call arrival rate Total users in system
Conclusions
How to increase the system resource utility is a
challenging problem. Based on the prediction of the
handoff call arrival rate and the variation of traffic in
different hours, we present a new resource management
approach coordinating with IEEE1900.4 architecture ,
which can reserve system resource dynamically and re-
allocat for each RAN, so that the performance of systems
is increased. .
22
T
T
h
h
a
a
n
n
k
k
s
s
!
!