Skip to main content

Performance of Keyword Connection Algorithm in Nested Mobility Networks

  • Conference paper
Advances in Computer Systems Architecture (ACSAC 2007)

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

Included in the following conference series:

  • 900 Accesses

Abstract

As wireless techniques are developing, a mobile node has an ability to move everywhere. Some nodes become a group and transfer to other coverage together. Therefore, a mobile node has to identify where it is and establish the communication session rapidly, although it changes its point of attachment. We suggest Information-based mechanism and simulate it by NS-2. The result shows suggested mechanism reduces the handoff latency and end-to-end delay.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Devarapali, V., Wakikawa, R., Petrescu, A., Thubert, P.: Network Mobility (NEMO) Basic Support Protocol, RFC3962 (2005)

    Google Scholar 

  2. Ng, C., Paik, E., Ernst, T.: Analysis of Multihoming in Network Mobility Support, draft-ietf-nemo-multihoming-isuues-02.txt (August 2005)

    Google Scholar 

  3. Ryu, H.-K., Kim, D.-H., Cho, Y.-Z.: Improved Handoff Scheme for Supporting Network Mobility in Nested Mobile Networks. Springer, Heidelberg (2005)

    Google Scholar 

  4. Watari, M., Wakikawa, R., Ernst, T., Murai, J.: Optimal path Establishment for Nested Mobile Networks. IEEE, Los Alamitos (2006)

    Google Scholar 

  5. Lamsel, P.: Network Mobility, research seminar on hot topics. In: Internet protocols (2005)

    Google Scholar 

  6. Ernst, T., Lach, H-Y.: Network Mobility Support Terminology, draft-ietf-nemo-terminology-03.txt (August 2005)

    Google Scholar 

  7. Ernst, T.: Network Mobility Support Goals and Requirements, draft-ietf-nemo-requirement-04 (August 2005)

    Google Scholar 

  8. Beacon Routing in Active Network, http://www.ittc.ku.edu/ananth/845.html

  9. Miller, M.A.: PE, Inside Secrets SNMP Managing Internetworks. SamGakHyung Press (1998)

    Google Scholar 

  10. Wang, Y., Chen, W., Ho, J.S.M.: Performance Analysis of Adaptive Location Management for Mobile IP. Technical Report 97-CSE-13, Southern Methodist University (1997)

    Google Scholar 

  11. Hagen, S.: IPv6 Essentials, Oreilly (July 2002)

    Google Scholar 

  12. The CMU Monarch Project’s Wireless and Mobility Extension to ns: The CMU Monarch Project (August 1999)

    Google Scholar 

  13. Widmer, J.: Network simulations for A Mobile Network Architecture for vehicles, International Computer Science Institute Technology Report TR-00-009 (May 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lynn Choi Yunheung Paek Sangyeun Cho

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryu, SH., Baik, DK. (2007). Performance of Keyword Connection Algorithm in Nested Mobility Networks. In: Choi, L., Paek, Y., Cho, S. (eds) Advances in Computer Systems Architecture. ACSAC 2007. Lecture Notes in Computer Science, vol 4697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74309-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74309-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74308-8

  • Online ISBN: 978-3-540-74309-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics