Optimal dynamic location update for PCS networks

摘要

The movement based dynamic location update scheme is studied. Ananalytical model is applied to formulate the costs of location updateand paging in the movement based location update scheme. The problem ofminimizing the total cost is formulated as an optimization problem thatfinds the optimal threshold in the movement based location updatescheme. We prove that the total cost function is a convex function ofthe threshold. Based on the structure of the optimal solution, anefficient algorithm is proposed to find the optimal threshold directly.Furthermore, the proposed algorithm is applied to study the effects ofchanging important parameters of mobility and calling patternsnumerically