Diffserv Conditionalized Handover for HMIPv6

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

As the number of Mobile IP users is expected to grow, the signaling overhead associated with mobility management in the mobile Internet is bound to grow. And since the wireless link has far less bandwidth resources and limited scalability compared to the wired network link, the signaling overhead associated with mobility management has a severe effect on the wireless link. In this paper, we propose IP-Grouping scheme. In the proposed scheme, Access Routers (ARs) with a large number of handoff are grouped into a Group Zone. The signaling cost in the wireless link can be greatly reduced as the current Care-of Address (CoA) of Mobile Node (MNs) is not changed whenever the handoffs occur between ARs within the same Group Zone. The performance of the proposed scheme is compared with the Hierarchical Mobile IPv6 (HMIPv6). We present the analysis and simulation results for IP-Grouping and HMIPv6, and show that IP-Grouping reduces the wireless signaling overhead under various system conditions and supports the mobility of a large number of MNs.

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.

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.

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

In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ad hoc</i> networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.

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 by the packet arrival rate for a mobile node, cell mobility rate and the number of mobile nodes in MAP domain. In this paper, we analyze the MAP's performance considering the above elements. For this, we compare total cost of HMIPv6 with total cost of MIPv6 as MAP's capability after we define Markov chain model for performance analysis. Also, we define network's total profit as total cost of MIPv6 minus total cost of HMIPv6. Then, we can find optimal capability of MAP such that total profit has maximum value. Also, we use the blocking probability by the MAP's capability as performance estimation element. As a conclusion, we can-observe both HMIPv6's performance by the MAP's capability and optimal capability of the MAP, and blocking probability form a relationship of trade off between them.

To improve the local mobility performance of a wireless network, we present a new framework, namely Efficient Framework for Local Mobility (EFLoM). In EFLoM, we introduce three entities: Local Anchor Router (LAR), Wireless Access Gateway (WAG) and Mobile Node (MN). LAR is a router that is in charge of MN's IP mobility management. It keeps track of MN's movement, and delivers the MN's packets to its current location. AWAG is an access router that is responsible for managing the traffic flows within the same local mobility domain. In EFLoM, when Corresponding Node (CN) and MN connect to the same local mobility domain, packets are sent directly between CN and MN by WAG, without suffering sub-optimal routing problems. A MN is a mobile host which updates its data packets' header with its current location address before packets are sent out. To evaluate our new framework, we compare EFLoM with Hierarchical Mobile IPv6 Mobility Management (HMIPv6) [4] which is an existing protocol that has good performance for local mobility. Both analytical analysis and simulation result show that EFLoM can attain substantial improvements over HMIPv6 in terms of handover delay, end to end delay, traffic overhead, which therefore presents EFLoM as a new engineering alternative to existing MIPv6 based techniques.

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

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.

Real-time service provisioning for mobile and wireless networks

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