Hierarchical Mobile IPv6 Networks Research Articles

Adaptive quality of service aware multi‐mobility anchor point registration in hierarchical mobile IPv6 wireless access networks

In hierarchical mobile IPv6 (HMIPv6), mobility anchor points (MAPs) are introduced to reduce the signalling cost by localising the signalling traffic of mobile nodes (MNs). However, the presence of MAPs introduces areas of bottleneck within the network. This study evaluates the impact of overlapped domains of consecutive MAPs in HMIPv6 access networks. In this novel network architecture, an MAP registration algorithm is also proposed to enable MNs to register with more than one MAP simultaneously. For each flow, the proposed algorithm determines a primary and a secondary MAP according to the quality of service (QoS) requirements of the traffic flow. Load balancing is also introduced to provide an even distribution of load among MAPs. In addition, an extended router advertisement is proposed to enable multiple MAP registration of MNs. The impact of the proposed algorithm in the new HMIPv6 network architectures is compared with a non‐QoS aware multi‐MAP registration algorithm in access network with no overlapped MAP domains. The simulation‐based comparison study illustrates a maximum of 71 and 74% improvements in total amount of rejected bandwidth and the mean satisfied flow requests in network, respectively.

A hybrid approach to secure hierarchical mobile IPv6 networks

Establishing secure access and communications in a hierarchical mobile IPv6 (HMIPv6) network, when a mobile node is roaming into a foreign network, is a challenging task and has so far received little attention. Existing solutions are mainly based on public key infrastructure (PKI) or identity-based cryptography (IBC). However, these solutions suffer from either efficiency or scalability problems. In this paper, we leverage the combination of PKI and certificate-based cryptography and propose a hierarchical security architecture for the HMIPv6 roaming service. Under this architecture, we present a mutual authentication protocol based on a novel cross-certificate and certificate-based signature scheme. Mutual authentication is achieved locally during the mobile node?s handover. In addition, we propose a key establishment scheme and integrate it into the authentication protocol which can be utilized to set up a secure channel for subsequent communications after authentication. As far as we know, our approach is the first addressing the security of HMIPv6 networks using such a hybrid approach. In comparison with PKI-based and IBCbased schemes, our solution has better overall performance in terms of authenticated handover latency.

Access Authentication for HMIPv6 with Node Certificate and Identity-Based Hybrid Scheme

PDF HTML阅读 XML下载 导出引用 引用提醒 节点证书与身份相结合的HMIPv6 网络接入认证机制 DOI: 10.3724/SP.J.1001.2012.04188 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 国家自然科学基金(60872040); 中央高校基本科研业务费专项资金(N100417002, N100404004) Access Authentication for HMIPv6 with Node Certificate and Identity-Based Hybrid Scheme Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:接入认证是层次型移动IPv6(HMIPv6)网络安全的基本需求.构建了适于HMIPv6 的分层认证框架,设计了一种节点证书与身份相结合的签名方案,并以此为基础提出了HMIPv6 网络双向接入认证机制.该机制利用基于身份密码技术简化了公钥基础设施的复杂密钥管理过程;以节点证书为接入认证的主要依据,消除了接入网络与家乡网络间的消息交互;采用提出的层次化签名方案,实现了用户与接入网络的双向认证.机制经过简单扩展,能够支持多层HMIPv6 网络的接入认证.性能与安全性分析表明,与传统的及其他基于身份的认证方案比较,所提出的机制拥有更高的认证效率和安全性. Abstract:Access authentication is the basic security requirement of hierarchical mobile IPv6 (HMIPv6) network. A mutual access authentication scheme is proposed in this paper based on hierarchical authentication framework as well as node certificate and identity-based hybrid approach. The scheme adopts identity-based cryptography to simplify the cumbersome key management of PKI. Node certificate is introduced to authenticate entity, which eliminates message interactions between home network and access network. A mutual authentication protocol is achieved using proposed hierarchical signature mechanism. The protocol can also be extended to support access authentication in multi-level HMIPv6 network. Performance and security analysis demonstrates that the proposed scheme outperforms other identity-based proposals in terms of efficiency and security. 参考文献 相似文献 引证文献

QoS-aware dynamic MAP selection schemes in HMIPv6 networks

We consider a dynamic Mobile Anchor Point (MAP) selection problem when there are both real-time and non-real time sessions in a Hierarchical Mobile IPv6 (HMIPv6) network. We propose schemes in which Mobile Nodes (MNs) holding real-time sessions register with the root MAP in a hierarchy of MAPs to reduce the inter-domain handovers while those with non-real time sessions select one either to balance the load or to reduce handover frequencies.Both the simulation and analytical results show the effectiveness of the proposed schemes with respect to the number of inter-domain handovers, to the average signaling cost, and to the load distribution. In addition, we could also confirm that our MAP selection schemes provide better QoS to the MNs holding real-time sessions, in that they reduce the inter-domain handovers for those MNs and the average handover delay, resulting in a shorter service disruption.

Admission Control for Multiservices Traffic in Hierarchical Mobile IPv6 Networks by Using Fuzzy Inference System

CAC (Call Admission Control) plays a significant role in providing QoS (Quality of Service) in mobile wireless networks. In addition to much research that focuses on modified Mobile IP to get better efficient handover performance, CAC should be introduced to Mobile IP-based network to guarantee the QoS for users. In this paper, we propose a CAC scheme which incorporates multiple traffic types and adjusts the admission threshold dynamically using fuzzy control logic to achieve better usage of resources. The method can provide QoS in Mobile IPv6 networks with few modifications on MAP (Mobility Anchor Point) functionality and slight change in BU (Binding Update) message formats. According to the simulation results, the proposed scheme presents good performance of voice and video traffic at the expenses of poor performance on data traffic. It is evident that these CAC schemes can reduce the probability of the handoff dropping and the cell overload and limit the probability of the new call blocking.

Low-cost binding update scheme based on pointer forwarding in HMIPv6 network

By introducing a mobility anchor point (MAP), hierarchical mobile IPv6 (HMIPv6) reduces the binding update signaling cost associated with mobile IPv6, but there still exist deficiencies. For instance, a mobile node (MN) needs to orderly accomplish two binding updates with the MAP and home agent (HA) when the MN performs inter-MAP mobility. This results in a high signaling cost, thus affecting network performance. To reduce the inter-MAP binding update cost of idle MN in HMIPv6, an optimization scheme based on pointer forwarding with a threshold is proposed. The scheme can reduces the binding update cost of idle MN by using the binding update between MAP to replace several home binding updates. The signaling cost difference is derived by analyzing the cost of the basic scheme and the optimization scheme between two successive sessions. Simulation results show that, the optimization scheme can reduce the binding update signaling cost and improve the network performance as long as a suitable threshold is chosen. The discussions on the sensitivity of tele-parameters are also given.

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 mobility-based load control scheme in Hierarchical Mobile IPv6 networks

By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we propose a mobility-based load control (MLC) scheme, which mitigates the burden of the MAP in fully distributed and adaptive manners. The MLC scheme combines two algorithms: a threshold-based admission control algorithm and a session-to-mobility ratio (SMR)-based replacement algorithm. The threshold-based admission control algorithm gives higher priority to ongoing mobile nodes (MNs) than new MNs, by blocking new MNs when the number of MNs being serviced by the MAP is greater than a predetermined threshold. On the other hand, the SMR-based replacement algorithm achieves efficient MAP load distribution by considering MNs' traffic and mobility patterns. We analyze the MLC scheme using the continuous time Markov chain in terms of the new MN blocking probability, ongoing MN dropping probability, and binding update cost. Also, the MAP processing latency is evaluated based on the M/G/1 queueing model. Analytical and simulation results demonstrate that the MLC scheme outperforms other schemes and thus it is a viable solution for scalable HMIPv6 networks.

HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안

이동 네트워크 환경에서 MN(Mobile Node)의 핸드오버 후 새로운 경로 상에 자원을 예약할 때 시그널링 지연을 최소화하기 위해서는 이전 경로와 새로운 경로가 만나는 지점에 있는 노드인 크로스오버 노드(Crossover Node:CRN)를 발견하는 것이 중요하다. 일반적으로 크로스오버 노드의 발견은 MN과 CN(Correspondent Node)간 설립된 종단간 SID(Session ID)를 주요키로 사용하여 이루어지지만, HMIPv6(Hierarchical Mobile IPv6) 네트워크에서 MAP(Mobility Anchor Point)과 HA(Home Agent)간 군집(Aggregate) 세션 단위로 자원예약을 하는 경우에는 이와 같은 일반적인 방법의 적용이 어렵다. 군집 예약을 할 때에는 종단간 SID와는 별도로 군집 SID를 사용하는데, MN의 핸드오버 후 이전 MAP과 HA간 설립된 세션의 군집 SID가 새로운 MAP과 HA간 설립된 세션의 군집 SID와 달라서 SID를 이용하여 크로스오버 노드를 발견할 수 없기 때문이다. 이에, 본 논문에서는 HMIPv6 네트워크에서 차세대 네트워크 시그널링 프로토콜인 NSIS(Next Step in Signaling)를 이용하여 자원을 예약하는 경우 군집 예약이 이루어진 MAP과 HA간 터널상에서 크로스오버 노드를 발견하고, 크로스오버 노드를 발견한 즉시, 군집 예약된 자원의 갱신이 지역적으로 이루어지도록 하는 방안을 제안한다. 시뮬레이션을 통해, 시그널링 메시지가 항상 터널의 끝 노드까지 전달되는 기존 방안에 비해 제안하는 방안이 자원 예약을 위한 시그널링 지연을 단축시키고, 핸드오버 동안의 평균 처리율을 향상시킴을 알 수 있었다. In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

FI-Based Local Group Key Generation/Distribution for Mobile Multicast in a Hierarchical Mobile IPv6 Network

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.

A pointer forwarding scheme with mobility-aware binding update in Mobile IPv6 networks

In this paper, we propose a pointer forwarding scheme with mobility-aware binding update in Hierarchical Mobile IPv6 networks. In the proposed scheme, a pointer chain between access routers is established to reduce the binding update traffic to the mobility anchor point. In addition, a mobile node (MN) performs a binding update to the correspondent node depending on its mobility. Specifically, an on-link care-of address is chosen for the MN with low mobility, whereas a regional care-of address is selected for the MN with high mobility. This mobility-aware binding update can reduce the packet delivery overhead in an adaptive manner. We develop analytical models that consider both the binding update cost and the packet delivery cost when route optimization is supported. Numerical results demonstrate that the pointer forwarding scheme with mobility-aware binding update outperforms HMIPv6 and the existing pointer forwarding scheme in different situations.

Improving Performance of HMIPv6 Networks with Adaptive MAP Selection Scheme

Hierarchical Mobile IPv6 (HMIPv6) was designed to reduce the long handover time associated with MIPv6 by employing a hierarchy of Mobile Anchor Points (MAPs). However, the selection of MAP and its load status critically affect the system performance. Thus, in this paper, we introduce two novel dynamic MAP selection schemes for HMIPv6, that relieve overloaded MAPs as well as select a more suitable MAP according to each Mobile Node (MN)'s up-to-date mobility towards reducing inter-domain handover, resulting in saving the overall signaling cost. Further, we develop an analytical model of the average signaling cost for inter-domain handover to investigate the performance of another existing approach with its basis on IETF HMIPv6 as well as our schemes. We also perform simulations to evaluate the performance of our proposed schemes. It is shown via simulation and numerical results that the proposed dynamic MAP selection schemes can significantly reduce the number of inter-domain handovers and the average signaling cost as well as distribute load over multiple MAPs compared to the other existing approaches.

A three-level mobility management scheme for hierarchical mobile IPv6 networks

Performance evaluation shows that Hierarchical Mobile IPv6 (HMIPv6) cannot outperform standard Mobile IPv6 (MIPv6) in all scenarios. Thus, adaptive protocol selection under certain circumstances is desired. Moreover, it is necessary to balance the load among different Mobility Anchor Points (MAPs). This paper proposes an efficient three-level hierarchical architecture for mobility management in HMIPv6 networks, in which a mobile node (MN) may register with either a higher/lower MAP or its home agent according to its speed and the number of connecting correspondent nodes (CNs). An admission control algorithm and a replacement algorithm are introduced to achieve load balancing between two MAP levels and among different MAPs within the same MAP level. Admission control is based on the number of CNs but not MNs that an MAP serves. In case there is no capacity for an MN, the MAP chooses an existing MN to be replaced. The replaced MN uses the MAP selection algorithm again to choose another mobility agent. Simulation results showed that the proposed scheme achieves better performance not only in reducing the signaling overhead, but also in load balancing among different MAPs.

A performance comparison of mobility anchor point selection schemes in Hierarchical Mobile IPv6 networks

Hierarchical Mobile IPv6 (HMIPv6) introduces a mobility anchor point (MAP) that localizes the signaling traffic and hence reduces the handoff latency. In addition to processing binding update messages from mobile nodes (MNs) on behalf of MNs' home agents (HAs), the MAP performs data traffic tunneling destined to or originated from MNs, both of which will burden the MAP substantially as the network size grows. To provide scalable and robust mobile Internet services to a large number of visiting MNs, multiple MAPs will be deployed. In such an environment, how to select an appropriate MAP has a vital effect on the overall network performance. In this paper, we choose four MAP selection schemes: the furthest MAP selection scheme, the nearest MAP selection scheme, the mobility-based MAP selection scheme, and the adaptive MAP selection scheme. Then, we compare their performances quantitatively in terms of signaling overhead and load balancing. It can be shown that the dynamic schemes (i.e., the mobility-based and the adaptive MAP selection schemes) are better than the static schemes (i.e., the furthest and the nearest MAP selection schemes), since the dynamic schemes can select the serving MAP depending on the MN's characteristics, e.g., mobility and session activity. In addition, the adaptive MAP selection scheme achieves low implementation overhead and better load balancing compared with the mobility-based MAP selection scheme.

An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.

Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks

Hierarchical Mobile IPv6 (HMIPv6) is an enhanced version of Mobile IPv6 designed to reduce signaling overhead and to support seamless handoff in IP-based wireless/mobile networks. To support more scalable services, HMIPv6 networks can be organized as the form of a multi-level hierarchy architecture (i.e., tree structure). However, since multi-level HMIPv6 networks incur additional packet processing overhead at multiple mobility agents, it is important to find the optimal hierarchy level to minimize the total cost, which consists of the location update cost and the packet delivery cost. In this paper, we investigate this problem, namely the design of an optimal multi-level HMIPv6 (OM-HMIPv6) network. To accomplish this, we design a function to represent the location update cost and the packet delivery cost in multi-level HMIPv6 networks. Based on these formulated cost functions, we calculate the optimal hierarchy level in multi-level HMIPv6 networks, in order to minimize the total cost. In addition, we investigate the effects of the session-to-mobility ratio (SMR) on the total cost and the optimal hierarchy. The numerical results, which show various relationships among the network size, optimal hierarchy, and SMR, can be utilized to design an optimal HMIPv6 network. In addition, the analytical results are validated by comprehensive simulations.

Threshold-Based Adaptive Call Admission Control in Hierarchical Mobile IPv6

A call admission control (CAC) scheme used in hierarchical mobile IPv6 (HMIPv6) network is proposed, which solves the ideal call number of each cell adaptively to maximize system's profits, under the restriction of system's overload probability and capacity and in terms of hosts' mobility characteristics and call characteristics. The CAC threshold of each cell used in making decisions of accepting or rejecting a new call by network is solved by establishing a Markov model in HMIPv6 network, which can make system's call number up to the ideal value. Simulation analyzes the factors affecting the optimal regional size, providing a reference for designing a dynamic regional mobility management scheme. The simulation analyses reveal that with the increase of calls' handoff probability and average duration time, the optimal regional size increases while the regional ideal call number decreases; and with the restriction of overload probability relaxes, the new call blocking probability (CBP) comes down while the handoff dropping probability (HDP) goes up. Finally, a performance comparison result between the proposed scheme and the mobile IP reservation (MIR) scheme demonstrates that the average values of CBP and HDP in the proposed scheme are lower than those in MIR during 2000 simulation intervals, which means the optimization is realized.

A Scheme for Supporting Fast Handover in Hierarchical Mobile IPv6 Networks

This Letter proposes a scheme that supports a fast handover effectively in hierarchical mobile IPv6 networks (F-HMIPv6) by optimizing the associated data and control flows during the handover. By NS-2 simulation, we show that the proposed scheme can give better handover performance than a simple combination of existing schemes.

History-Based Auxiliary Mobility Management Strategy for Hierarchical Mobile IPv6 Networks

The reduction of the signaling load associated with IP mobility management is one of the significant challenges to IP mobility support protocols. Hierarchical Mobile IPv6 (HMIPv6) aims to reduce the number of the signaling messages in the backbone networks, and improve handoff performance by reducing handoff latency. However, this does not imply any change to the periodic binding update (BU) to the home agent (HA) and the correspondent node (CN), and now a mobile node (MN) additionally should send it to the mobility anchor point (MAP). Moreover, the MAP should tunnel the received packets to be routed to the MN. These facts mean that the reduction of the BU messages in the backbone networks can be achieved at the expense of the increase in the signaling bandwidth consumption within a MAP domain. On the other hand, it is observed that an MN may habitually stay for a relatively long time or spend on using much Internet in a specific cell (hereafter, home cell) covering its home, office or laboratory, etc. Thus, considering the preceding facts and observation, HMIPv6 may not be favorable especially during a home cell residence time in terms of signaling bandwidth consumption. To overcome these drawbacks of HMIPv6, we propose a history-based auxiliary mobility management strategy (H-HMIPv6) to enable an MN to selectively switch its mobility management protocols according to whether it is currently in its home cell or not in HMIPv6 networks. The operation of H-HMIPv6 is almost the same as that of HMIPv6 except either when an MN enters/leaves its home cell or while it stays in its home cell. Once an MN knows using its history that it enters its home cell, it behaves as if it operates in Mobile IPv6 (MIPv6), not in HMIPv6, until it leaves its home cell; No periodic BU messages to the MAP and no packet tunneling occur during the MN's home cell residence time. The numerical results indicate that compared with HMIPv6, H-HMIPv6 has apparent potential to reduce the signaling bandwidth consumption and the MAP blocking probability.