|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
Multilevel Hierarchical Mobility Management in Densely Meshed Networks
Keita KAWANO Kazuhiko KINOSHITA Koso MURAKAMI
Publication
IEICE TRANSACTIONS on Communications
Vol.E89-B
No.7
pp.2002-2011 Publication Date: 2006/07/01 Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.7.2002 Print ISSN: 0916-8516 Type of Manuscript: PAPER Category: Network Keyword: Mobile IP, Hierarchical Mobile IPv6, micromobility, mobility management,
Full Text: PDF(454.9KB)>>
Summary:
Micromobility management is a key issue for the deployment of broadband mobile communication services. The packet loss during handover and the handover latency need to be minimized to maintain the high quality of these services. We have previously proposed a mobility management scheme that addresses this issue in wide-area mobile networks that employed hierarchical multiple mobility management routers (Mobility Anchor Points or MAPs). Our scheme directs a Mobile Terminal (MT) to a suitable MAP to fully minimize packet loss during handover, and handover latency of the MTs. In our previous work, we confirmed the effectiveness of our scheme using a simple tree network. Actual networks however, always have densely meshed topologies to provide some redundancy for the elimination of single points of failure. In such networks, it is difficult to deduce the relationships between the MAPs, and this makes it difficult for our scheme to select a suitable MAP for an MT, because the selection is performed using both the MT's smoothed speed and the relationships existing between the MAPs located above the Access Router (AR), to which the MT is connected. In this paper, we propose a method to overcome this problem, by autonomously adjusting the selection criteria that are individually configured for use at a particular AR, and we evaluate this method using simulation experiments. The results show that our mobility management scheme works well in densely meshed networks using the proposed additional method.
|
|
|