An adaptive mobility anchor point selection algorithm for hierarchical mobile IPv6

The hierarchical mobile IPv6 was proposed to reduce the signaling overhead associated with the correspondent nodes and the home agent. In order to support the scalable services, multiple MAPs are needed to be located within the same visited networks. However, the default MAP selection algorithm is simple to choose the furthest MAP, which causes the performance bottleneck at MAP. In this paper, we propose an adaptive MAP selection algorithm which bases on the distributed MAP environment and takes the comprehensive factors such as MN´s velocity, MN´s session arrival rate, MAP´s load and distance into consideration to select the proper MAP. This algorithm does not need the fixed threshold to make the decision. From the numeric and simulation results, we can obtain that the adaptive MAP selection algorithm could select the proper MAP basing on the MN´s characteristics and the MAP´s conditions, and balance the MAP loads.