Performance Analysis of the Mobility Anchor Point in Hierarchical Mobile IPv6

Mobility management is a key issue to achieve uninterrupted Internet services in IP based network. In IPv6, the mobility management is realized by its mobile version namely the Mobile IPv6 (MIPv6). The MIPv6 is further extended to Hierarchical MIPv6 (HMIPv6) to reduce handoff latency suffered by mobile nodes and signaling load incurred due to movement if nodes within the micro mobility region defined by HMIPv6. The HMIPv6 is considered as first widely accepted layered architecture for mobility management for IPv6 network. Influenced by the benefits of HMIPv6, many researchers have suggested extension of MIPv6 into multiple layers. However, there is very little work on finding optimal levels of hierarchy in such layered architecture. The focus of this paper is to evaluate the performance of a multilayer (N-layered with N as 5) MIPv6 architecture through experimental testbed. We have observed handoff latency, signaling overhead and tunneling cost and figured out the optimal levels of hierarchy that provides the best acceptable results for all the observed parameters. Since, HMIPv6 outperforms MIPv6 in terms of handoff latency and signaling cost, so we compare our results with HMIPv6. Testbed observation depicts that three levels of hierarchy in MIPv6 architecture provides optimal performance with 27 % reduction in handoff latency and 67 % reduction in signaling overhead compared to single layer architecture like Hierarchical MIPv6 (HMIPv6) protocol.

Proxy mobile Internet protocol version 6 (PMIPv6) is a network-based mobility management protocol proposed by Internet Engineering Task Force (IETF), which allows nodes to remain service connectivity while moving around in the IPv6 Internet. PMIPv6 is different from the host-based mobility management protocols (mobile Internet protocol version (MIPv6), hierarchical mobile IPv6 (HMIPv6), fast handover for mobile IPv6 (FMIPv6), and fast handover in hierarchical mobile IPv6 (F-HMIPv6)), whose signaling are transferred among some network entities except mobile node (MN). This paper focuses on the analytical modeling of performance analysis for PMIPv6 and other protocols using IEEE802.16-based wireless metropolitan area networks as the wireless access network. The performances of these protocols are evaluated by some metrics like handover latency, service disruption time, and binding update cost. Numerical results show that PMIPv6 has better performance.

Hierarchical Mobile IPv6 (HMIPv6) has been proposed by the Internet Engineering Task Force (IETF) to reduce handoff latency and signaling overhead. In the new protocol, Mobility Anchor Point (MAP) receives all packets in place of Mobile Node (MN) and MAP services are transferred to Care of Address (CoA) of MN. However, a MAP may be a single point of performance bottleneck because the MAP should not only handle signaling traffic but also process data tunneling traffic for all MNs registered in a MAP domain. So, MAPs need MAP management scheme for the multimedia services or real time services. We propose a MAP selection scheme that can select different MAPs according to the traffic characteristics of MNs and a multilevel queue processing method that can process binding updates based on the priorities of queues in a MAP when MNs send BU. Quantitative results of the performance analysis show that our proposal can reduce the location update cost by 31% and the total cost by 14%. With the multilevel queues, we could reduce the total cost by 12% and 17% for D=4 and D=8 respectively.

Hierarchical Mobile IPv6 (HMIPv6) guarantees to reduce handoff latency, because the MN only registers the new addresses at mobility anchor point (MAP) when the MN moves around access routers (ARs) in the same MAP domain. HMIPv6 still has packet loss problem when the MN moves from one MAP to another. In this paper, a novel location update scheme which further reduces signaling traffic for location update by employing virtual MAP (VMAP) on top of overlapped MAP in HMIPv6, is proposed. This proposed scheme significantly improves performance compared to HMIPv6, in terms of location update rate per user. Also it makes the mobile nodes (MNs) moving around the boundary ARs of adjacent MAP's become to move within a VMAP. It is certain that this scheme reduce the network resources efficiently by reason of removing the location update. In conclusion, this scheme greatly reduces the packet loss and delay, due to Inter-MAP handoff not occurring.

In this paper, a new approach is proposed to reduce handoff operation in IEEE 802.16e network. Traditional mobile approaches, such as mobile IPv6 (MIPv6) and hierarchical MIPv6 (HMIPv6), can support smoothly handoff. These approach, ,unfortunately, suffer large handoff delay and packet lost in macro mobility for mobile users. With the aid of the partner node, DAD operation can be pre-executed by the partner node before the mobile node initialize the handoff request, we propose a cross-layer partner based fast handoff mechanism based on HMIPv6 in IEEE 802.16e network, called as P_HMIPv6 protocol. The P_HMIPv6 protocol is a cross-layer, layer 2 and layer 3, approach. The partner station (PS), which is a new component with relay ability and adopted by our protocol, is a static mobile station (MS). With the aid of the PSs, care-of address (CoA) can be pre-acquired and DAD operation can be pre-executed by the PS before the MS initials the layer 2 handoff. The simulation results show that P_HMIPv6 protocol actually achieves the performance improvements in the handoff delay time and the packet loss.

Hierarchical mobile IPv6 (HMIPv6) is an enhanced mobile IPv6 in order to reduce signaling overhead and to support seamless handoff in IP-based wireless/mobile networks. To support more scalable services, HMIPv6 can be organized as a multilevel hierarchy architecture (i.e, tree structure). However, since the multi-level HMIPv6 results in additional packet processing overhead, it is necessary to consider the overall cost and to find the optimal level to minimize the overall cost. In this paper, we investigate this problem, namely the design of a multi-level HMIPv6 with optimal hierarchy. To do this, we formulate the location update cost and the packet delivery cost in the multi-level HMIPv6. Based on the formulated cost functions, we present the optimal hierarchy level in the multi-level HMIPv6 to minimize the total cost. In addition, we investigate the effects of session-to-mobility ratio (SMR) on the total cost and the optimal hierarchy. The numerical results, which show various relationships among network size, optimal hierarchy, and SMR, can be utilized to design an optimal HMIPv6 network.

Mobile IPv6 (MIPv6) and its variants provide mobility support to the mobile nodes within an IP network. Hierarchical MIPv6 (HMIPv6) is an improvement on legacy MIPv6 which uses layered approach to provide low cost signaling in the environments where handovers take place frequently. Because HMIPv6 is a host-assisted handover mechanism, the wireless link of the mobile node acts as a serious bottleneck on its performance. This paper seeks to use the newly developed notion of software-defined networks (SDN) to modify HMIPv6. The idea is to use the SDN concepts during the handover process to minimize the involvement of the mobile node.

The mobility support protocols are separated by two categories, such as host-based mobility support protocols and network-based mobility support protocols. Mobile IPv6, Fast Handover for Mobile IPv6, and Hierarchical Mobile IPv6 are the type of host-based mobility support protocol and Proxy Mobile IPv6 is the type of network-based mobility support protocol. In the mean while, different network domains that support individual mobility support protocols need a way to interact between each other. In this paper, we focus on the interaction between Mobile IPv6 and Proxy Mobile IPv6. We propose the Hybrid Proxy Mobile IPv6 Indication mechanism that helps to indicate the type of protocol selected by the network or the mobile node. We devise several interaction scenarios and then present performance evaluation results based on the devised scenarios.

Fast handover protocol provides seamless handover in mobile IPv6 networks by reducing handover latency. One assumption in fast handover is that the MN (Mobile Node) or the network could know or predict the new AR (Access Router) before data transport from the previous AR to the MN is disrupted. In order to achieve this capability, the complexity of predicting the new AR and the diversity of the wireless link technologies should be considered. While it is difficult to know or predict the new AR exactly, a better solution is required to find a reasonable set of candidate ARs (i.e., neighbor ARs) that are likely to be the new AR after a handover. This paper introduces a solution to support a fast handover mechanism using multi-tunnels between MAP (Mobility Anchor Point) and neighbor ARs in HMIPv6 (Hierarchical Mobile IPv6) network. It includes the concepts of Proxy Mobile IP for creation of CoA (Care of Address) and DAD (Duplicate Address Detection). In this protocol, the MN can handover without receiving any information about the new AR and this eliminates difficulties to know or predict exactly the new AR which is not specified in standard fast handover scheme. It decouples layer-2 and layer-3 handover and efficiently reduces handover latency through the minimized number of wireless signaling messages and pre-DAD. It also saves periods of service disruption and prevents packet loss in the case of ping-pong movement of the high-speed MN. The performance of the proposed mechanism is evaluated by simulations under variable conditions.

Hierarchical Mobile IPv6 (HMIPv6) introduces a mobility anchor point (MAP) that localizes the signaling traffic and hence reduces the handoff latency. In addition to processing binding update messages from mobile nodes (MNs) on behalf of MNs' home agents (HAs), the MAP performs data traffic tunneling destined to or originated from MNs, both of which will burden the MAP substantially as the network size grows. To provide scalable and robust mobile Internet services to a large number of visiting MNs, multiple MAPs will be deployed. In such an environment, how to select an appropriate MAP has a vital effect on the overall network performance. In this paper, we propose the multiple level MAP selection scheme in the form of binary tree structure. Then, we give the optimal threshold value calculation formula, which is used to select the MAP for MN. We compare its performance quantitatively in terms of signaling overhead. It can be shown that the multiple level MAP selection scheme is better than the furthest and the nearest MAP selection schemes in some area, since the this scheme can select the serving MAP depending on the MN's mobility.

Though some studies involving general micro-mobility exist, micro-mobility research concerning a mobile node (MN) moving between Mobile Anchor Points (MAP) is lacking. In Hierarchical Mobile IPv6 (HMIPv6), a MN sends a binding update (BU) message to a MAP when the MN performs a handoff. This scheme reduces the handoffs and BUs performance costs. However, the total signaling cost of HMIPv6 rapidly increases with the number of corresponding nodes (CN) for a MN moving among MAPs. In this paper, we propose a scheme based on logical topology with autonomous configuration allowing a MN to move around between MAPs without performing a BU. We perform the performance evaluation for packet delivery and location update costs through a novel analytic approach. We show that the proposed scheme is approximately two times better than the existing one in terms of the total signaling costs through performance analysis. Furthermore, our scheme also reduces the location management cost effectively.

Data collection is a fundamental and important issue in wireless sensor networks. Recent research has shown that using mobile nodes to collect and carry data in WSNs has many advantages over static multi-hop routing. In this paper, we focus on the problem of reducing the number of mobile nodes require by data collection in WSNs. Each mobile node visits the sensor nodes, that assigned to it, every t seconds to pick up the cached data. The data gathered by mobile nodes far away from the base station are transferred to the base station through mobile nodes closer to the base station. We formally prove that the problem of data collection in WSNs with the minimum mobile nodes is NP hard. In order to reduce the number of mobile nodes, We propose two algorithms. One tries to reduce the number of mobile nodes and optimize their travel paths, and the other one carefully schedules the movement of all mobile nodes to make sure that they can cooperate with each other to transfer all gathered data to the base station. Our simulation results show that our approach can notably reduce the number of required mobile nodes as much as 46%.

As the number of mobile users is increasing day by day, we need to pay attention to support mobility and its management. Mobile IP is used to maintain mobility information when a mobile user moves from one location to the other while its permanent address remains unchanged. Mobile IPv6 (MIPv6) is introduced to overcome the problems of MIPv4 and bring improvements in the performance of the protocol. MIPv6 performs well for micro-mobility but suffers for macro-mobility. Hierarchical Mobile IPv6 (HMIPv6) is developed to separate micro-mobility and macro-mobility. But HMIPv6 could not out-perform for macro-mobility when a mobile node moves from one MAP domain to the other. Many schemes are proposed to reduce handover latency and bring efficiency for macro-mobility, but still this problem affects the performance of HMIPv6. In this paper, we carry out a survey of different binding update schemes for inter-domain mobility management in HMIPv6. At the end, a detailed comparison is given for all the discussed schemes.

Performance analysis of Virtual Mobility Domain scheme vs. IPv6 mobility protocols

This paper proposes a low-cost global mobility management architecture and protocol procedure called LC-GM2, which is based on Proxy Mobile IPv6 (PMIPv6) networks. The benefit is the elimination of the wireless link data delivery tunnel overhead between a mobile node and the access router. To compare with the well-known Hierarchical Mobile IPv6 (HMIPv6) mobility management protocol and Global Mobility Management Architecture and Protocol Procedure (GPMIP), the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time are formulated for each protocol based on Fluid-flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed. The analytical results show that the proposed global mobility management protocol can guarantee the lowest total costs.