loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 International Conference on Parallel Processing Workshops (ICPPW 2007)
Fast Route Optimization for Dynamic Nested NEMO
Xi'an, Chin
September 10-September 14
ISBN: 0-7695-2934-8
Jae-Kwon Seo, Sejong University, Korea
Sung-Hyun Nam, Sejong University, Korea
Kyung-Geun Lee, Sejong University, Korea
As wireless communication and terminal technologies develop, the mobility of users rapidly increases. The users in this dynamic state also want to connect their devices and to receive seamlessly services anywhere, anytime. Standard groups therefore progress the research and standardization for ?mobility support?. Network Mobility (NEMO) proposed by IETF focuses on the condition where the entire network moves. However, in the ?NEMO basic support protocol?, the tunneling overheads increase and the pinball-routing problem occurs as the levels of nesting of a mobile network increase. Thus, various schemes have been proposed under the route optimization of the nested NEMO. However, the existing schemes have a long convergence time in route optimization after handoff. In addition, if the levels of nesting are changed, the communication is disrupted. Therefore, we propose a fast route optimization to support real-time applications even if the levels of nesting of a mobile network are dynamically changed.
Index Terms:
NEMO, mobility, IPv6, route optimization
Citation:
Jae-Kwon Seo, Sung-Hyun Nam, Kyung-Geun Lee, "Fast Route Optimization for Dynamic Nested NEMO," icppw, pp.49, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.