TY - GEN
T1 - Optimized path registration with prefix delegation in nested mobile networks
AU - Park, Hyemee
AU - Lee, Tae Jin
AU - Choo, Hyunseung
PY - 2005
Y1 - 2005
N2 - As the need for a solution to support mobile network is consistently increasing, NEtwork MObility (NEMO) Basic Support protocol is proposed by using a bi-directional tunnel between a Mobile Router (MR) and its Home Agent (HA). However, the multiple levels of MR-HA tunnels in nested mobile networks lead to significant suboptimal routing, called pinball routing. In this paper we propose a Route Optimization (RO) scheme based on improved Prefix Delegation in order to pass ingress filtering. In an effort to provide the RO based on the improved procedure, it performs an address translation mechanism and a registration procedure to inform other nodes of an optimal path. The proposed scheme supports nested mobile networks without requiring additional tunneling, thus reducing packet overhead and latency with regard to the NEMO basic solution. We evaluate the proposed scheme with previous schemes by analytical models, According to the results, our newly proposed scheme shows 20% and 50% of performance improvements for the worst case and the best case, respectively.
AB - As the need for a solution to support mobile network is consistently increasing, NEtwork MObility (NEMO) Basic Support protocol is proposed by using a bi-directional tunnel between a Mobile Router (MR) and its Home Agent (HA). However, the multiple levels of MR-HA tunnels in nested mobile networks lead to significant suboptimal routing, called pinball routing. In this paper we propose a Route Optimization (RO) scheme based on improved Prefix Delegation in order to pass ingress filtering. In an effort to provide the RO based on the improved procedure, it performs an address translation mechanism and a registration procedure to inform other nodes of an optimal path. The proposed scheme supports nested mobile networks without requiring additional tunneling, thus reducing packet overhead and latency with regard to the NEMO basic solution. We evaluate the proposed scheme with previous schemes by analytical models, According to the results, our newly proposed scheme shows 20% and 50% of performance improvements for the worst case and the best case, respectively.
UR - https://www.scopus.com/pages/publications/33646855221
U2 - 10.1007/11599463_33
DO - 10.1007/11599463_33
M3 - Conference contribution
AN - SCOPUS:33646855221
SN - 3540308563
SN - 9783540308560
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 327
EP - 336
BT - Mobile Ad-hoc and Sensor Networks - First International Conference, MSN 2005, Proceedings
T2 - 1st International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2005
Y2 - 13 December 2005 through 15 December 2005
ER -