一种减少移动IPv6切换延时的新方法

切换问题是移动计算环境中最基本的问题。理想的切换是指同时具备快速切换和平滑切换能力的无缝切换;快速切换就是要求系统具有最小的切换时延,平滑切换则要求系统具备最低的丢包率。现提出一种基于组播的平滑切换框架模型,该模型的基本思想是让移动节点本身携带途经的接入路由器绑定更新队列,每当移动节点到达一个新的链路并获得该链路的转交地址,就向家乡代理和队列成员进行组播。该模型有效地减少了数据包的丢失率,减少了延时,并与现有的快速切换/IPv6路由优化技术能很好地结合起来。     

基于移动预测的快速分层移动组播体系结构

 由于移动节点的位置是不断变化的,移动IPv6协议给出了支持移动节点的远程加入和双向隧道两种组播方法,但这两种方法都有各自的缺点.本文提出基于移动预测的快速分层移动组播体系结构(mobility prediction based fast and hierarchical mobile multicast architecture,简称MP-FHMM),通过移动预测,在切换前为移动节点配置好切换信息,并且在切换时使用基于FMIPv6改进的快速组播切换方法,有效减少了切换延迟以及由此引发的组播数据分组丢失.另外,由于采用层次型结构的移动组播管理,屏蔽了节点在子网内的移动,减少了因节点移动而重构组播树的频率.     

一种移动IP快速平滑切换方案

无线IP网络中将采用移动IP实现移动性管理,但该方案应用在高频度切换环境,存在不可接受的切换时延和数据包丢失,很难保证通信业务的服务质量.提出了一种移动IP快速平滑切换方案,该方案利用后注册切换的概念,在切换过程中不存在数据包的丢失,并可以获得很小的切换时延,在实际系统中运行能够达到良好的效果.     

一种基于无线局域网的移动检测优化方案

无线局域网采用移动IP实现移动性管理.移动IP切换存在切换时延大,数据包易丢失的问题.切换时延由移动检测时延和注册时延组成,而移动检测时延在其中占主要部分.文章提出了一种移动检测优化方案,采用了自适应绑定的算法,同时充分考虑了域内小范围高频度切换的情况,使移动节点在无线局域网环境中进行快速有效的切换.     

移动IP在无线局域网下的一种快速切换方法

针对移动IP在无线局域网下的应用,提出了一种新的基于链路层的移动IP快速切换方法,通过在无线局域网的无线接入点间加入特定的MAC网桥来减少移动节点在切换时产生的切换时延,进而减少移动节点上行和下行方向上的数据包的丢失,达到对移动IP切换进行优化的目的。此方法在无线局域网实际环境中进行了性能测试,结果证明优化后的时延较之原来普通移动IP切换时延有明显降低。     

区域注册移动IP中的分布式位置管理方案

提出了一种区域注册移动IP的分布式位置管理方案。该方案基于区域网络逻辑上分层的结构特点,提出了在流量负载不超出一定流量门限的前提下,为移动节点选取不同层次上的外地代理FA作为网关外地代理GFA。通过对一种区域网络模型的研究,分析了不同层次上的FA作为GFA时的信令开销。最后通过仿真计算得出了采用分布式位置管理方案时区域注册移动IP信令开销的数值结果。通过分析比较说明该方案相比于区域注册移动IP而言,可以节约10％以上的信令开销,并将有效流量分配山多个GFA承担,当某个GFA失效时将不会影响其它GFA工作,提高了网络的稳健性。     

关于移动IP区域注册的一些探讨

在移动IP中,每当移动节点发生了切换,改变了转交地址的时候,就需要向家乡代理注册。如果访问网络和移动节点家乡网络的距离较远的话,这些注册的时延就可能比较大。同它相比,区域注册减小了移动节点域内切换时延,降低了到家乡网络的信令开销,减少了分组丢失。本文首先介绍区域注册的过程,分析它存在的一些问题,然后介绍优化途径及相应的技术难题。     

移动IP中的移动检测方法

本文介绍了移动IP的基本概念和工作原理,并着重探讨了移动检测方法。按链路上有无代理广播消息,移动检测通常分为两种情况进行。移动节点收到代理广播消息后,可用生存时间域和网络前缀做移动检测;如果收不到代理广播消息,在本地链路上,移动节点设法按固定节点通信的方式进行通信尝试,在外地链路上移动节点将通过DHCP协议或手工配置进行通信,或对TCP进程进行监测并检查链路的数据包以确定自己在移动网络中的位置。     

基于移动接收节点的IP组播技术研究

本文分析和研究了当接收节点处在移动环境中时进行IP组播的各种方案,以移动特有的问题为背景,着重讨论了如何综合考虑在组播应用中支持移动接收节点;并对支持组播接收节点移动的各种方案进行了归纳和总结。     

移动IP中的移动检测方法

本介绍了移动IP的基本概念和工作原理，并着重探讨了移动检测方法。按链路上有无代理广播消息，移动检测通常分为两种情况进行。移动节点收到代理广播消息后，可用生存时间域和网络前缀做移动检测；如果收不到代理广播消息，在本地链路上，移动节点设法按固定节点通信的方式进行通信尝试，在外地链路上移动节点将通过DHCP协议或手工配置进行通信，或对TCP进程进行监测并检查链路的数据包以确定自己在移动网络中的位置。     

A Secure Relay-Assisted Handover Protocol for Proxy Mobile IPv6 in 3GPP LTE Systems

The LTE (Long Term Evolution) technologies defined by 3GPP is the last step toward the 4th generation (4G) of radio technologies designed to increase the capacity and speed of mobile telephone networks. Mobility management for supporting seamless handover is the key issue for the next generation wireless communication networks. The evolved packet core (EPC) standard adopts the proxy mobile IPv6 protocol (PMIPv6) to provide the mobility mechanisms. However, the PMIPv6 still suffers the high handoff delay and the large packet lost. Our protocol provides a new secure handover protocol to reduce handoff delay and packet lost with the assistance of relay nodes over LTE networks. In this paper, we consider the security issue when selecting relay nodes during the handoff procedure. During the relay node discovery, we extend the access network discovery and selection function (ANDSF) in 3GPP specifications to help mobile station or UE to obtain the information of relay nodes. With the aid of the relay nodes, the mobile station or UE performs the pre-handover procedure, including the security operation and the proxy binding update to significantly reduce the handover latency and packet loss. The simulation results illustrate that our proposed protocol actually achieves the performance improvements in the handoff delay time and the packet loss rate.     

Multicast Handoff Agent Mechanism for All-IP Mobile Network

This paper proposes a mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for the Internet Group Management Protocol (IGMP) of mobile nodes and keeps information for members of multicast groups in a cell. When a mobile node moves to other cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. In addition, our mechanism may conserve battery power since it does not need to reply to a query.The mechanism is evaluated through simulation and analysis and compared with the IGMPv2 for mobility and IGMP traffic. Simulation results show that handoff latency can be largely reduced and the IGMP control traffic can be eliminated on the wireless links during the duration of membership.     

MobiCast: A multicast scheme for wireless networks

In this paper, we propose a multicast scheme known as MobiCast that is suitable for mobile hosts in an internetwork environment with small wireless cells. Our scheme adopts a hierarchical mobility management approach to isolate the mobility of the mobile hosts from the main multicast delivery tree. Each foreign domain has a domain foreign agent. We have simulated our scheme using the Network Simulator and the measurements show that our multicast scheme is effective in minimizing disruptions to a multicast session due to the handoffs of the mobile group member, as well as reducing packet loss when a mobile host crosses cell boundaries during a multicast session.     

基于IPv6的快速切换改进方案

在移动IP网络中,当前的移动性管理方案由于其基本协议的切换时延较大、丢包率较高而不能适应实时业务和移动通信的要求,所以需要改善移动性管理策略的切换性能,尽量实现无缝切换和零丢包率。提出了一种基于移动IPv6的快速切换的改进方案,采用一种新的地址分配方式使得移动节点能够在移动至新的网络后迅速获取新的转交地址,有效地减少了切换所产生的时延和丢包率,具有较好的切换性能。     

A Proactive mobile‐initiated fast handoff scheme using the multihomed approach

Mobile IP (MIP) defines a mobility management for mobile users to continuously access data when the currently attachment is changed to another network. However, when mobile node (MN) roams between network segments, the handoff latency results in packet losses and transmission delay. In this paper, we propose a multihomed fast handoff scheme (MFH‐MIP) to decrease the handoff cost. In the proposed MFH‐MIP scheme, each MN is implemeted with the link layer trigger and multihomed techniques. Based on the link layer trigger, MN can collect signal strengths of nearby access points (APs) and switch to a new link automatically when the old link becomes unsuitable to connect. Using the multihomed technique, MN can prepare for handoff using two (or more) interfaces, in which (i) one is connected with the old link to receive packets and (ii) the other one is used to access nearby APs and select the most suitable one as the new link, in parellel. In this way, MN can continuously transmit and receive packets during handoff. Based on the proposed method, MN can roam smoothly among different networks in the wireless environment. Copyright © 2008 John Wiley & Sons, Ltd.     

Modeling node mobility for reliable packet delivery in mobile ip networks

In this paper, we analyze node mobility for reliable packet delivery in mobile IP networks. In mobile IP, packets destined to roaming nodes are intercepted by their home agents and delivered via tunneling to their care of addresses (CoA). A mobile node may roam across multiple subnets. At each boundary crossing, a handoff is initiated such that the CoA is updated and a new tunnel is established. We consider both basic mobile IP handoff and smooth handoff. We find that reliable packet delivery in mobile IP networks can be modeled as a renewal process, because the retransmission over a new tunnel after each boundary crossing is independent of the previous history. We then derive the probability distribution of boundary crossings for each successful packet, based on which the packet reliable delivery time can be obtained. Our analytical model is derived based on a general distribution of residence time in a subnet and a general distribution of successful retransmission attempts in each subnet. The results can be readily applied to any distributions for both items. We also provide numerical examples to calculate the probability distribution of boundary crossings, and conduct simulations to validate our analytical results