HCoP-B: A hierarchical care-of prefix with BUT scheme for nested mobile networks

Ing-Chau Chang, Chia Hao Chou

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

With current Internet Engineering Task Force (IETF) NEtwork MObility (NEMO) basic support (NBS) to manage mobility of a mobile network that moves as a whole, all communication to and from mobile network nodes (MNNs) inside the mobile network must go through multiple tunnels between upstream mobile routers and their home agents. This results in the nonoptimized route and increased packet delay between communication peers. Hence, numerous NEMO schemes such as reverse routing header (RRH), mobile IPv6 route optimization for NEMO (MIRON), and care-of prefix (CoP) have been proposed to solve it. Whenever the whole mobile network or its mobile subnet changes its points of network attachments, a large number of duplicate binding update messages are sent from the handoff mobile network to all connecting correspondent nodes on the Internet to establish a direct and optimized packet route between them, which raises the corresponding consumed Internet and local wireless network bandwidth and, in turn, increases the packet transmission delay. However, traditional NEMO schemes cannot solve this serious binding update storm problem. In this paper, we apply the hierarchical concept to the CoP scheme as the Hierarchical CoP (HCoP) scheme and then enhance the HCoP with a novel binding update tree (BUT) structure as the HCoP-B for efficient NEMO management of the nested mobile network. Compared with the traditional RRH, MIRON, and HCoP with intensive performance analyses and simulations, HCoP-B achieves the shortest handoff latency, the lowest number of duplicate binding update messages conveyed over the Internet, and the least amount of consumed Internet and local wireless network bandwidth for session initialization and route optimization of all connecting correspondent nodes at the expense of a small amount of extra binding caches in the BUT. We also discuss important issues about HCoP-B deployment, security, and mobility anchor point (MAP) location alternatives. Consequently, HCoP-B achieves the correspondent node (CN)'s route optimization and resolves the associated binding update storm problem simultaneously for the nested mobile network.

Original languageEnglish
Pages (from-to)2942-2965
Number of pages24
JournalIEEE Transactions on Vehicular Technology
Volume58
Issue number6
DOIs
Publication statusPublished - 2009 Jun 25

Fingerprint

Mobile Networks
Prefix
Network Mobility
Wireless networks
Update
Route Optimization
Internet
Mobile IPv6
Handoff
Vertex of a graph
Wireless Networks
Reverse
Routing
Bandwidth
Mobility Management
Point Location
Network Management
Change Point
Tree Structure
Router

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{c66816bc63e34c1b971a680a44a23eaf,
title = "HCoP-B: A hierarchical care-of prefix with BUT scheme for nested mobile networks",
abstract = "With current Internet Engineering Task Force (IETF) NEtwork MObility (NEMO) basic support (NBS) to manage mobility of a mobile network that moves as a whole, all communication to and from mobile network nodes (MNNs) inside the mobile network must go through multiple tunnels between upstream mobile routers and their home agents. This results in the nonoptimized route and increased packet delay between communication peers. Hence, numerous NEMO schemes such as reverse routing header (RRH), mobile IPv6 route optimization for NEMO (MIRON), and care-of prefix (CoP) have been proposed to solve it. Whenever the whole mobile network or its mobile subnet changes its points of network attachments, a large number of duplicate binding update messages are sent from the handoff mobile network to all connecting correspondent nodes on the Internet to establish a direct and optimized packet route between them, which raises the corresponding consumed Internet and local wireless network bandwidth and, in turn, increases the packet transmission delay. However, traditional NEMO schemes cannot solve this serious binding update storm problem. In this paper, we apply the hierarchical concept to the CoP scheme as the Hierarchical CoP (HCoP) scheme and then enhance the HCoP with a novel binding update tree (BUT) structure as the HCoP-B for efficient NEMO management of the nested mobile network. Compared with the traditional RRH, MIRON, and HCoP with intensive performance analyses and simulations, HCoP-B achieves the shortest handoff latency, the lowest number of duplicate binding update messages conveyed over the Internet, and the least amount of consumed Internet and local wireless network bandwidth for session initialization and route optimization of all connecting correspondent nodes at the expense of a small amount of extra binding caches in the BUT. We also discuss important issues about HCoP-B deployment, security, and mobility anchor point (MAP) location alternatives. Consequently, HCoP-B achieves the correspondent node (CN)'s route optimization and resolves the associated binding update storm problem simultaneously for the nested mobile network.",
author = "Ing-Chau Chang and Chou, {Chia Hao}",
year = "2009",
month = "6",
day = "25",
doi = "10.1109/TVT.2008.2010944",
language = "English",
volume = "58",
pages = "2942--2965",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

HCoP-B : A hierarchical care-of prefix with BUT scheme for nested mobile networks. / Chang, Ing-Chau; Chou, Chia Hao.

In: IEEE Transactions on Vehicular Technology, Vol. 58, No. 6, 25.06.2009, p. 2942-2965.

Research output: Contribution to journalArticle

TY - JOUR

T1 - HCoP-B

T2 - A hierarchical care-of prefix with BUT scheme for nested mobile networks

AU - Chang, Ing-Chau

AU - Chou, Chia Hao

PY - 2009/6/25

Y1 - 2009/6/25

N2 - With current Internet Engineering Task Force (IETF) NEtwork MObility (NEMO) basic support (NBS) to manage mobility of a mobile network that moves as a whole, all communication to and from mobile network nodes (MNNs) inside the mobile network must go through multiple tunnels between upstream mobile routers and their home agents. This results in the nonoptimized route and increased packet delay between communication peers. Hence, numerous NEMO schemes such as reverse routing header (RRH), mobile IPv6 route optimization for NEMO (MIRON), and care-of prefix (CoP) have been proposed to solve it. Whenever the whole mobile network or its mobile subnet changes its points of network attachments, a large number of duplicate binding update messages are sent from the handoff mobile network to all connecting correspondent nodes on the Internet to establish a direct and optimized packet route between them, which raises the corresponding consumed Internet and local wireless network bandwidth and, in turn, increases the packet transmission delay. However, traditional NEMO schemes cannot solve this serious binding update storm problem. In this paper, we apply the hierarchical concept to the CoP scheme as the Hierarchical CoP (HCoP) scheme and then enhance the HCoP with a novel binding update tree (BUT) structure as the HCoP-B for efficient NEMO management of the nested mobile network. Compared with the traditional RRH, MIRON, and HCoP with intensive performance analyses and simulations, HCoP-B achieves the shortest handoff latency, the lowest number of duplicate binding update messages conveyed over the Internet, and the least amount of consumed Internet and local wireless network bandwidth for session initialization and route optimization of all connecting correspondent nodes at the expense of a small amount of extra binding caches in the BUT. We also discuss important issues about HCoP-B deployment, security, and mobility anchor point (MAP) location alternatives. Consequently, HCoP-B achieves the correspondent node (CN)'s route optimization and resolves the associated binding update storm problem simultaneously for the nested mobile network.

AB - With current Internet Engineering Task Force (IETF) NEtwork MObility (NEMO) basic support (NBS) to manage mobility of a mobile network that moves as a whole, all communication to and from mobile network nodes (MNNs) inside the mobile network must go through multiple tunnels between upstream mobile routers and their home agents. This results in the nonoptimized route and increased packet delay between communication peers. Hence, numerous NEMO schemes such as reverse routing header (RRH), mobile IPv6 route optimization for NEMO (MIRON), and care-of prefix (CoP) have been proposed to solve it. Whenever the whole mobile network or its mobile subnet changes its points of network attachments, a large number of duplicate binding update messages are sent from the handoff mobile network to all connecting correspondent nodes on the Internet to establish a direct and optimized packet route between them, which raises the corresponding consumed Internet and local wireless network bandwidth and, in turn, increases the packet transmission delay. However, traditional NEMO schemes cannot solve this serious binding update storm problem. In this paper, we apply the hierarchical concept to the CoP scheme as the Hierarchical CoP (HCoP) scheme and then enhance the HCoP with a novel binding update tree (BUT) structure as the HCoP-B for efficient NEMO management of the nested mobile network. Compared with the traditional RRH, MIRON, and HCoP with intensive performance analyses and simulations, HCoP-B achieves the shortest handoff latency, the lowest number of duplicate binding update messages conveyed over the Internet, and the least amount of consumed Internet and local wireless network bandwidth for session initialization and route optimization of all connecting correspondent nodes at the expense of a small amount of extra binding caches in the BUT. We also discuss important issues about HCoP-B deployment, security, and mobility anchor point (MAP) location alternatives. Consequently, HCoP-B achieves the correspondent node (CN)'s route optimization and resolves the associated binding update storm problem simultaneously for the nested mobile network.

UR - http://www.scopus.com/inward/record.url?scp=67549125425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67549125425&partnerID=8YFLogxK

U2 - 10.1109/TVT.2008.2010944

DO - 10.1109/TVT.2008.2010944

M3 - Article

AN - SCOPUS:67549125425

VL - 58

SP - 2942

EP - 2965

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 6

ER -