HMIPv6 Networks Research Articles

Design VMAP with caching scheme to improving handover performance on the HMIPV6 network

The integration of WiMAX and Mobile IPV6 (MIPV6) protocol is one of the hottest wireless network technology trends. HMIPV6 uses a Mobility Anchor Point (MAP) as the Local HA, to regionalize the handover operation, reduce lots of the Binding Update (BU) information transmission of MIPV6 among HA, CN and MN, and to achieve the goal of fast handover. However, the BU procedure of HMIPV6 consumes too much time and causes packet loss and transmission delay. Therefore, this paper proposes VMAP-C (VMAP with Caching) to improve the effectiveness and efficiency of handover. In this scheme, we use the original VMAP method to improve the performance of signal transmissions and also utilize caching scheme to replace the existing DAD mechanism. Then, we perform simulations with the NS-2 simulator tool, each VMAP is ranged from 4 to 8 ARs, and also the number of MN increases from 1 to 100. The final simulation results indicate that the proposed VMAP-C obtains a reduction of about 15.62–52.28% in Handover delay, decreases Jitter of arriving inter-packets by about 10.63–50.61%, enhances the Throughput of the system by about 6.56–12.63%, and reduces the Packet loss ratio by about 9.57–87.69% compared to VMAP. Consequently, we prove that the VMAP-C scheme can obtain lower delay, Jitter and Packet loss ratio more than VMAP, and achieve higher system Throughput and better handover performance on the HMIPV6 network.

Active overload prevention based adaptive MAP selection in HMIPv6 networks

Multi-level mobile anchor points (MAP) architecture is deployed in large-scale wireless/mobile networks using HMIPv6 to achieve better mobility service, while selecting the most suitable serving MAP for the mobile nodes (MNs) to enhance the whole network performance has been a critical issue. An adaptive MAP selection based on active overload prevention (MAP-AOP) hence is proposed. The MAP periodically evaluates the load status by using dynamic weighted load evaluation algorithm, and then sends the load information to the covered access routers (AR) by using the expanded routing advertisement message in a dynamic manner. Taking achieving the load balancing among the available MAPs, the current serving AR executes the active overload prevention to select MAP candidates for the MN pending a handover, and then adaptively selects an optimal one from the candidates by comprehensively considering the system cost and the average handover latency caused by each candidate. The simulation conducted on the NS-2 platform indicates that MAP-AOP outperforms the comparative MAP selection schemes with the optimized system cost and average handover latency, and better load balancing.

Dynamic Map and Diffserv Based AR Selection for Handoff in HMIPv6 Networks

In HMIPv6 Networks, most of the existing handoff decision mechanisms deal mainly with the selection of Mobility Anchor Point (MAP), ignoring the selection of access router (AR) under each MAP. In this paper, we propose a new mechanism called “Dynamic MAP and Diffserv based ARs selection for Handoff in HMIPv6 networks” and it deals with selecting the MAP as well as ARs. MAP will be selected dynamically by checking load, session mobility ratio (SMR), Binding update cost and Location Rate. After selecting the best MAP, the Diffserv approach is used to select the AR under the MAP, based on its resource availability. The AR is implemented at the edge router of Diffserv. DiffServ can be used to provide low-latency to critical network traffic such as voice or streaming media while providing simple best-effort service to non-critical services such as web traffic or file transfers. By using this mechanism, we can assure that better resource utilization and throughput can be attained during Handoff in HMIPv6 networks. .

Dynamic Pointer Forwarding Scheme for HMIPv6 Networks

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. 参考文献 相似文献 引证文献

On a moving direction pattern based MAP selection model for HMIPv6 networks

In a large-scale mobile IPv6 network, usually there are several coexisting mobility anchor points (MAPs) for networking robustness and traffic sharing. Therefore, it is a challenging issue for an arriving mobile node to choose the most appropriate MAP to bind. This task must be carried out by considering the issues of load balancing, binding update and packet delivery cost minimization. This paper proposes a novel MAP selection scheme for hierarchical mobile IPv6 networks to allow a mobile node to discover the most appropriate MAP when there are multiple coexisting MAPs. This scheme is an enhancement to the adaptive MAP selection scheme. The proposed scheme improve the overall performance due to the consideration of the movement (direction) pattern of mobile nodes. Simulation results show that this scheme outperforms the existing cost models in terms of total binding update and packet delivery costs, ensuring a level of load balance similar to adaptive MAP selection scheme.

A Novel Approach to Reduce Signaling Delay in HMIPv6 mobile Networks

in the new era, changing requirements of users raise the need of next generation wireless networks (NGWN) which can provide efficient and quality of services to users any time any where. 4G wireless networks aim to provide best services, high data rates along with the permission to switch over across heterogeneous networks. In order to reduce signallling and registration delays in basic (MIPv6) networks, a new architecture HMIPv6 is considered. HMIPv6 architecture deals with local registration and global registration depending on the mobility.HMIPv6 architecture divides the mobility into two parts: micro-mobility and macro-mobility. The performance of HMIPv6 networks are immensely effected by selection of MAP that in turn includes selection of various attributes like speed of MN, pattern followed by MN and type of the mobility (micro-mobility and macro-mobility) used by MN. In this paper, these three attributes are considered collectively for the selection of next best MAP in order to optimize various quality of service (QoS) parameters viz. handoff delays, location update cost, packet delivery cost and signaling cost. Proposed scheme encourages service providers to kept track of MNs history and then depending on the history and speed of MN, next best MAP is selected in order to multicast the packets before mobile node is actually connected to the selected MAP. Optimization of QoS parameters will finally result in providing remarkable communication experience to mobile phone users.

Adaptive Route Optimization in Hierarchical Mobile IPv6 Networks

By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIP6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. However, if a mobile node (MN)'s session activity is high and its mobility is relatively low, HMIPv6 may degrade end-to-end data throughput due to the additional packet tunneling at the MAP. In this paper, we propose an adaptive route optimization (ARO) scheme to improve the throughput performance in HMIPv6 networks. Depending on the measured session-to-mobility ratio (SMR), ARO chooses one of the two different route optimization algorithms adaptively. Specifically, an MN informs a correspondent node (CN) of its on-link care-of address (LCoA) if the CN's SMR is greater than a predefined threshold. If the SMR is equal to or lower than the threshold, the CN is informed with the MN's regional CoA (RCoA). We analyze the performance of ARO in terms of balancing the signaling overhead reduction and the data throughput improvement. We also derive the optimal SMR threshold explicitly to achieve such a balance. Analytical and simulation results demonstrate that ARO is a viable scheme for deployment in HMIPv6 networks.