Regional Information-based Route Optimization Scheme in Nested Mobile Networks 


Vol. 30,  No. 4, pp. 178-185, Apr.  2005


PDF
  Abstract

NEMO basic support is a solution that provides network mobility in the Internet topology. Yet, when multiple mobile networks are nested, this basic solution suffers from pinball-routing and a severe routing overhead. Therefore, several solutions for route optimization in a nested mobile network have already been suggested by the IETF NEMO WG. However, the current paper proposes Regional Information-based Route Optimization (RIRO) in which mobile routers maintain a Nested Router List (NRL) to obtain next-hop information, and packets are transmitted with a new routing header called an RIRO Routing Header (RIRO-RH). We showed that RIRO had the minimum packet overhead that remained constant, irrespective of how deep the mobile network was nested, in comparison with two earlier proposed schemes - Reverse Routing Header (RRH) and Bi-directional tunnel between HA and Top-Level mobile router (BHT).

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. w. Kim, H. d. Park, K. w. Lee, Y. s. Choi, Y. z. Cho, B. k. Cho, "Regional Information-based Route Optimization Scheme in Nested Mobile Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 178-185, 2005. DOI: .

[ACM Style]

Joon woo Kim, Hee dong Park, Kang won Lee, Young soo Choi, You ze Cho, and Bong kwan Cho. 2005. Regional Information-based Route Optimization Scheme in Nested Mobile Networks. The Journal of Korean Institute of Communications and Information Sciences, 30, 4, (2005), 178-185. DOI: .

[KICS Style]

Joon woo Kim, Hee dong Park, Kang won Lee, Young soo Choi, You ze Cho, Bong kwan Cho, "Regional Information-based Route Optimization Scheme in Nested Mobile Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 4, pp. 178-185, 4. 2005.