Skip to main content

A Hierarchical Care-of Prefix with BUT Scheme for Nested Mobile Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4742))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Johnson, D., Perkins, C., Arkko, J.: Mobility Support in IPv6, IETF RFC 3775 (2003)

    Google Scholar 

  2. Devarapalli, V., Wakikawa, R.: NEMO: Basic Support Protocol, IETF RFC 3963 (2005)

    Google Scholar 

  3. Perera, E., et al.: Survey on Network Mobility Support. Mobile Computing and Communications Review 8(2), 7–19 (2004)

    Article  Google Scholar 

  4. Thubert, P., Molteni, M.: IPv6 Reverse Routing Header and Its Application to Mobile Networks, Internet Draft: draft-thubert-nemo reverse-routing-header-05.txt (2004)

    Google Scholar 

  5. Cho, H., Kwon, T., Choi, Y.: Route Optimization Using Tree Information Option for Nested Mobile Networks. IEEE JSAC 24(9), 1717–1724 (2006)

    Google Scholar 

  6. Thubert, P., Bontoux, C., Montavont, N.: Nested Nemo Tree Discovery, Internet Draft: draft-thubert-tree- discovery-03.txt (2006)

    Google Scholar 

  7. Suzuki, T., et al.: Care-of Prefix Routing for Moving Networks. IEICE Trans. on Communications E88-B(7), 2756–2764 (2005)

    Article  Google Scholar 

  8. Soliman, H., Castelluccia, C., MAlki, K.E., Bellier, L.: Hierarchical Mobile IPv6 Mobility Management (HMIPv6), IETF RFC 4140 (2005)

    Google Scholar 

  9. Cho, H., Paik, E.K.: Hierarchical Mobile Router Advertisement for Nested Mobile Networks, Internet Draft: draft-cho-nemo-hmra- oo.txt (2004)

    Google Scholar 

  10. Keeler, K., Westbrook, J.: Short Encoding of Planar Graphs and Maps. Discrete Applied Mathematics 58, 239–252 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ivan Stojmenovic Ruppa K. Thulasiram Laurence T. Yang Weijia Jia Minyi Guo Rodrigo Fernandes de Mello

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, IC., Chou, CH., Chang, LH. (2007). A Hierarchical Care-of Prefix with BUT Scheme for Nested Mobile Networks. In: Stojmenovic, I., Thulasiram, R.K., Yang, L.T., Jia, W., Guo, M., de Mello, R.F. (eds) Parallel and Distributed Processing and Applications. ISPA 2007. Lecture Notes in Computer Science, vol 4742. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74742-0_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74742-0_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74741-3

  • Online ISBN: 978-3-540-74742-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics