Lightweight Bindings for Mobile Routers
Author(s) -
Youngjin Ahn,
TaeJin Lee,
Hyunseung Choo
Publication year - 2006
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-34072-6
DOI - 10.1007/11751588_69
Subject(s) - computer science , heuristics , overhead (engineering) , scheme (mathematics) , reduction (mathematics) , computer network , distributed computing , operating system , mathematical analysis , geometry , mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom