On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks

Ing Chau Chang, Chia Hao Chou, Lin Huang Chang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we first apply the hierarchical concept to the care-of prefix (CoP) scheme as HCoP and enhance HCoP with a novel binding update tree (BUT) structure as HCoP-B for network mobility (NEMO) management of the nested mobile network. Second, we further extend HCoP-B to support the seamless handoff of the nested NEMO. As compared to schemes such as reverse routing header (RRH), route optimisation using tree information option (ROTIO) and HCoP with numerical performance evaluations, HCoP-B achieves the shortest handoff latency and significantly reduces the consumed network bandwidth of global binding update messages for route optimisations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Besides, HCoP-B also achieves shorter playback disruption time and buffering time than ROTIO does, which is the only one scheme mentioned how to achieve seamless handoff for the NEMO in the literature, for ongoing real-time multimedia applications whenever the mobile subnet in the old nested mobile network hands over to a new one.

Original languageEnglish
Pages (from-to)53-62
Number of pages10
JournalInternational Journal of High Performance Computing and Networking
Volume7
Issue number1
DOIs
Publication statusPublished - 2011 Feb 1

Fingerprint

Wireless networks
Bandwidth

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

@article{5f2899efcaf3437a921a05eaa2140574,
title = "On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks",
abstract = "In this paper, we first apply the hierarchical concept to the care-of prefix (CoP) scheme as HCoP and enhance HCoP with a novel binding update tree (BUT) structure as HCoP-B for network mobility (NEMO) management of the nested mobile network. Second, we further extend HCoP-B to support the seamless handoff of the nested NEMO. As compared to schemes such as reverse routing header (RRH), route optimisation using tree information option (ROTIO) and HCoP with numerical performance evaluations, HCoP-B achieves the shortest handoff latency and significantly reduces the consumed network bandwidth of global binding update messages for route optimisations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Besides, HCoP-B also achieves shorter playback disruption time and buffering time than ROTIO does, which is the only one scheme mentioned how to achieve seamless handoff for the NEMO in the literature, for ongoing real-time multimedia applications whenever the mobile subnet in the old nested mobile network hands over to a new one.",
author = "Chang, {Ing Chau} and Chou, {Chia Hao} and Chang, {Lin Huang}",
year = "2011",
month = "2",
day = "1",
doi = "10.1504/IJHPCN.2011.038710",
language = "English",
volume = "7",
pages = "53--62",
journal = "International Journal of High Performance Computing and Networking",
issn = "1740-0562",
publisher = "Inderscience Enterprises Ltd",
number = "1",

}

On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks. / Chang, Ing Chau; Chou, Chia Hao; Chang, Lin Huang.

In: International Journal of High Performance Computing and Networking, Vol. 7, No. 1, 01.02.2011, p. 53-62.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On design of a route-optimised and seamless HCoP-B scheme for nested mobile networks

AU - Chang, Ing Chau

AU - Chou, Chia Hao

AU - Chang, Lin Huang

PY - 2011/2/1

Y1 - 2011/2/1

N2 - In this paper, we first apply the hierarchical concept to the care-of prefix (CoP) scheme as HCoP and enhance HCoP with a novel binding update tree (BUT) structure as HCoP-B for network mobility (NEMO) management of the nested mobile network. Second, we further extend HCoP-B to support the seamless handoff of the nested NEMO. As compared to schemes such as reverse routing header (RRH), route optimisation using tree information option (ROTIO) and HCoP with numerical performance evaluations, HCoP-B achieves the shortest handoff latency and significantly reduces the consumed network bandwidth of global binding update messages for route optimisations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Besides, HCoP-B also achieves shorter playback disruption time and buffering time than ROTIO does, which is the only one scheme mentioned how to achieve seamless handoff for the NEMO in the literature, for ongoing real-time multimedia applications whenever the mobile subnet in the old nested mobile network hands over to a new one.

AB - In this paper, we first apply the hierarchical concept to the care-of prefix (CoP) scheme as HCoP and enhance HCoP with a novel binding update tree (BUT) structure as HCoP-B for network mobility (NEMO) management of the nested mobile network. Second, we further extend HCoP-B to support the seamless handoff of the nested NEMO. As compared to schemes such as reverse routing header (RRH), route optimisation using tree information option (ROTIO) and HCoP with numerical performance evaluations, HCoP-B achieves the shortest handoff latency and significantly reduces the consumed network bandwidth of global binding update messages for route optimisations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Besides, HCoP-B also achieves shorter playback disruption time and buffering time than ROTIO does, which is the only one scheme mentioned how to achieve seamless handoff for the NEMO in the literature, for ongoing real-time multimedia applications whenever the mobile subnet in the old nested mobile network hands over to a new one.

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

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

U2 - 10.1504/IJHPCN.2011.038710

DO - 10.1504/IJHPCN.2011.038710

M3 - Article

AN - SCOPUS:79952139743

VL - 7

SP - 53

EP - 62

JO - International Journal of High Performance Computing and Networking

JF - International Journal of High Performance Computing and Networking

SN - 1740-0562

IS - 1

ER -