A speed based adaptive algorithm for reducing paging cost in cellular networks

Location update and paging are important parts of location management of cellular network. This paper deals with a new algorithm to reduce paging cost using speed adaptive strategy. The proposed algorithm uses speed distribution and random walk model to develop look-up tables for mobile terminal. These tables are used to find out subarea size to be paged. Paging area is further reduced by introduction of 120 degree paging zones. A paging agent is used to store previous VLR address and helps to find out optimal paging zone. The proposed algorithm is capable of reducing the paging cost approximately by a factor of two for maximum subarea area size 6 i.e. approximately half of the cells are required to be paged.