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.

[1]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[2]  Guang Wan,et al.  A dynamic paging scheme for wireless communication systems , 1997, MobiCom '97.

[3]  Victor C. M. Leung,et al.  Location management for next-generation personal communications networks , 2000, IEEE Netw..

[4]  Siddique Hossain.  A PROPOSED RANDOM WALK MODEL FOR MOBILE CELLULAR NETWORK , 2004 .

[5]  Kalyan Basu,et al.  Adaptive paging algorithms for cellular systems , 1995, 1995 IEEE 45th Vehicular Technology Conference. Countdown to the Wireless Twenty-First Century.

[6]  Jingyuan Zhang,et al.  A speed-adaptive strategy for location management cost reduction in cellular networks , 2006, Wirel. Networks.

[7]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.