Adaptive selection of MIPv6 and hierarchical MIPv6 for minimizing signaling cost

Abstract

Internet engineering task force(IETF) has proposed hierarchical mobile IPv6(HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6(MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point the processing cost of packet at the MAP is influenced both by the packet arrival rate for a mobile node and the number of mobile nodes in MAP domain. In this paper, we propose that MIPv6 and HMIPv6 are adaptively selected in order to minimize signaling cost of network as complementing weak points of MIPv6 and HMIPv6. After supposing by the packet arrival rate for a mobile node is fixed, with this in mind, we find the optimal number of mobile nodes compared the total cost of HMIPv6 with the total cost of MIPv6. Also, if mobile nodes that the MAP is able to manage are full in MAP domain, then a mobile node entering into the MAP domain is provided connection by MIPv6 instead of HMIPv6. In the conclusion, the proposed method of this paper shows that the weak points of MIPv6 and HMIPv6 are removed by adaptive selection each other.