基于Delaunay三角剖分的FMIPv6快速切换机制

Fast handover mechanism based on Delaunay triangulation for FMIPv6

针对快速移动IPv6(FMIPv6)中预测新接入路由器(NAR)出错时的丢包问题,提出了一种基于Delaunay三角剖分的快速切换机制(TFMIPv6)。该机制通过Delaunay三角剖分算法将网络分割成虚拟的三角拓扑结构,在相邻的接入路由器间建立隧道,通过目标接入节点候选表来协助移动节点快速重构两个新的转交地址,并将切换过程中到达的包缓存在两个可能的NAR中。仿真结果表明,TFMIPv6能获得比FMIPv6更小的切换延时及丢包率。

To solve the packet loss problem caused by inaccurate prediction of New Access Router （NAR） in the Fast Handover for mobile IPv6 （FMIPv6）, this paper proposed a triangulation-based fast handoff mechanism （TFMIPv6）. In TFMIPv6, a triangulation algorithm was used to split the network into virtual triangle topology, and the tunnel was established among adjacent access routers. The candidate target Access Points （AP） were selected to quickly recalculate the new relay addresses for the mobile nodes, and packets were buffered in two potential NARs during handover. The experimental results illustrate that TFMIPv6 protocol achieves lower handoff latency and packet loss rate compared with FMIPv6.