Intersystem location update and paging schemes for multitier wireless networks

Abstract

B r o a d b a n d & Wireless Networking L a b o r a t o r y School of Electrical a n d C o m p u t e r E n g i n e e r i n g Georgia I n s t i t u t e of Technology A t l a n t a , GA 30332 ABSTRACT G l o b a l wireless n e t w o r k s e n a b l e m o b i l e users to comm u n i c a t e r e g a r d l e s s of t h e i r locations, O n e of t h e m o s t i m p o r t a n t issues is l o c a t i o n m a n a g e m e n t in a h i g h l y d y n a m i c e n v i r o n m e n t b e c a u s e m o b i l e users m a y r o a m b e t w e e n d i f f e r e n t wireless networks~ n e tw o r k operators~ a n d g e o g r a p h i c a l regions, I n this paper~ a l o c a t i o n t r a c k i n g m e c h a n i s m is introduced~ w h i c h consists of i n t e r s y s t e m l o c a t i o n u p d a t e s u s i n g t h e c o n c e p t of b o u n d a r y l o c a t i o n a r e a ( B L A ) a n d p a g i n g u s i n g t h e c o n c e p t of b o u n d a r y l o c a t i o n regi s t e r ( B L R ) . T h e B L A is d e t e r m i n e d b y a d y n a m i c l o c a t i o n u p d a t e p o l i c y in w h i c h t h e v e l o c i t y a n d t h e q u a l i t y of s e r v i c e (QoS) a r e t a k e n i n t o a c c o u n t o n a p e r -u s e r basis, T h e B L R is u s e d to m a i n t a i n t h e r e c o r d s of m o b i l e u s e r s crossing t h e b o u n d a r y of n e t w o r k s . T h i s m e c h a n i s m n o t o n l y r e d u c e s locat i o n t r a c k i n g costs b u t also s i g n i f i c a n t l y d e c r e a s e s call loss r a t e s a n d a v e r a g e p a g i n g delays. T h e perf o r m a n c e e v a l u a t i o n of t h e p r o p o s e d s c h e m e s is prov i d e d to d e m o n s t r a t e t h e i r effectiveness in m u l t i t i e r wireless n e t w o r k s .

A dynamic location management scheme for next-generation multitier PCS systems

“…When an MT is moving across different systems, it must perform intersystem location update, which is based on the concept of BLA [26]. To locate the MT for call delivery, intersystem paging is realized through BLR.…”

“…Thus, is obtained by substituting (22) and call duration distribution into (21) (23) By using spectral decomposition, is rewritten as (24) where is a diagonal matrix of eigenvalues and is a full matrix whose columns are the corresponding eigenvectors so that and diag (25) Through some algebra and matrix calculations, is obtained as (26) where is defined in (24). The matrix is determined by .…”

An adaptive distance-based location update algorithm for PCS networks

“…The movement history consists of a list of IDs of zones (LAs or cells) the mobile terminal has crossed after the last update. Last but not least, the concepts of boundary location area and boundary location register were proposed in [13] to facilitate roaming between different wireless networks. The update distance is a function of the QoS factor, velocity ratio, and predefined threshold.…”

“…First of all, structured cell configurations are commonly used. For example, mesh or hexagonal cell configurations are used in two-dimensional models (e.g., [5], [7], and [13]), and a linear model is used in the one-dimensional case (e.g., [3], [4], and [10]). Although these cell topologies simplify the analytical computation, they do not give an accurate representation of a realistic cellular network topology, where the size of each cell depends on the transmit power, receiver sensitivity, antenna radiation pattern, and propagation environment, and the number of neighboring cells varies from cell to cell.…”

“…The symmetric random walk is commonly used to characterize individual movement behavior (e.g., [3]- [5], [7], [9], and [13]). In this model, when a mobile user leaves a cell, there is an equal probability that the user will move to any one of the neighboring cells.…”