A Novel Domain Reorganizing Algorithm for NetworkLayer Mobility Management in 4G Networks

1
A Novel Domain Re-organizing Algorithm for
Network-Layer Mobility Management in 4G Networks

• Jianwen Huang, Ruijun Feng, Lei Liu, Mei Song,
  Junde Song
• Communications, Circuits and Systems, 2004.
  ICCCAS 2004
• Date2006/03/22
• Reporter Bor-Shyang Liang

2
Outline

• Introduction
• Hierarchical Mobile IPv6 Management
• Motivation
• Domain Re-organizing Algorithm
• Simulation scenario and result analysis
• Conclusion

3
Introduction

• Network-Layer Mobility Management (NMM) combines
  the mobile communication technology and IP
  technology to form an enhanced mobility
  management for next generation All-IP
  wireless/mobile Internet.
• By extending Mobile IP protocol, the functions of
  hierarchical NMM is implemented.

4
Hierarchical Mobile IPv6 Management (HMIPv6)

• When high handoff frequently happens between two
  neighboring ARs, which are in the different
  domains respectively, it will cause a lot of
  inter-domain handoff signaling cost and delay.

5
Motivation

• How to adjust the network topology to against the
  fact that user mobility characteristics are
  always in changing?

6
Domain Re-organizing Algorithm

• Using real-time measurement to make different
  cells with highest handoff frequency into the
  same domain.
• inter-domain handoff -gt intra-domain handoff

7
Domain Re-organizing Scheme

• Whole Network
• ANa, b, c, d, e, f, g,
• Pre-planned MAP domain set
• MN(a, b, g, f), (d, e, h, i), (c, e, j, k),
• M1, M2, M3,
• The set of neighbor cells of special cell
• N(a)b, c, d, e, f, g
• Handoff times between cell i and cell j between t

8
Domain Re-organizing Scheme (Cont.)

• Tight neighbor cells
• Assume N(i)ni, cell j is not under the same
  MAP domain as cell i,
• HFi,j(t) gt ?/ni (? weight factor)
• gt j is one of the set Nt(i)
• Nt(a)e, d
• Benefit gained form the algorithm
• ?1 intra-handoff cost factor
• ?2 inter-handoff cost factor (?2 gt ?1)
• cell j is not under the same domain as cell
  i

9
Domain Re-organizing Algorithm (Cont.)

• Assume Nt(a) d,e
• (HFa,d(t) gt ?/6, HFa,e(t) gt ?/6)

10
Domain Re-organizing Scheme (Cont.)
11
Simulation scenario

• Simulation
• Tool NS2
• Area 400m x 400m
• 802.11b wireless AP 7
• Radio transmission range 100m
• Cell overlap distance 20m
• Data Rate 11Mb/s
• Mobile Node 28 (MAP1lt-gtMAP220)
• MAP
• MAP11, 3, MAP22, 5, MAP34, 6, 7
• Connected with ARs
• Bandwidth 10Mb/s, delay 2ms
• HA connected with network
• Bandwidth 100Mb/s, delay 16ms

12
Signaling Cost v.s. Speed of MNs
13
Comparison of handoff delay before and after
reorganizing scheme
14
Conclusion

• A good algorithm can make inter-handoff change to
  inter-handoff so that the signaling cost and
  handoff delay can be reduced.
• May frequent attachment process bring extra
  overhead to the network?