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

Ing-Chau Chang, Chia H. Chou, Lin Huang Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we 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. As compared to schemes such as Reverse Routing Header (RRH), Route Optimization 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 optimizations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Consequently, HCoP-B resolves the RO storm problem.

Original languageEnglish
Title of host publicationParallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq
Pages844-855
Number of pages12
Volume4742 LNCS
Publication statusPublished - 2007 Dec 1
Event5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007 - Niagara Falls, Canada
Duration: 2007 Aug 292007 Aug 31

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4742 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007
CountryCanada
CityNiagara Falls
Period07-08-2907-08-31

Fingerprint

Route Optimization
Mobile Networks
Prefix
Wireless networks
Hand
Update
Network Mobility
Mobility Management
Handoff
Handover
Network Management
Tree Structure
Performance Evaluation
Latency
Reverse
Resolve
Routing
Bandwidth
Optimization Problem
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chang, I-C., Chou, C. H., & Chang, L. H. (2007). A hierarchical care-of prefix with but scheme for nested mobile networks. In Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq (Vol. 4742 LNCS, pp. 844-855). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).
Chang, Ing-Chau ; Chou, Chia H. ; Chang, Lin Huang. / A hierarchical care-of prefix with but scheme for nested mobile networks. Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq. Vol. 4742 LNCS 2007. pp. 844-855 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fe338c2d04cb4f5aaaedc9c598198e97,
title = "A hierarchical care-of prefix with but scheme for nested mobile networks",
abstract = "In this paper, we 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. As compared to schemes such as Reverse Routing Header (RRH), Route Optimization 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 optimizations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Consequently, HCoP-B resolves the RO storm problem.",
author = "Ing-Chau Chang and Chou, {Chia H.} and Chang, {Lin Huang}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "3540747419",
volume = "4742 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "844--855",
booktitle = "Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq",

}

Chang, I-C, Chou, CH & Chang, LH 2007, A hierarchical care-of prefix with but scheme for nested mobile networks. in Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq. vol. 4742 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4742 LNCS, pp. 844-855, 5th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2007, Niagara Falls, Canada, 07-08-29.

A hierarchical care-of prefix with but scheme for nested mobile networks. / Chang, Ing-Chau; Chou, Chia H.; Chang, Lin Huang.

Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq. Vol. 4742 LNCS 2007. p. 844-855 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4742 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A hierarchical care-of prefix with but scheme for nested mobile networks

AU - Chang, Ing-Chau

AU - Chou, Chia H.

AU - Chang, Lin Huang

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In this paper, we 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. As compared to schemes such as Reverse Routing Header (RRH), Route Optimization 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 optimizations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Consequently, HCoP-B resolves the RO storm problem.

AB - In this paper, we 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. As compared to schemes such as Reverse Routing Header (RRH), Route Optimization 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 optimizations (RO) of all correspondent nodes (CN) after the nested mobile network hands over to a new AR. Consequently, HCoP-B resolves the RO storm problem.

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

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

M3 - Conference contribution

AN - SCOPUS:38149051230

SN - 3540747419

SN - 9783540747413

VL - 4742 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 844

EP - 855

BT - Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq

ER -

Chang I-C, Chou CH, Chang LH. A hierarchical care-of prefix with but scheme for nested mobile networks. In Parallel and Distributed Processing and Applications - 5th International Symposium, ISPA 2007, Proceedingsq. Vol. 4742 LNCS. 2007. p. 844-855. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).