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.
Random Walk Model Location Management Location paging Mobile switching center (MSC)
Ashish Goel Navankur Gupta Prakhar Kumar
Department of Electronics and Communication Engineering Jaypee Institute of Information Technology University, Noida, India – 201307
国际会议
北京
英文
1338-1341
2009-08-08（万方平台首次上网日期，不代表论文的发表时间）