TY - GEN
T1 - Reduction of signaling cost and handoff latency with VMAPs in HMIPv6
AU - Jeong, Jongpil
AU - Chung, Min Young
AU - Choo, Hyunseung
PY - 2006
Y1 - 2006
N2 - In this paper, we propose cost-reduced binding update scheme (CRBU) which further reduces signaling traffic for location updates by employing virtual mobility anchor point (VMAP) on top of overlapped MAP in Hierarchical Mobile IPv6 (HMIPv6). This proposed scheme significantly improves performance compared to HMIPv6, in terms of binding update rate per user and average handoff latency. Also it makes the mobile nodes (MNs) moving around the boundary access routers (ARs) of adjacent MAPs and they become to move within a VMAP. It is certain that our scheme uses the network resources efficiently by the removal of global binding updates for MNs in boundary ARs inside MAPs. And we explain an analytic model for performance analysis of HMIPv6 networks, which is based on the random walk mobility model. Based on this analytic model, we formulate binding update cost and analyze it as the probability that an MN stays in the current cell (q). As a result, our proposed scheme can greatly reduce the packet loss and delay by eliminating Inter-MAP handoff.
AB - In this paper, we propose cost-reduced binding update scheme (CRBU) which further reduces signaling traffic for location updates by employing virtual mobility anchor point (VMAP) on top of overlapped MAP in Hierarchical Mobile IPv6 (HMIPv6). This proposed scheme significantly improves performance compared to HMIPv6, in terms of binding update rate per user and average handoff latency. Also it makes the mobile nodes (MNs) moving around the boundary access routers (ARs) of adjacent MAPs and they become to move within a VMAP. It is certain that our scheme uses the network resources efficiently by the removal of global binding updates for MNs in boundary ARs inside MAPs. And we explain an analytic model for performance analysis of HMIPv6 networks, which is based on the random walk mobility model. Based on this analytic model, we formulate binding update cost and analyze it as the probability that an MN stays in the current cell (q). As a result, our proposed scheme can greatly reduce the packet loss and delay by eliminating Inter-MAP handoff.
UR - https://www.scopus.com/pages/publications/84886010857
U2 - 10.1007/11943952_29
DO - 10.1007/11943952_29
M3 - Conference contribution
AN - SCOPUS:84886010857
SN - 3540499326
SN - 9783540499329
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 341
EP - 352
BT - Mobile Ad-Hoc and Sensor Networks - 2nd International Conference, MSN 2006, Proceedings
T2 - 2nd International Conference on Mobile Ad-Hoc and Sensor Networks, MSN 2006
Y2 - 13 December 2006 through 15 December 2006
ER -