Analysis of cost and quality of service of time-based dynamic mobility management in wireless networks

A key observation of a time-based location management scheme (TBLMS) is that the simple paging method (i.e., the fastest paging method) does not guarantee to find a mobile terminal, no matter how small the location update cycle is and how big the radius of a paging area (PA) is. Therefore, in addition to cost analysis and optimization, there is one extra issue to deal with in a TBLMS, i.e., the quality of service (QoS), which is the probability that a mobile terminal can be found in the current PA. The main contributions of the paper are as follows. First, based on our previous results on random walks among rings of cell structures, we analyze the location distribution of a mobile terminal in a PA and the reachability of a mobile terminal in a PA when a phone call arrives, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Second, using results from renewal processes, we analyze the cost of dynamic mobility management in a TBLMS, where the inter-call time and the cell residence time can have an arbitrary probability distribution. Third, we develop a method to find a TBLMS which has the best combination of the location update cycle and the radius of a PA with the minimum cost of mobility management, while still satisfying the required QoS.