基于一种新的移动锚点选择算法的分层移动IPv6策略  

Hierarchical mobile IPv6 strategy based on new mobile anchor point selection algorithm

作　　者：孙文胜[1] 黄吉[1] 

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018

出　　处：《计算机应用》2013年第1期112-114,119,共4页journal of Computer Applications

摘　　要：针对在分层移动IPv6(HMIPv6)中域内切换和域间切换的时延相差较大的问题,提出一种新的移动锚点(MAP)选择算法。在域内切换时继续使用HMIPv6,在域间切换时则采用一种基于预重复地址检测(DAD)的HMIPv6(D-HMIPv6)机制。D-HMIPv6通过引入一个同伴节点(PN),进而帮助移动节点(MN)在域间切换时预先完成部分3层切换,以此来减少重复地址检测过程所带来的切换时延。网络仿真工具NS-2的结果表明,相比HMIPv6,D-HMIPv6把域间切换过程中的时延缩短了将近2 s,有效地提高了对移动IPv6实时应用的支持能力。To deal with the big difference between inner-domain and inter-domain on handoff time delay of Hierarchical Mobile IPv6 （ HMIPv6）, this paper proposed a new Mobile Anchor Point （MAP） selection algorithm. When handoff happened on inner-domain, the Mobile Node （MN） continued to use HMIPv6, otherwise to use a new mechanism based on Duplicate Address Detection （DAD） HMIPv6, called D-HMIPv6. An element called Partner Node （PN） was introduced to help MN complete partial three layer handoff work in advance when it was in inter-domain, which reduced the time delay by DAD. The results of the network simulation tool NS-2 show that, compared with the HMIPv6, D-HMIPv6 reduces the inter-domain handoff time delay nearly by two seconds, and improves the ability of supporting mobile IPv6 in real-time.

关 键 词：域间切换 移动锚点选择算法 切换时延 同伴节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN915.04[自动化与计算机技术—计算机科学与技术]