One-dimensional location area design

Author

Saraydar, Cem U. ; Kelly, Owen E. ; Rose, Christopher

Author_Institution

Dept. of Electr. & Comput. Eng., Rutgers Univ., Piscataway, NJ, USA

Volume

49

Issue

5

fYear

2000

fDate

9/1/2000 12:00:00 AM

Firstpage

1626

Lastpage

1632

Abstract

Location management cost in a wireless network is expressed in this work as the sum of signaling cost due to paging and signaling cost due to registration. We introduce and compare a heuristic method and an asymptotic method for selecting a disjoint partition of a one-dimensional service area to minimize location management costs. In special cases for which the best design is known, the asymptotic design rule outperforms the heuristic rule, including cases for which the number of location areas is small. With offered load λ, per-event paging cost P, per-event registration cost R, and fixed traffic patterns, optimal location area edges depend on √λP/R and location management costs are proportional to √λPR

Keywords

cellular radio; paging communication; radio direction-finding; telecommunication network management; telecommunication signalling; telecommunication traffic; 1D location area design; 1D service area; asymptotic design rule; asymptotic method; cellular networks; disjoint partition; fixed traffic patterns; heuristic method; heuristic rule; location management cost minimization; offered load; optimal location area edges; per-event paging cost; per-event registration cost; signaling cost; wireless network; Bandwidth; Base stations; Communication system traffic control; Cost function; Databases; Mobile communication; Mobile radio mobility management; Paging strategies; Telecommunication traffic; Wireless networks;

fLanguage

English

Journal_Title

Vehicular Technology, IEEE Transactions on

Publisher

ieee

ISSN

0018-9545

Type

jour

DOI

10.1109/25.892546

Filename

892546