Fast Handover Solution Using Multi-tunnel in HMIPv6 (FM-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) 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.

An enhanced fast handover with seamless mobility support for next-generation wireless networks

To maintain the Internet connectivity of a group of nodes in intelligent transportation systems (ITSs), the network mobility basic support (NEMO BS) protocol was standardized. The NEMO BS provides mobility for mobile network nodes (MNNs) in a moving network through a mobile router (MR). Since packet loss in NEMO dramatically increases during a handover as the number of MNNs increases, Mobile IPv6 fast handovers (FMIPv6) was adopted to reduce packet loss and handover latency. However, since FMIPv6 was originally designed for a single mobile node (MN), FMIPv6 based on NEMO (fNEMO) incurs a high tunneling burden on the link between the previous and new access routers (PAR and NAR, respectively). In this paper, we propose an enhanced fNEMO (EfNEMO) as an efficient fast handover scheme that significantly mitigates the tunneling burden and handover latency. In particular, EfNEMO performs a tentative binding update (BU) procedure to register a new care-of address (NCoA) for the MR with the MR's home agent (HA) before the layer-2 handover. Consequently, EfNEMO delivers packets destined for MNNs via various paths between the HA and the NAR without any tunneling. Furthermore, EfNEMO reduces handover latency because it performs the registration to the HA in advance. By establishing an analytical model for the proposed EfNEMO, we investigate the handover performance of NEMO, fNEMO, and EfNEMO. In addition, we compare EfNEMO with NEMO and fNEMO in terms of the overall cost and the handover latency. Simulation is also performed to compare in a more realistic environment. The results of analysis and simulation show that EfNEMO significantly outperforms fNEMO and NEMO.

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

The handover technology is one of the most important technologies for the quality of real-time operation. In Hierarchical Mobile IPv6 (HMIPv6), duplicate address detection (DAD) process is necessary for confirming uniqueness of IPv6 address when Mobile Node moves to a new network. It is desirable to reduce DAD delay especially if nodes wish to run real-time application on the mobile IPv6 networks. In this paper, an enhance handover scheme in hierarchical MIPv6 networks by utilizing Passive Duplicate Address Detection (PDAD) to identify duplicate addresses is proposed. Using PDAD, a node examines incoming routing protocol packets to develop hints about address controversies. The simulations are performed using NS-2 to compare the handoff performance. The results show that the proposed scheme can get better performance in terms of packet loss and handoff delay

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.

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 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.

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.

With the functionalities of obtaining new care-of-address (CoA) ahead and building tunnels for packet forwarding during handover, the fast handover scheme has better performance than Mobile IPv6. However, the handover performance is downgraded if mobile node (MN) cannot finish the handover preparation before the associated link is broken. In this paper, we propose an optimistic ready-tunneling (ORT) control scheme to resolve the aforementioned problems. In the proposed ORT scheme, new access router (NAR) can prepare for a new CoA and builds a tunnel for MN ahead when MN enters the domain of NAR. As a result, MN can switch to the new network domain smoothly because of early CoA acquisition and tunnel establishment during handover.

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.

The miniaturization of the computing machinery increases needs for using mobile computing of users. In this situation, Mobile IPv6 Working Group of Internet Engineering Task Force (IETF) suggests IPSec for Mobile IPv6 security. IPSec, however, has a long latency problem of dynamic security authentication due to the key management and a large amount of calculation. We therefore apply AAA in Mobile IPv6 to solve a dynamic security authentication problem of IPSec and simultaneously use Fast Handover technique for quick mobility. And we propose a method for reducing a long latency caused by authentication of mobile node (MN) during a handover. Old and new access routers authenticated by a hash value of an MN are able to reuse existing Security Authentication (SA) for a certain time and reduce latency for new SA. As a consequence, a mobile node can provide the real time services due to the reduction of authentication latency. Also, we can trust the buffered information through the tunnel between two access routers.

Network Mobility (NEMO), derived from Mobile Internet Protocol version 6 (MIPv6) technology, has been evolving and expanding in very rapidity manner across very short period of time. In MIPv6 technology, the Access Router (AR) plays important roles such as provide sessions connectivity and safe-guarding communications protocol. Whereas in NEMO, the routers in the communication chains are essentially the moving targets and hence the Mobile Router (MR). The MR too, inherits the basic functionalities of AR. In the basic MIPv6 and NEMO modus operandi, when the Mobile Network Notes (MNN) roamed away from home link and attached to some other foreign link, the MNNs are also addressable via a secondary address named as Care-of Address (CoA). The MNN essentially registered its primary CoA to the router on its own home link and thus registering the router to be its Home Agent (HA). These communication sets, and the ingredients of the communication will be managed via Binding Updates (BU) and the Binding Acknowledgement (BAck). Since the NEMO is using MIPv6 as the backbone, NEMO also inevitably inherits many design difficulties and problems that the MIPv6 seen. Such as using the Internet Protocol Security (IPSec) with end-to-end tunneling and using nonce value within the BU to serve as part of the authentication process and many more. In this paper, we illustrate the scenario of authentication problems involving NEMO movements and the flaw in security design. With the aim of succeeding IPSec we then propose a much better solution which is the use of Random Number, coupled with PKI concept.