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 registra
tion. We introduce and compare a heuristic method and an asymptotic method
for selecting a disjoint partition of a one-dimensional service area to min
imize location management costs. In special cases for which the best design
is known, the asymptotic design rule outperforms the heuristic rule, inclu
ding cases for which the number of location areas is small, With offered lo
ad lambda, per-event paging cost P, per-event registration cost R, and fixe
d traffic patterns,optimal location area edges depend on root lambdaP/R and
location management costs are proportional to root lambda PR.