An Adaptive Dynamic Scheme For A Dynamic Paging Performance In Hierarchical Mobile IPv6

Many schemes have been proposed to improve the quality of communications in wireless networks. Especially, hierarchical mobile IPv6 (HMIPv6) and paging mechanism lead desirable results. In paging mechanism, it is proved that the dynamic paging performs much better than the static paging. Also, the dynamic paging operates better in HMIPv6 than any other environments. Subsequently, the loads can be significantly decreased through the dynamic paging applied to HMIPv6. So we propose how to combine two schemes known for cost-effectiveness, the dynamic paging and the dynamic MAP selection scheme, to improve dynamic paging procedures. In our scheme, we propound a new concept, PAMAP. And each mobile node computes dynamically its optimal location area size as the PAMAP´s domain according to its mobility characteristics. As a result, the domain could be such a best paging area that the signaling loads could be minimized in wireless networks