Skip to main content

Optimized Path Registration with Prefix Delegation in Nested Mobile Networks

  • Conference paper
Mobile Ad-hoc and Sensor Networks (MSN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3794))

Included in the following conference series:

Abstract

As the need for a solution to support mobile network is consistently increasing, NEtwork MObility (NEMO) Basic Support protocol is proposed by using a bi-directional tunnel between a Mobile Router (MR) and its Home Agent (HA). However, the multiple levels of MR-HA tunnels in nested mobile networks lead to significant suboptimal routing, called pinball routing. In this paper we propose a Route Optimization (RO) scheme based on improved Prefix Delegation in order to pass ingress filtering. In an effort to provide the RO based on the improved procedure, it performs an address translation mechanism and a registration procedure to inform other nodes of an optimal path. The proposed scheme supports nested mobile networks without requiring additional tunneling, thus reducing packet overhead and latency with regard to the NEMO basic solution. We evaluate the proposed scheme with previous schemes by analytical models. According to the results, our newly proposed scheme shows 20% and 50% of performance improvements for the worst case and the best case, respectively.

This work was supported in parts by Brain Korea 21 and the Ministry of Information and Communication in Republic of Korea.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Perkins, C.: IP Mobility support for IPv4, IETF, RFC 3220 (January 2002)

    Google Scholar 

  2. Johnson, D., Perkins, C., Arkko, J.: Mobility Support in IPv6, IETF, RFC 3775 (June 2004)

    Google Scholar 

  3. Devarapalli, V., Wakikawa, R., Petrescu, A., Thubert, P.: Network Mobility (NEMO) Basic Support Protocol, IETF, RFC 3963 (January 2005)

    Google Scholar 

  4. Thubert, P., Molteni, M.: IPv6 Reverse Routing Header and its application to Mobile Networks, draft-thubert-nemo-reverse-routing-header-05.txt, March 4 (2005)

    Google Scholar 

  5. KyeongJin, L., et al.: Route Optimization based on ND-Proxy for Mobile Nodes in IPv6 Mobile Networks. In: IEEE 59th Vehicular Technology Conference, May 17-19 (2004)

    Google Scholar 

  6. KyeongJin, L., et al.: Route Optimization for Mobile Nodes in Mobile Network based on Prefix Delegation. In: IEEE 58th Vehicular Technology Conference, October 6-9 (2003)

    Google Scholar 

  7. Srisuresh, P., Holdrege, M.: IP Network Address Translator (NAT) Terminology and Considerations, IETF, RFC 2663 (August 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, H., Lee, TJ., Choo, H. (2005). Optimized Path Registration with Prefix Delegation in Nested Mobile Networks. In: Jia, X., Wu, J., He, Y. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2005. Lecture Notes in Computer Science, vol 3794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599463_33

Download citation

  • DOI: https://doi.org/10.1007/11599463_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30856-0

  • Online ISBN: 978-3-540-32276-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics