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

Author

Goel, Ashish ; Gupta, Navankur ; Kumar, Prakhar

Author_Institution

Dept. of Electron. & Commun. Eng., Jaypee Inst. of Inf. Technol. Univ., Noida, India

fYear

2009

fDate

8-11 Aug. 2009

Firstpage

22

Lastpage

25

Abstract

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.

Keywords

cellular radio; mobility management (mobile radio); paged storage; random processes; table lookup; VLR address; cellular networks; location management; look-up tables; mobile terminal; paging agent; paging cost reduction; random walk model; speed-based adaptive algorithm; Adaptive algorithm; Bandwidth; Communication switching; Cost function; Databases; Information technology; Land mobile radio cellular systems; Mobile communication; Mobile handsets; Paging strategies; Location Management; Location paging; Mobile switching center (MSC); Random Walk Model;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-4519-6

Electronic_ISBN

978-1-4244-4520-2

Type

conf

DOI

10.1109/ICCSIT.2009.5234786

Filename

5234786