2006 | OriginalPaper | Chapter
Lightweight Bindings for Mobile Routers
Authors : Youngjin Ahn, Tae-Jin Lee, Hyunseung Choo
Published in: Computational Science and Its Applications - ICCSA 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
NEtwork MObility (NEMO), which supports a moving network of mobile devices, has only recently appeared. In this paper, the Route Optimization (RO) problem on both single and nested Mobile Networks, is studied. There are several well-known heuristics [1, 6, 7, 10, 11], which attempt to solve the RO problem in the Mobile Network. However, these schemes do not entirely solve the problem, because of the additional overhead of supporting RO in the Mobile Network. In this paper, a new Binding Update (BU) scheme for RO is proposed, and analyzed using representative work of published literature. This is achieved by employing an extra Home Address Option (HAO) slot, in the registration time, resulting in a significant reduction in the overhead for the BUs. Based on performance analysis, it is demonstrated that the proposed algorithm outperforms other algorithms with regard to the delay.