Improved Location Management Scheme Based on Autoconfigured Logical Topology in HMIPv6

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.

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.

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) offers a home agent (HA) route and a route that allows direction communication between the mobile node (MN) and the correspondent node (CN). However, such a direction route is not necessarily desirable because of the possible leakage of the location information relating to the mobile node (MN) and the possible high occurrence of handovers. Therefore, a method of route selection based on the communication conditions of the network is required. This paper proposes a route selection method suitable for the HMIPv6 architecture, in which a route is selected on the basis of a measurement of the packet delay in each possible route. The packet delay used is the round trip time (RTT). This is measured using ping, which is independent of route attributes. This paper also proposes a packet delay estimation algorithm that considers both user movements within the mobility anchor point (MAP) area and those to outside the MAP area. The effectiveness of the algorithm was confirmed through simple experiments with respect to the measurement parts, and mathematical analysis of the processing load of packet delay measurement on the HA

Efficient mobility management involves micro-mobility principles. The performance of a representative micro-mobility approach, hierarchical mobile IPv6 (HMIPv6) protocol, is affected by the manner of mobility anchor point (MAP) selection. In this paper, we propose a new method, based on prediction of the future movement of mobile nodes (MNs). Exploiting the information about the future availability of MAPs, the proposed algorithms choose those MAPs that assure a better service. By means of simulations, we compare the proposed solution to other algorithms. The results show promising improvement in terms of average distance from chosen MAPs and average number of MAP changes. Moreover, we showed that, for perceivable improvement of MAP selection, absolute accuracy of movement prediction is not required.

The current deployment of wireless mesh networks requires mobility management to track the current locations of mobile nodes around the network without service interruption. To do so, the Hierarchical Mobile IPv6 protocol has been chosen, which minimises the required signalling by introducing a new entity called the mobile anchor point to act as a local home agent for all visiting mobile nodes in a specific domain. It allows a mobile node to register its local/regional care-of addresses with a mobile anchor point by sending a local binding update message. However, the local binding update is quite sensitive; it modifies the routing to enable mobility in the wireless mesh networks. When a local binding update message is spoofed, an attacker can redirect traffic that is destined for legitimate mobile node either to itself or to another node. This situation leads to an increased risk of attacks. Therefore, this paper contributes to addressing this security issue based on wireless mesh networks by cryptography generation and verification of a mobile node’s local and regional care-of addresses, as well as the application of a novel method to verify the reachability of mobile node at claimed local care-of address. This is called the enhanced mobile anchor point registration protocol. The Scyther tool has been used to ensure the proposed protocol accuracy. Furthermore, the performance, in terms of the mobile anchor point registration delay and signalling overhead, is evaluated by using the OPNET modeller simulator.

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.

In the mobile Internet, a handover brings significant performance degradation of TCP due to bursty packet losses during handover processing. In this paper, we propose a new bandwidth control for improving the TCP performance. In the proposed system, when a mobile node changes its accessing base station, an intermediate router suppresses an available bandwidth to the corresponding TCP flow. Because suppressing the bandwidth results in reducing mis-forwarded packets to the old base station, the bursty packet losses can be avoided. In the hierarchical mobile network structure, which is recently developed in order to realize micro-mobility protocol, all packets transferred to mobile nodes are converged to several gateways such as mobility anchor points (MAP) in hierarchical Mobile IPv6 (HMIPv6). Therefore, the proposed system is suited to the hierarchical structure because it can be easily implemented at such gateways. Computer simulation results show that the proposed system can improve the TCP performance degradation especially in a situation where handovers frequently occur.

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.

The route optimization operation in Mobile IP Version 6 (MIPv6) allows direct routing from any correspondent node to any mobile node and thus eliminates the problem of "triangle routing" present in the base Mobile IP Version 4 (MIPv4) protocol. Route optimization, however, requires that a mobile node constantly inform its correspondent nodes about its new care-of addresses by sending them binding update messages. Unauthenticated or malicious binding updates open the door for intruders to perform redirect attacks, i.e., malicious acts which redirect traffic from correspondent nodes to locations chosen by intruders. How to protect binding update messages to defend against redirect attacks is a challenging problem given the open environment in which MIPv6 operates. In this paper, we first look at two solutions proposed by the IETF Mobile IP Working Group and point out their weaknesses. We then present a new protocol for securing binding update messages. We also show that our protocol achieves strong security and at the same time is highly scalable to wide spread deployment.

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.

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.

We present a new method to improve the bandwidth of HMIPv6 networks called HMIPv6-BI. This approach proposes a modification to the Hierarchical Mobile IPv6 protocol. The goal of HMIPv6-BI is to minimize the Bandwidth usage of the Radio Link between the Access Router (AR) and the Mobile Node (MN). Currently, in HMIPv6 a tunnel is established between the Mobility Anchor Point (MAP) and the MN. By contrast, the principle used by HMIPv6-BI is to move the Tunnel End Point until the AR. In consequence, this method decreases the number of bytes traveling over the wireless interface due to the absence of the tunnel headers required in the original approach. Furthermore, HMIPv6-BI allows the usage of Multicast Tunnel (this approach is named TMCast+HMIPv6-BI) in order to reduce the Handover Latency. Finally, modeling and simulation results indicate that HMIPv6-BI provides better performance as compared to the standard approach.

This paper proposes a new mechanism of multiple home agents to realize a stable connection in Mobile IPv6. The new mechanism has multiple home agents instead of only one home agent in the existing specification of Mobile IPv6. In the existing Mobile IPv6 protocol, it takes time to find a new home agent and make it work. A mobile node cannot find that the home agent is down until the mobile node needs to register or update the binding information at the home agent. When a home agent is down and a mobile node is away from home and on a foreign link, the mobile node cannot receive any packets from a newly joining correspondent node. The new mechanism provides multiple home agents with a new binding update message and a new ICMP home agent unreachable error message. The new binding update procedure realizes a fast home agent recovery. This paper describes the result of an experiment which shows how a mobile node works with multiple home agents. We also compare the fast home agent recovery process with existing methods.

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.