Abstract

PDF HTML阅读 XML下载 导出引用 引用提醒 面向分层移动IPv6 网络的动态指针推进机制 DOI: 10.3724/SP.J.1001.2011.03743 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 国家自然科学基金(90604003, 60603067) Dynamic Pointer Forwarding Scheme for HMIPv6 Networks Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:基于指针推进机制的分层移动IPv6 方案因未考虑移动锚点管理域的影响,导致较高的注册和报文分发开销.提出一种面向分层移动IPv6 网络的动态指针推进机制(dynamic pointer forwarding scheme for HMIPv6 networks,简称DPF-HMIPv6),移动节点可根据所选移动锚点的管理域大小,动态调整指针推进机制.若所选移动锚点的管理域大于特定阈值,则移动节点通过在接入路由器间构建指针链来避免频繁地向移动锚点注册;若所选移动锚点的管理域小于阈值,则移动节点通过在移动锚点间构建指针链来避免频繁地向家乡代理注册.数值分析和仿真实验的结果表明,该方案能够有效解决现有方案存在的问题,显著降低分层移动IPv6 网络的开销. Abstract:The recent pointer forwarding schemes for HMIPv6, without consideration of MAP’s (mobile anchor point) coverage, may lead to high registration and packet delivery costs. A dynamic pointer forwarding scheme for HMIPv6 networks (DPF-HMIPv6) is proposed in this paper. The scheme allows mobile nodes to execute pointer forwarding schemes, dynamically, in accordance with MAP’s coverage. The pointer forwarding scheme, based on the access router, is used on the condition that mobile node chooses an MAP with a coverage larger than a threshold to avoid frequent registration with MAP. Otherwise, the pointer forwarding scheme, based on MAP, is executed to avoid frequent registration with HA. The numerical simulation results show that this scheme settles the problems better than existing schemes and markedly reduces the cost of HMIPv6 networks. 参考文献 相似文献 引证文献

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.