Mobile IPv6 Networks Research Articles

A communication model on implementing anycast service in mobile IPv6 networks

This paper has proposes a new kind of Anycast communication model in a mobile IPv6 network. In this model, each mobile node has only one permanent address – the home address, and when a mobile node moves to a foreign area it does not need to register itself with its home agent or build a tunnel to transfer data packets, or in route optimisation it does not need to send an address-binding message to clients. In addition, this model can perform IPSec. The experimental data in an IPv6 simulation indicate that the performance of an Anycast service acquired in this model is better than the one in the existing model.

A mobility-based load control scheme in Hierarchical Mobile IPv6 networks

By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we propose a mobility-based load control (MLC) scheme, which mitigates the burden of the MAP in fully distributed and adaptive manners. The MLC scheme combines two algorithms: a threshold-based admission control algorithm and a session-to-mobility ratio (SMR)-based replacement algorithm. The threshold-based admission control algorithm gives higher priority to ongoing mobile nodes (MNs) than new MNs, by blocking new MNs when the number of MNs being serviced by the MAP is greater than a predetermined threshold. On the other hand, the SMR-based replacement algorithm achieves efficient MAP load distribution by considering MNs' traffic and mobility patterns. We analyze the MLC scheme using the continuous time Markov chain in terms of the new MN blocking probability, ongoing MN dropping probability, and binding update cost. Also, the MAP processing latency is evaluated based on the M/G/1 queueing model. Analytical and simulation results demonstrate that the MLC scheme outperforms other schemes and thus it is a viable solution for scalable HMIPv6 networks.

Research on Home Agent Fault-Tolerant Approach for Mobile IPv6 Networks

PDF HTML阅读 XML下载 导出引用 引用提醒 移动IPv6网络家乡代理容错方法研究 DOI: 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: Supported by the National Natural Science Foundation of China under Grant No.90604014 (国家自然科学基金) Research on Home Agent Fault-Tolerant Approach for Mobile IPv6 Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:移动IPv6基于家乡代理的转发,实现节点移动过程中的可寻址性.提出主动检测和迁移的家乡代理容错方法,通过在家乡代理之间设计环状检测和备份链,使家乡代理之间相互检测失效情况的发生;所有注册信息在家乡链路上仅备份一次;检测到失效后,有效家乡代理自动地暂时接管失效家乡代理的工作,并主动通告给相关移动节点;移动节点收到家乡代理失效信息后,主动启动恢复过程.给出了实现该方法的数据结构和容错算法,描述了具体的容错处理过程.通过理论分析证明了该方法比协议标准中的方法具有更小的容错时间和信令开销,特别是在移动节点的移动频率较慢的情况下更是如此. Abstract:Mobile node (MN) is reachable based on home agent (HA) in mobile IPv6 (MIPv6). This paper proposes the active detection and transfer HA fault-tolerant method (ADTM) for MIPv6 networks. It defines the conception of ring detection & backup chain (D&B chain) among HAs in the same link. An MN only backups its registration information on the next HA in the D&B chain. For any HA, its previous HA and its next HA in the D&B chain detect the HA's validation based on neighbor discovery mechanism. If an HA is detected failure, its next HA will take over the failed HA temporarily, then inform the failure information to MNs served by the failed HA. An MN received the failure information will select a new valid and perform home registration again. For implementing ADTM, this paper defines the data structures, designs the fault-tolerant algorithm and describes the procedure in detail. It is proved that this method has less fault-tolerant time and less signal cost than the method in RFC 3775, especially in the scenario of MN moving more frequently. 参考文献 相似文献 引证文献

A secure fast handover scheme based on AAA protocol in mobile IPv6 networks

In order to reduce the cost and decrease the delay caused by combining the AAA function while guaranteeing the fast handover performance, we bring out an enhanced secure fast handover scheme. Our research focuses on improving the security and reducing the delay during the handover process of mobile IPv6, the most important thing is to minimize the authentication latency in AAA processing. According to the scheme referred above, the performance evaluation is analyzed in terms of pedestrian and vehicle, and the results of simulation show that the proposed mechanism reduces the handoff and authentication latency evidently compared to the previous simple traditional combination modeling.

Fault-tolerant design for wide-area Mobile IPv6 networks

Mobile IPv6 provides the mobility management for IPv6 protocol. To establish a reliable Mobile IPv6 network, fault tolerance should be also considered in the network design. This paper presents an efficient fault-tolerant approach for Mobile IPv6 networks. In the proposed approach, if a failure is detected in the home agent (HA) of a mobile node, a preferable survival HA is selected to continuously serve the mobile node. The preferable survival HA is the HA that does not incur failure and is neighboring the current location of the mobile node. The proposed approach is based on the preference of each mobile node to achieve the fault tolerance of the HA. Finally, we perform simulations to evaluate the performance of the proposed approach.

DoS attack in mobile IPv6 network

The principle of Mobile IPv6 (MIPv6) protocol was researched, and a summary of three main DoS attacks in MIPv6 network were given. A new solution to simulate DoS attacks in MIPv6 for the environment of NS-2 was presented. The simulation result shows that the DoS attacks cause great threats to MIPv6 network.

Simplified fast handover in mobile IPv6 networks

The Fast Handovers for Mobile IPv6 (FMIPv6) protocol provides seamless handover; it uses anticipation based on layer 2 trigger information of the mobile node (MN) to obtain a new care-of address at the new link while still connected to the previous link, thus reducing handover delay. A bidirectional tunnel is then established between access routers to minimize packet loss during the handover. However, this method incurs higher signaling costs compared with the standard Mobile IPv6 protocol. In many cases, the mobile node cannot complete the fast handover in predictive mode due to lack of time, especially with high-speed movement of the mobile node. This paper proposes an enhancement to the FMIPv6, the Simplified Fast Handover in Mobile IPv6 Networks (SFMIPv6), which significantly reduces the anticipation time of the fast handover and thereby increases the probability that the protocol can perform the fast handover in predictive mode. In this paper, we also present performance evaluations in terms of the influence of two factors, the break-down point and the velocity of the MN, using evaluation models. The numerical results prove that the network performance of the proposed protocol is effectively improved compared to the original protocols, the FMIPv6 and Fast Handover Support in Hierarchical Mobile IPv6 (F-HMIPv6). Moreover, the results show that the proposed protocol could appropriately operate with high-speed mobile node movement.

Performance Enhancement of Fast Handover for MIPv6 by Reducing Out-of-Sequence Packets

FMIPv6 can reduce packet loss using a tunnel-based handover mechanism which relies on L2 triggers, such as transmitting a packet from a previous access router (PAR) to a new access router (NAR). However, this mechanism may result in decreasing the performance of TCP due to out-of-sequence packets arriving between the tunneled packets from the Home Agent and PAR, and the directly transmitted packets from the correspondent node (CN). In this paper, we propose a new scheme called EF-MIPv6 that uses a modified snoop protocol to prevent the packet reordering problem. This new scheme can prevent sequence reordering of data packets and improve the performance of TCP using enhanced fast binding update (EF-BU). This approach requires modification of the TCP header to execute the last packet expression from the PAR, include a new polling data packet, and use the modified access point system. Simulation results demonstrate that managing the packet sequence in our proposed scheme greatly increases the overall TCP performance in a Mobile IPv6 and FMIPv6 networks.

HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안

이동 네트워크 환경에서 MN(Mobile Node)의 핸드오버 후 새로운 경로 상에 자원을 예약할 때 시그널링 지연을 최소화하기 위해서는 이전 경로와 새로운 경로가 만나는 지점에 있는 노드인 크로스오버 노드(Crossover Node:CRN)를 발견하는 것이 중요하다. 일반적으로 크로스오버 노드의 발견은 MN과 CN(Correspondent Node)간 설립된 종단간 SID(Session ID)를 주요키로 사용하여 이루어지지만, HMIPv6(Hierarchical Mobile IPv6) 네트워크에서 MAP(Mobility Anchor Point)과 HA(Home Agent)간 군집(Aggregate) 세션 단위로 자원예약을 하는 경우에는 이와 같은 일반적인 방법의 적용이 어렵다. 군집 예약을 할 때에는 종단간 SID와는 별도로 군집 SID를 사용하는데, MN의 핸드오버 후 이전 MAP과 HA간 설립된 세션의 군집 SID가 새로운 MAP과 HA간 설립된 세션의 군집 SID와 달라서 SID를 이용하여 크로스오버 노드를 발견할 수 없기 때문이다. 이에, 본 논문에서는 HMIPv6 네트워크에서 차세대 네트워크 시그널링 프로토콜인 NSIS(Next Step in Signaling)를 이용하여 자원을 예약하는 경우 군집 예약이 이루어진 MAP과 HA간 터널상에서 크로스오버 노드를 발견하고, 크로스오버 노드를 발견한 즉시, 군집 예약된 자원의 갱신이 지역적으로 이루어지도록 하는 방안을 제안한다. 시뮬레이션을 통해, 시그널링 메시지가 항상 터널의 끝 노드까지 전달되는 기존 방안에 비해 제안하는 방안이 자원 예약을 위한 시그널링 지연을 단축시키고, 핸드오버 동안의 평균 처리율을 향상시킴을 알 수 있었다. In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

FI-Based Local Group Key Generation/Distribution for Mobile Multicast in a Hierarchical Mobile IPv6 Network

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.

A pointer forwarding scheme with mobility-aware binding update in Mobile IPv6 networks

In this paper, we propose a pointer forwarding scheme with mobility-aware binding update in Hierarchical Mobile IPv6 networks. In the proposed scheme, a pointer chain between access routers is established to reduce the binding update traffic to the mobility anchor point. In addition, a mobile node (MN) performs a binding update to the correspondent node depending on its mobility. Specifically, an on-link care-of address is chosen for the MN with low mobility, whereas a regional care-of address is selected for the MN with high mobility. This mobility-aware binding update can reduce the packet delivery overhead in an adaptive manner. We develop analytical models that consider both the binding update cost and the packet delivery cost when route optimization is supported. Numerical results demonstrate that the pointer forwarding scheme with mobility-aware binding update outperforms HMIPv6 and the existing pointer forwarding scheme in different situations.

A new flow-based fast handover method for Mobile IPv6 network with route optimization

Flow-based fast handover method is designed for Mobile IPv6 network. The FFHMIPv6 uses the flow state information to redirect the traffic flow to a new location. This makes it possible that the reception of packets simultaneously with the BU registration process, thus minimizing the delay experienced in the handover. But it does not consider the route optimization. In this paper, a new flow-based fast handover method is proposed which enhanced the existing flow-based fast handover method to support route optimization. The analysis shows that this scheme has a better performance than the existing FFHMIPv6 scheme.

DMAP: integrated mobility and service management in mobile IPv6 systems

Mobile IPv6 (MIPv6) is a work in progress IETF standard for enabling mobility in IPv6 networks and is expected to have wide deployment. We investigate an integrated mobility and service management scheme based on MIPv6 with the goal to minimize the overall network signaling cost in MIPv6 systems for serving mobility and service management related operations. Our design extends IETF work-in-progress Hierarchical Mobile IPv6 (HMIPv6) with the notion of dynamic mobility anchor points (DMAPs) for each mobile node (MN) instead of static ones for all MNs. These DMAPs are access routers chosen by individual MNs to act as a regional router to reduce the signaling overhead for intra-regional movements. The DMAP domain size, i.e., the number of subnets covered by a DMAP, is based on the MN’s mobility and service characteristics. Under our DMAP protocol, a MN interacts with its home agent and application servers as in the MIPv6 protocol, but optimally determines when and where to launch a DMAP to minimize the network cost in serving the user’s mobility and service management operations. We demonstrate that our DMAP protocol for integrated mobility and service management yields significantly improved performance over basic MIPv6 and HMIPv6.

Seamless handover support over heterogeneous networks using FMIPv6 with definitive L2 triggers

Various wireless communication systems have been developed and will be integrated into an IP-based network to offer end users the Internet access anytime and anywhere. In heterogeneous multi-access networks, one of main issues is to manage nodes' mobility with session continuity and minimal handover latency. In order to support the mobility of mobile nodes, MIPv6 has been proposed by IETF. Even though MIPv6 provides a solution to handling nodes' mobility in IPv6 networks, there is a significant problem due to its inability to support a seamless handover caused by long latency and high packet losses during a handover. FMIPv6 has been proposed to reduce MIPv6 handover latency by using an address pre- configuration method with the aid of L2 triggers. Current research defines a general L2 trigger model for seamless handover operation, but it does not address the exact timing and definitive criteria of L2 triggers which causes a significant effect on the handover performance of FMIPv6. This paper considers the available timing and accurate criteria of L2 triggers. With the definitive L2 triggers, we present a practical handover scenario to integrate L2 and L3 layers for low handover latency and low number of packet losses during a handover. We also study the impact of definitive L2 triggers on the handover performance of the FMIPv6 protocol in real testbeds and prove that the FMIPv6 protocol performs its handover operation prior to the L2 handover and obtains a seamless handover.

A three-level mobility management scheme for hierarchical mobile IPv6 networks

Performance evaluation shows that Hierarchical Mobile IPv6 (HMIPv6) cannot outperform standard Mobile IPv6 (MIPv6) in all scenarios. Thus, adaptive protocol selection under certain circumstances is desired. Moreover, it is necessary to balance the load among different Mobility Anchor Points (MAPs). This paper proposes an efficient three-level hierarchical architecture for mobility management in HMIPv6 networks, in which a mobile node (MN) may register with either a higher/lower MAP or its home agent according to its speed and the number of connecting correspondent nodes (CNs). An admission control algorithm and a replacement algorithm are introduced to achieve load balancing between two MAP levels and among different MAPs within the same MAP level. Admission control is based on the number of CNs but not MNs that an MAP serves. In case there is no capacity for an MN, the MAP chooses an existing MN to be replaced. The replaced MN uses the MAP selection algorithm again to choose another mobility agent. Simulation results showed that the proposed scheme achieves better performance not only in reducing the signaling overhead, but also in load balancing among different MAPs.

Proactive DAD: A Fast Address-Acquisition Strategy for Mobile IPv6 Networks

The increasing number of Wi-Fi-compatible mobile devices highlights various wireless access challenges, including the need for smooth hand offs between Internet attachment points in mobile IPv6 networks. To confirm address uniqueness in a new domain, mobile nodes must run duplicate address detection (DAD), which is a time-consuming process. The Proactive DAD approach uses topology information and layer-2 signals to predict the new network domains prior to or in parallel with layer-3 hand offs. Experimental results show that P-DAD can significantly reduce both hand-off latency and packet loss

A performance comparison of mobility anchor point selection schemes in Hierarchical Mobile IPv6 networks

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 choose four MAP selection schemes: the furthest MAP selection scheme, the nearest MAP selection scheme, the mobility-based MAP selection scheme, and the adaptive MAP selection scheme. Then, we compare their performances quantitatively in terms of signaling overhead and load balancing. It can be shown that the dynamic schemes (i.e., the mobility-based and the adaptive MAP selection schemes) are better than the static schemes (i.e., the furthest and the nearest MAP selection schemes), since the dynamic schemes can select the serving MAP depending on the MN's characteristics, e.g., mobility and session activity. In addition, the adaptive MAP selection scheme achieves low implementation overhead and better load balancing compared with the mobility-based MAP selection scheme.

A hierarchical multicast protocol in mobile IPv6 networks

In this paper, we propose a hierarchical multicast protocol in Mobile IPv6 networks (HMoM), which utilizes the advantages of hierarchical mobility management in handling unicast routing. The multicast agent is selected dynamically and can be located at any level in a hierarchical network of routers according to the handoff frequency of mobile hosts (MHs). Thus, it can offer the most efficient routing for the MHs that reside at a network for a relatively long period of time, and avoid frequent tree reconstruction for the MHs that perform handoff quickly. Actually, we find that remote subscription, bidirectional tunneling, which proposed by the IETF Mobile IP, and unicast mechanism are the special cases of hierarchical mobile multicast. In addition, we propose a smooth multicast agent handoff mechanism to reduce the disruption of multicast services due to host mobility. A detailed performance evaluation has been done and simulation results show that HMoM has better performance than existing protocols.

A fast seamless handover scheme and its CDT optimization for ping-pong type of movement

In mobile IPv6 networks, the ping-pong type of movement brings about frequent handovers and thus increases signaling burden. This letter proposes a fast seamless handover scheme where the access router keeps the mobile node’s old reservation till the offline Count Down Timer (CDT) expires in order to reduce handover signaling and delay while the mobile node returns in a very short period of time. Based upon a poisson mobility model, an simple expression for CDT optimization is given out for the scheme to achieve the best cost performance of resource reservation.

An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.