Optimal dynamic location update for PCS networks

The movement based dynamic location update scheme is studied. An analytical model is applied to formulate the costs of location update and paging in the movement based location update scheme. The problem of minimizing the total cost is formulated as an optimization problem that finds the optimal threshold in the movement based location update scheme. We prove that the total cost function is a convex function of the threshold. Based on the structure of the optimal solution, an efficient algorithm is proposed to find the optimal threshold directly. Furthermore, the proposed algorithm is applied to study the effects of changing important parameters of mobility and calling patterns numerically