Standard Mobile IPv6 Research Articles

Moving Target Defense for Securing SCADA Communications

In this paper, we introduce a framework for building a secure and private peer to peer communication used in supervisory control and data acquisition networks with a novel Mobile IPv6-based moving target defense strategy. Our approach aids in combating remote cyber-attacks against peer hosts by thwarting any potential attacks at their reconnaissance stage. The IP address of each host is randomly changed at a certain interval creating a moving target to make it difficult for an attacker to find the host. At the same time, the peer host is updated through the use of the binding update procedure (standard Mobile IPv6 protocol). Compared with existing results that can incur significant packet-loss during address rotations, the proposed solution is loss-less. Improving privacy and anonymity for communicating hosts by removing permanent IP addresses from all packets is also one of the major contributions of this paper. Another contribution is preventing black hole attacks and bandwidth depletion DDoS attacks through the use of extra paths between the peer hosts. Recovering the communication after rebooting a host is also a new contribution of this paper. Lab-based simulation results are presented to demonstrate the performance of the method in action, including its overheads. The testbed experiments show zero packet-loss rate during handoff delay.

Scalable Anti-Censorship Framework Using Moving Target Defense for Web Servers

Although the Internet has become a hub around which every aspect of our lives—from commerce to leisurely activities—is centered, many around the world are not able to freely access information over the Internet. Some governments censor what the people can and cannot see. In this paper, regardless of the socio-political view points, we focus on the design of anti-censorship technology that can be implemented on the side of the information purveyors. The primary objective is to develop a framework for combating censorship. Our approach aims to make it too expensive and impractical for the adversary to censor Web sites. In particular, we propose the use of Mobile IPv6 to form a moving target defense strategy, where the Web servers logically behave as if they are the mobile nodes (without actually moving). The potential efficacy of this framework is modeled analytically. Probabilistic models are used to derive important metrics and parameters. One key factor termed swarming ratio enables hosting sites to reason about the amount of resources needed to force the adversary’s costs over practical limits. This model is used to guide the performance goals and architectural setup of the prototype implementation (modifications are made on the server-side software and Kernel without changing the standard Mobile IPv6 protocol). Hence, the solution can be utilized without any changes to the existing network infrastructure. Furthermore, we introduce a novel, credit-based accounting strategy for grouping of users to drastically shift resource requirements in our favor. Lab-based tests are used to measure performance overheads, and based on the findings, targeted optimizations are performed to consider practical deployment scenarios. The end result is a solution that may also be combined with existing anti-censorship methods (that are end-user-based and/or assisted by friendly network assets) to form a robust anti-censorship solution.

A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO).

QoS-guaranteed IP mobility management for fast-moving vehicles with multiple network interfaces

In this study, the authors present a quality-of-service (QoS)-guaranteed IP mobility management scheme for fast-moving vehicles with multiple wireless network interfaces. The idea of the proposed mechanism consists of two things. One is that new wireless connections are established to available wireless channels whenever the measured data rate at the mobile node drops below to the required data rate of the user requirement. The other is that parallel distribution packet tunnels between an access router and the mobile node are dynamically constructed using multiple wireless network interfaces in order to guarantee the required data rate during the mobile node's movement. By doing these methods, the required data rate of the mobile node can be preserved while eliminating the possible delay and packet loss during handover operation, thus resulting in the guaranteed QoS. The architecture of the Internet engineering task force standard hierarachical mobile IPv6 (HMIPv6) has been extended to realise the proposed scheme, and detailed algorithms for the extension of HMIPv6 has been designed. Finally, simulation has been done for performance evaluation, and the simulation results show that the proposed mechanism demonstrates guaranteed QoS during the handover with regard to the handover delay, packet loss and throughput.

Enhanced Multimedia IPTV Packet Transmission over IPv6 Based Wireless Network

This paper proposes a solution for solving packet loss and out-of-sequence problems in standard Hierarchical MIPv6. These days, the need for Mobile IPTV on Wireless devices which provide IPTV is rapidly increasing. Due to the development of Internet-based IPTV and wireless devices using an increased Mobile network, which uses mobile devices, handovers during movement are bound to be inevitable. Standard MIPv6 (Mobile IPv6) in the event of a handover needs more time to process which will lead to problems, such as packet loss and the out-of-sequence problems. For these reasons, providing wireless services is more difficult than providing wired services. To solve these problems, many protocols have been developed, but a lot of challenges still remain to be solved. We proposed a scheme to solve the packet loss and packet out-of-sequence problems and it also focused on providing better services for Mobile IPTV. We used HMIPv6 (Hierarchical Mobile IPv6) for improvement of handover procedures.

Performance Evaluation of Fast Handover in Mobile IPv6 Based on Link-Layer Information

Handover latency is the primary cause of packet loss resulting in performance degradation of standard Mobile IPv6. Mobile IPv6 with fast Handover enables a Mobile Node (MN) to quickly detect at the IP layer that it has moved to a new subnet by receiving link-related information from the link-layer; furthermore it gathers anticipative information about the new Access Point (AP) and the associated subnet prefix when the MN is still connected to the previous Corresponding Node (CN). This paper proposes an enhancement to Fast Mobile IPv6 handover (FMIPv6), based on link layer information, we also present performance evaluations in terms of the packet loss and handover latency using evaluation models.

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.

IEEE 802.16e 기반에서의 Improved Fast Handover Protocol using HMIPV6

와이브로 서비스가 공식적으로 서비스됨에 따라서 이동 노드가 차량 속도로 이동시 실질적인 리얼 타임 서비스가 가능한지에 대한 사항이 고려되어야 한다. 표준문서 RFC 4140인 Hierarchical Mobile IPv6 mobility management에서 다루고 있는 Fast Handover에 대한 것은 이동노드가 같은 도메인 MAP 내에서만 이동했을 경우에 대해 다루고 있고 MAP을 넘어가는 경우에 대해서는 다루고 있지 않다. 그래서 MAP간의 이동시 생기는 핸드오버 지연을 줄이기 위해 Macro Mobility Handover in HMIPv6[7]가 제안되었다. 그러나 이 방안 역시 끊김없는 서비스를 제공하는 데에는 부족함이 있다. 그래서 전체적인 핸드오버 지연을 줄이기 위해서 향상된 FHMIPv6 방안을 제안한다. 이 방안에서는 FHMIPv6에서 사용되는 3계층 핸드오버 메시지의 일부를 2계층 핸드오버 메시지에 포함시켜서 전송하는 방법을 사용한다. 이렇게 함으로서 이동노드는 핸드오버시 발생하는 전체 지연을 줄일 수 있게 되고, 수치적으로 계산하였을 때 기존의 FHMIPv6 보다 IFHMIPv6가 약 32% 향상된 성능을 보이게 된다. Since the Wibro service realize mobile network on the public, it has been considered that it is not enough to support real time service at vehicular speed. The standard Fast Mobile IPv6 Handover Protocol using HMIPv6 may guarantee seamless service as long as the Mobile Node moves in the same domain MAP however it does not regard fast handover over inter-MAP domain. Thus Macro Mobility Handover in HMIPv6 was proposed to reduce handover latency in inter-MAP domain. But it is still not enough to support real-time service. So we propose an Improved FHMIPv6 over 802.16e network to reduce the overall handover latency. We embedded Layer 3 handover messages of the FHMIPv6 into the Layer 2 handover messages. So the MN is able to <TEX>$^-nish$</TEX> overall handover procedure earlier in our scheme. The numerical results show the performance of IFHMIPv6 has improved about 32% in comparison with FHMIPv6.

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.

Efficient and scalable, end-to-end mobility support for reactive and proactive handoffs in IPv6

Handoff performance with mobile IPv6 strongly depends on the efficiency of IP-layer configuration mechanisms as well as the flexibility of mobile nodes to schedule and parallelize their signaling. This article provides a comprehensive analysis of the handoff performance with standard IPv6 protocols and mobile IPv6, and identifies several sources for delay. Some of the delays are already well known, but an optimized and widely applicable handoff approach is yet to be found. While substantial efforts are currently being invested into localized mobility-management architectures, such approaches feature poor scalability and limited deployability given their requirements in terms of financial investments and coordination across administrative borders. This article hence explores a number of promising IPv6 and end-to-end mobile IPv6 optimization proposals, some of which are currently under standardization within the IETF, and elaborates how a combination of those can significantly improve handoff experience without loss of scalability. The article further shows that the optimizations may not only improve reactive handoff performance, but also facilitate efficient proactive handoff management

A simulation study on the performance of Mobile IPv6 in a WLAN-based cellular network

We performed a simulative evaluation of Mobile IPv6 (MIPv6) via ns-2 for a scenario comprising up to three access routers and 30 mobile nodes that communicate in accordance with the IEEE 802.11 wireless LAN standard. We compare standard MIPv6 to a fast handoff procedure and analyze route optimization issues. We present results with respect to handoff latency, packet loss, end-to-end delay, signaling load, channel utilization, and bandwidth per station, and show how various traffic types like UDP CBR, VoIP, and TCP are affected by the handoffs. While some simulation results corroborate the intention of the protocol specification, other results give insights not easily gained without performing simulations. For example, we learned that (i) the fast handoff mechanism almost fully eliminates packet losses but only improves handoff latency in specific cases, (ii) the signaling load introduced by MIPv6 does not severely affect the performance, and (iii) in a shared environment like IEEE 802.11, traffic type can affect the handoff rate since in high-load situations router advertisements might get lost more frequently thereby `irritating' the handoff decision mechanism. As a challenge for future simulations we have identified the design of a random mobility model that allows good control of the handoff rate.