An adaptive distance-based location update algorithm for PCS networks

We propose a stochastic model to compute the optimal update boundary for the distance-based location update algorithm. The proposed model captures some of the real characteristics in the wireless cellular environment. The model can adapt to arbitrary cell topologies in which the number of neighboring base stations at different locations may vary. The cell residence time can follow general distributions which captures the fact that the mobile user may spend more time at certain locations than others. The model also incorporates the concept of a trip in which the mobile user may follow a particular path to a destination. For implementation, the decision of location update can be made by a simple table lookup. Numerical results indicate that the proposed model provides a more accurate update boundary in a real environment than that derived from a hexagonal cell configuration with random walk movement pattern. The proposed model allows the network to maintain a better balance between the processing incurred due to location update and the radio bandwidth utilized for paging between call arrivals