- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Generalized paging schemes for cellular systems
Open Collections
UBC Theses and Dissertations
Featured Collection
UBC Theses and Dissertations
Generalized paging schemes for cellular systems 1998
pdf
Page Metadata
Item Metadata
Title | Generalized paging schemes for cellular systems |
Creator |
Kim, Tae Kyung |
Date Created | 2009-05-25T19:56:41Z |
Date Issued | 2009-05-25T19:56:41Z |
Date | 1998 |
Description | The problem of locating a mobile vehicular user in a cellular communication system is addressed. Two location area (LA) paging schemes, called generalized paging with time-stamp and generalized paging without time-stamp, are proposed to determine the location of a user within an LA and are compared to the Selective paging scheme. The mobility of a user is modelled by a directional random walk process and the user location is registered using a dynamic LA-based location updating scheme. It is found that generalized paging with time-stamp and generalized paging without time-stamp can significantly reduce both average paging delay and traffic when compared to Selective paging. The sensitivity of the two generalized paging schemes to uncertainty in user mobility parameter values, such as the mean speed, mean velocity hold time, and angular deviation parameter, is studied. Generalized paging with time-stamp is found to be very sensitive to uncertainty in user mean speed whereas generalized paging without time-stamp is not very sensitive to changes in all three parameter values. Two multicasting schemes called generalized multicasting with time-stamp and generalized multicasting without time-stamp, based on the two generalized paging schemes, are proposed. The two generalized multicasting schemes' performances in terms of the average paging delay and traffic improve significantly as the number of users within the service area is increased. |
Extent | 2777289 bytes |
Genre |
Thesis/Dissertation |
Type |
Text |
File Format | application/pdf |
Language | Eng |
Collection |
Retrospective Theses and Dissertations, 1919-2007 |
Series | UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/] |
Date Available | 2009-05-25T19:56:41Z |
DOI | 10.14288/1.0064852 |
Degree |
Master of Applied Science - MASc |
Program |
Electrical and Computer Engineering |
Affiliation |
Applied Science, Faculty of |
Degree Grantor | University of British Columbia |
Graduation Date | 1998-11 |
Campus |
UBCV |
Scholarly Level | Graduate |
URI | http://hdl.handle.net/2429/8131 |
Aggregated Source Repository | DSpace |
Digital Resource Original Record | https://open.library.ubc.ca/collections/831/items/1.0064852/source |
Download
- Media
- ubc_1998-0496.pdf [ 2.65MB ]
- Metadata
- JSON: 1.0064852.json
- JSON-LD: 1.0064852+ld.json
- RDF/XML (Pretty): 1.0064852.xml
- RDF/JSON: 1.0064852+rdf.json
- Turtle: 1.0064852+rdf-turtle.txt
- N-Triples: 1.0064852+rdf-ntriples.txt
- Citation
- 1.0064852.ris
Full Text
GENERALIZED PAGING SCHEMES FOR CELLULAR SYSTEMS by TAE KYUNG K I M B.A.Sc. (E.E.), University of British Columbia, 1995 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF APPLIED SCIENCE in THE FACULTY OF GRADUATE STUDIES DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING We accept this thesis as conforming to the required standard THE UNIVERSITY OF BRITISH COLUMBIA May 1998 © Tae Kyung Kim, 1998 In p resen t ing this thesis in partial fu l f i lment of t h e requ i remen ts fo r an advanced degree at the Universi ty o f British C o l u m b i a , I agree that t h e Library shall make it f reely available fo r re ference and s tudy. I fu r ther agree that permiss ion f o r extens ive c o p y i n g of this thesis f o r scholar ly pu rposes may be g ran ted by the head o f m y d e p a r t m e n t or by his o r her representat ives. It is u n d e r s t o o d that c o p y i n g o r pub l i ca t ion o f this thesis fo r f inancial gain shall n o t be a l l o w e d w i t h o u t m y w r i t t e n permiss ion . D e p a r t m e n t o f £fecrHQ>4 C ^ p i r f e r ^flfaeerivic^. The Univers i ty of Brit ish C o l u m b i a Vancouver , Canada Date M ^ y 2-7, /<W DE-6 (2/88) Abstract The problem of locating a mobile vehicular user in a cellular communication system is addressed. Two location area (LA) paging schemes, called generalized paging with time-stamp and generalized paging without time-stamp, are proposed to determine the location of a user within an LA and are compared to the Selective paging scheme. The mobility of a user is modelled by a directional random walk process and the user location is registered using a dynamic LA-based location updating scheme. It is found that generalized paging with time-stamp and generalized paging without time-stamp can significantly reduce both average paging delay and traffic when compared to Selective paging. The sensitivity of the two generalized paging schemes to uncertainty in user mobility parameter values, such as the mean speed, mean velocity hold time, and angular deviation parameter, is studied. Generalized paging with time-stamp is found to be very sensitive to uncertainty in user mean speed whereas generalized paging without time-stamp is not very sensitive to changes in all three parameter values. Two multicasting schemes called generalized multicasting with time-stamp and general- ized multicasting without time-stamp, based on the two generalized paging schemes, are proposed. The two generalized multicasting schemes' performances in terms of the average paging delay and traffic improve significantly as the number of users within the service area is increased. 11 Table of Contents Abstract ii List of Figures v Acknowledgement viii Chapter 1 INTRODUCTION 1 1.1 Background 1 1.2 Motivations and Objectives 2 1.3 Outline of the Thesis 3 Chapter 2 USER MOBILITY MODEL 4 2.1 Review of Directional Random Walk Model of [ 11 ] 4 2.2 Simulation Results 6 2.3 Approximating the Radial Distance and Angular Deviation Rd.f.'s 7 2.3.1 Radial distance p.d.f 7 2.3.2 Angular deviation p.d.f .' 13 Chapter 3 C E L L U L A R LAYOUT AND LOCATION AREA UPDATING SCHEME 17 3.1 Cellular Layout Model 17 3.2 Location Area 18 3.3 Location Updating Scheme 20 3.3.1 Location updating conditions 21 3.3.2 Location updating traffic 22 Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 25 4.1 Call Arrival Model 25 4.2 Cell Numbering Notation 29 i i i 4.3 LA Ring Probability 29 4.4 LA Angular Probability 30 4.5 LA Cell Probability 31 4.6 Review of Other Paging Schemes 32 4.7 Generalized Paging Schemes 32 4.7.1 With location update time-stamp (Scheme A) 33 4.7.2 Without location update time-stamp (Scheme B) 35 4.8 Numerical Results 38 4.8.1 Performance comparison 39 4.8.2 Trade-off between average paging delay and traffic 42 4.9 Verification of LA Entry Point Assumption 47 Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 5.1 Uncertainty in Mean Speed 49 5.2 Uncertainty in Mean Velocity Hold Time 52 5.3 Uncertainty in Angular Deviation Parameter 53 Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES 57 6.1 Preliminaries 57 6.2 Generalized Multicasting Schemes 58 6.3 Simulation Results 60 Chapter 7 CONCLUSION AND FUTURE WORK 64 Bibliography 66 iv List of Figures Figure 2.1 Random walk model 4 Figure 2.2 Angular deviation p.d.f. with <xp = 4.2 6 Figure 2.3 Radial distance p.d.f. of random walk from simulation with v = 30 km/hr and Th = 60 sec 8 Figure 2.4 Angular deviation p.d.f. from simulation with v = 30 km/hr and 7h = 60 sec 8 Figure 2.5 Analytical directional random walk model 9 Figure 2.6 Plot of N(t) versus L for parameter sets {v km/hr, th sec}: {20, 30}, {30, 60}, {30, 180}, {40* 30}, and { 5 0 , 9 0 } 12 Figure 2.7 Goodness of fit of the approximate radial distance p.d.f. (a) Th = 60 sec (b) v =50 km/hr 13 Figure 2.8 Goodness of fit of the analytical angular deviation p.d.f. (a) Th = 60 sec (b) v =50 km/hr 16 Figure 3.1 Cellular System Layout Model 17 Figure 3.2 Location Area of size = 4 18 Figure 3.3 Equivalent radius of a cell 19 Figure 3.4 Circular LA model of size = 4 20 Figure 3.5 Location updating traffic versus LA size for v = 40 km/hr, Th = 60 sec, and d = 100 km. (a) rcell = 1 km (b) rcell = 2 km 24 Figure 4.1 P.d.f.'s of the call arrival time since the last location update for v = 40 km/ hr, Th = 60 sec, and rcell = 1 km. (a) Kcall = 1 call arrival/hr. (b) \ c a l l = 10 call arrival/hr 27 Figure 4.2 Goodness of fit of the approximate fc{t) p.d.f. for v = 40 km/hr, th = 60 sec, and rcell = 1 km. (a) \ c a l l = 1 call arrival/hr. (b) XcM = 10 call arrival/ hr 28 Figure 4.3 Numbering of cells in an LA of size = 4 29 Figure 4.4 Cell probability illustration for ce//(2,1) 31 Figure 4.5 Performance of Flood paging, Spreading paging, and Selective paging with v = 40 km/hr, Th = 60 sec, rcell - 1 km, and Xcall = 1 call/hr. (a) average paging delay, (b) average paging traffic 40 Figure 4.6 Performance of Scheme A and Scheme B with v = 40 km/hr, Th = 60 sec, rceii = 1 km, and XcM = 1 call/hr. (a) average paging delay, (b) average paging traffic 41 Figure 4.7 Performance of Selective paging, Scheme A, and Scheme B versus the user mean speed for Th = 60 sec, Xcall = 1 call/hr, and rcell = 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size =10 43 Figure 4.8 Performance of Selective paging, Scheme A, and Scheme B versus the mean velocity hold time for v = 40 km/hr, xcall = 1 call/hr, and rcM = 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size =10 44 Figure 4.9 Performance of Selective paging, Scheme A, and Scheme B versus the call arrival rate for v = 40 km/hr, Th = 60 sec, and rcell = 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size =10 45 Figure 4.10 Average paging traffic versus average paging delay with v = 40 km/hr, Th = 60 sec, Xcall = 1 call/hr, LA size = 5, and rcM = 1 km. (a) Scheme A. (b) Scheme B 46 V Figure 4.11 Performance of Scheme A when a different LA entry point is used with = 40 km/hr, Th = 60 sec, rcell = 1 km, and Xcall = 1 call/hr. (a) average paging delay, (b) average paging traffic 48 Figure 5.1 Sensitivity of the average paging delay performances of Selective paging, Scheme A, and Scheme B to uncertainty in v for Th = 60 sec, 5 = °°, a9 = 4.2, rcell = 1 km, XcM = 1 call/hr and the system's v = 40 km/hr 50 Figure 5.2 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in v for Th = 60 sec, 5 = °°, ae = 4.2, rcell = 1 km, Xcell = 1 call/hr and the system's v = 40 km/hr 51 Figure 5.3 Sensitivity of the average paging delay performances of Selective paging, Scheme A, and Scheme B to uncertainty in Th for v = 40 km/hr, d = °°, ae = 4.2, rcell = 1 km, Xcell - 1 call/hr and the system's Th - 60 sec 53 Figure 5.4 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in Th for v = 40 km/hr, 2 = - , a9 = 4.2, rcell = 1 km, Xcell = 1 call/hr and the system's Th = 60 sec 54 v i Figure 5.5 Sensitivity of the average paging delay performances of Selective paging, Scheme A, and Scheme B to uncertainty in ae for P = 40 km/hr, Th = 60 sec, 2 = oo, rcell = 1 km, \ c e l l = 1 call/hr and the system's ae = 4.2 55 Figure 5.6 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in a 9 for i> = 40 km/hr, Th = 60 sec, 3 - oo, rcell = 1 km, lcell = 1 call/hr and the system's ae = 4.2 56 Figure 6.1 Mobile movements within the service area of size 5 (# of rings) 58 Figure 6.2 Overlapping of the two mobile users' LA's of size 2 (# of rings) 59 Figure 6.3 Average paging traffic versus average paging delay for single user with P = 40 km/hr, Th - 60 sec, rcell = 1 km, and Xcall = 1 call/hr, SA size = 5, LA size = 2, and # of users = 1. (a) Scheme C. (b) Scheme D 61 Figure 6.4 Performance of Scheme C and Scheme D with v = 40 km/hr, Th = 60 sec, rcell - 1 km, \ c M = 1 call/hr, SA size = 5, and LA size = 2. (a) average paging delay, (b) average paging traffic 63 vii Acknowledgment I would like to express my sincerest gratitude to my research supervisor, Dr. Cyril Leung, for his invaluable advice and constant guidance during the course of my research. I also thank my friends and colleagues at the University of British Columbia who made my studies here more enjoyable and rewarding. Especially, I would like to thank Byung-Kyu Chun, Sinclair Chi, Chris Kim, Peter Kim, and Andrew Chung for their valuable friendship and encouragements. They always bring smiles to my face. Finally, but foremost, I would like to thank my family for their endless love. I dedicate my hard work to my parents who are watching me from above. This research was partially supported by NSERC grant OGP0001731. viii Chapter 1 I N T R O D U C T I O N Conventional personal communication technologies, such as telephones, can no longer fully satisfy the needs of today's highly mobile people. Now there is a growing demand for a communication system that enables its subscribers to initiate and receive calls without any restric- tions on their locations. To provide such a capability, cellular communication networks were introduced in the early 1980's. Since its introduction, cellular communication systems around the world have been enjoying 33 percent to 50 percent growth rates [1]. Cellular communication is evolving from a costly service with limited availability toward an affordable alternative to the wired telephone service [2]. 1.1 Background The major drawback of a conventional wireless communication system that uses one base station with a powerful multi-channel radio transceiver is the limited wireless bandwidth. To support a large number of subscribers with a limited number of wireless channels, a "cellular" architecture was developed. Instead of having one high power base station, a cellular network employs a number of low power base stations, each covering a small surrounding area called a "cell". The service area is partitioned into cells, and each cell is assigned a number of channels. Although the number of active connections within each cell cannot exceed the number of channels available, the same channels may be reused in another cell as long as the two cells are separated by a sufficiently large distance to limit the interference [1]. By using the same channel in more than one cell, the cellular network is able to support more subscribers. In order to deliver incoming calls to the mobile terminals (MT's) roaming in the service area, the mobile switching center (MSC) needs to keep track of each MT's location. This is 1 Chapter 1 INTRODUCTION 2 referred to as mobility management. A number of cells are grouped to form a location area (LA), and each MT reports its current LA to the system according to the location updating scheme. The location updating scheme determines when and how often the MT's location should be registered with the MSC. When a call comes in for a subscriber, the MSC delivers the call to the MT by paging the MT's last known LA. The paging process follows the paging scheme. Efficient location updating and paging schemes are needed to reduce the paging delay and traffic. Many location updating schemes have been studied in [1], [3], [4], [5], and [6]. Also, various paging schemes have been proposed in [3], [7], [8], [9], and [10]. 1.2 Motivations and Objectives When a call comes in for a mobile user, the cells in the user's last registered LA are paged. The most commonly used paging scheme, Flood paging, requires sending a paging signal to all the cells in the LA. In order to support the rapidly increasing number of subscribers, a cellular network needs a more efficient paging scheme. If a mobility model for MT's is available, the probability of an MT being in a given cell in the LA can be estimated. Then, cells in the LA can be grouped into subsets and each subset can be paged successively until the MT is found. The paging delay will be higher than when using Flood paging. However, by carefully grouping cells, the increase in the average paging delay can be kept small while greatly reducing the average paging traffic. The main objectives of this thesis are: 1. To study the groupings of cells in the LA for successive paging stages. 2. To study the trade-off between the average paging delay and the paging traffic. Chapter 1 INTRODUCTION 3 3. To study the effects of making use of elapsed time since the last location update. 4. To study the effects of uncertainty in choosing user mobility model parameters. 5. To implement multicasting schemes using paging schemes 1.3 Outline of the Thesis In Chapter 2, a mobility model for a mobile vehicular user is described. In Chapter 3, a location updating scheme is described along with the cell and LA geometries. In Chapter 4, two different generalized paging schemes are proposed. The first generalized paging scheme will use the elapsed time since the last location update to estimate the mobile user's current location. The second generalized paging scheme will try to locate a mobile user without using the elapsed time since the last location update. The two schemes' average paging delays and average paging traffics are evaluated by both simulation and approximation. The results are compared to Selective paging. We evaluate the gain in performance when the time elapsed since last location update is used to make paging decisions. In Chapter 5, the sensitivity of the generalized paging schemes to uncertainty in user mobility parameter values is studied. Generalized paging schemes are used to implement generalized multicasting schemes in Chapter 6. The main results are summarized in Chapter 7 and some suggestions for future work are listed. Chapter 2 USER MOBILITY MODEL In order to describe mobile users' movements within the service area, a reasonable mobility model is needed. Different mobility models, such as the uniformly distributed model described in [3], have been proposed previously. However, considering the layouts of roads and the fact that a mobile telephone user tends to travel toward a certain destination, a directional random walk [11] seems to be a better mobility model. In Chapter 3 and Chapter 4, it will be used as the mobility model of a vehicular telephone user. 2.1 Review of Directional Random Walk Model of [11] In the directional random walk model, a mobile user is assumed to travel toward the principal direction in discrete and statistically independent steps, where the principal direction is defined by the path drawn from each movement step's starting point to the destination. For each movement step, the user selects a random angular deviation (3 with p.d.f. /5(P) from the princi- pal direction, a random speed v with p.d.f. fv{v), and a random holding time th with p.d.f. fh(t); thus for the duration th of this step, the user maintains the chosen angular deviation and speed. This random walk model is illustrated in Figure 2.1. destination • travelling step principal direction starting point Figure 2.1 Random walk model 4 Chapter 2 USER MOBILITY MODEL 5 The speed distribution is assumed to be Gaussian with standard deviations of 0.17 times the respective means. Thus, fv(v) = -L= e 2°2« (2.1) where od = 0.17 x v. To describe the distribution of mobile users' angular deviations from the principal directions, an Alpha p.d.f. is used with mean deviation of zero. Or. 2[ i + (^p 2]tan '(otpji) 0 ; -n < (3 < n ; otherwise (2.2) Assuming that a mobile user moves in the forward direction with a probability of 0.95, the parameter, oĉ , is set to 4.2. The p.d.f. is plotted in Figure 2.2. The p.d.f. of the holding time for each step, fh(t), is modeled by an exponential distribu- tion with parameter Xh = }- where ih is the mean holding time, i.e. fi, - v to ; t>0 ; otherwise (2.3) Chapter 2 USER MOBILITY MODEL 6 - 3 - 2 - 1 0 1 2 3 angular deviation (rad) Figure 2.2 Angular deviation p.d.f. with otp = 4.2 2.2 Simulation results Using the directional random walk mobility model, the p.d.f of the radial distance from the starting point given the travel time t, fR(r\t), is obtained through simulation. Also, the p.d.f of the angular deviation from the principal direction given the travel time t, /0(0|O, is obtained. The destination is assumed to be at infinite distance from the starting point for the random walk simulation. The required parameters for the random walk model simulation are the mean speed, v, and mean holding time, th. The simulations are based on the time increments of 4 seconds and the sample size is 400,000 trips for each p.d.f. The frequency distributions of the radial distance and angular deviation are obtained with sampling bin sizes of 175 m and 0.01 n respectively. Then the frequency distributions of the radial distance and angular deviation are normalized by the number of samples and are scaled by 4~ and to estimate the radial distance and angular Ar A0 deviation p.d.f.'s. The radial distance and angular deviation p.d.f.'s obtained from simulation are Chapter 2 USER MOBILITY MODEL 7 shown in Figure 2.3 and Figure 2.4. The 99% confidence interval associated with each simulation point is within ±5 % of the average values plotted throughout this thesis. 2.3 Approximating the Radial Distance and Angular Deviation P.d.f.'s It is very hard to derive the analytical expressions of the radial distance p.d.f. fR(r\t) and the angular deviation p.d.f. /0(6|O from the random walk model. Thus, fR(r\t) and /@(6|r) obtained from simulations (in Section 2.2) are used to approximate their analytical forms. 2.3.1 Radial distance p.d.f. For convenience, the starting point is assumed to be at the origin of a Cartesian coordinate system and the destination is assumed to be at +°° on the x-axis. The units for time, distance, and speed are in seconds, meters, and meters per second respectively. The radial distance p.d.f. fR(r\t) obtained from simulation is fitted by an asymmetric Gaussian p.d.f., i. e. fR(r\t)> (r-m) 1 A,^=e 2 o i ; r<m „ 2 2na. A~—L=e 2a2 ; m<r 2 K O 2 (2.4) 2 2Y where a0 = vo, , A, = , and An = -—— . 1 1 1 1 + y 1 1 + y In order to obtain an approximate expression for f R(r\t) at time t, the three parameters of the asymmetric Gaussian p.d.f., a,, Y, and m, must be obtained as functions of time. Chapter 2 USER MOBILITY MODEL T radial distance (km) Figure 2.3 Radial distance p.d.f. of random walk from simulation with i> = 30 km/hr and th = 60 sec. T t=90 min t=50 min t=10 min - 3 - 2 - 1 0 1 2 3 angular deviation (rad) Figure 2.4 Angular deviation p.d.f. from simulation with v = 30 km/hr and = 60 sec. Chapter 2 USER MOBILITY MODEL From [11], 2 _ I I" 1 ° l " \max[fR(r\t)] \ li, ( 2 ' 5 ) ,2 and max[f R(r\t)] = max[f x(x\t)] (2.6) As shown in Figure 2.5, the x-displacement Dx of the mobile user after time t can be expressed as the sum of the x-components of the travelling steps taken, i.e., N{t) i = 1 where x- = vtth cos((3.) and ^V(f) = number of steps taken in time t. In [11], it is assumed that Dx has a Gaussian distribution by nature of the central limit theorem. However, based on the simulation results, it is found that this assumption is not very accurate. In Figure 2.5 Analytical directional random walk model Chapter 2 USER MOBILITY MODEL 10 order to more accurately approximate fx(x\t), a multiplicative correction function f (t) is applied to the Gaussian distribution. The peak value of fx{x\t) is then fM) max[f x{x\t)} = (2.8) Since each travelling step is statistically independent and Dx has the property shown in Eqn. (2.7), a2D ~N(t)o2x. ( 2 . 9 ) where Cx = X = v2fJcos2(p) -(vrAcos(p)) (2.10) v2rJcos2((3) -(vr.cos(p)) 2 0"2, can be obtained numerically, and the required adjusting function fa{t) is found to be fa(t) = -1.87 xl0_11f3 + 2.2 xlffV- 8.658 xl0_4r + 3.0636 (2.11) Note that, since t can range from 0 to 5400 seconds, the cubic term is not necessarily negligible. From Eqn. (2.6), Eqn. (2.8), and Eqn. (2.9), we have Chapter 2 USER MOBILITY MODEL u max[fR(r\t)] = max[fx(x\t)] = f g ^ (2.12) 2nN(t)o2x In [11], N(t) is obtained by solving Eqn. (2.12) (without fa(t)) for N(t) using the values of max[fR{r\t)] from simulation. However, the values of N(t) found in [1 1] do not seem to represent the number of steps taken by the mobile user in time t, which should have the expected value of = . A more direct method is applied to obtain N(t) instead. Since N(t) is the number of 'h steps travelled in time t, N(t) is obtained from simulation by counting the number of steps taken by the mobile user at time t. Five different parameter sets are used to plot Figure 2.6, and the five different curves show the same relationship. After curve fitting, N{t,th) = - 6.94 x 10" t_ 3 + 1.85 x 10" + 9.350 x 10" + 0.2134 (2.13) By substituting Eqn. (2.12) into it, Eqn. (2.5) can now be expressed as Next, the parameter y, which represents the ratio between the variances of the first half Gaussian p.d.f. and the second half Gaussian p.d.f. in the asymmetric Gaussian p.d.f., is approximated by y(th) = - 1.21 x 10 \th)3 + 5.224 x 10 \th)2 - 7.159 x 10 3(th) + 0.8813 (2.15) Finally, by rearranging Eqn. (B.10), the parameter m can be expressed as m{t,th) = r{v,t,th)- \-o^[y(th)-l] (2.16) Chapter 2 USER MOBILITY MODEL 12 0 50 100 150 200 t_ Th Figure 2.6 Plot of N(t) versus = for parameter sets {v km/hr, 7, sec}: {20,30}, {30,60}, {30, 180}, {40, 30), and {50, 90} where r(v, t, th) is the mean radial distance of the mobile user at time t with the mean holding time th and can be approximated by adding an offset value to the mean distance in x direction as r(y, t, th) = x(t, v, p) + c(v, th) n _ (2.17) = vcos(P)f+ c(v, th) The offset c(v, th) is approximated as c(v, Th) = 3.24(v)2 - 37.8(v) + 0.0096(^)2 + 1.3586(^) + 150.3608 (2.18) The resulting approximate radial distance p.d.f.'s are plotted in Figure 2.3. The goodness of fit of the radial distance p.d.f. is obtained by integrating the absolute difference between the approximate and simulation pd.f.'s. Figure 2.7 shows the goodness of fit for various random walk parameter sets. Chapter 2 USER MOBILITY MODEL 13 c _ 4-1 _ > S 3 O 20 40 mean speed = 20 km/hr mean speed = 30 km/hr mean speed = 40 km/hr 60 time (min) (a) 80 100 120 o c 6 mean hold time = 30 sec mean hold time = 90 sec mean hold time = 120 sec 20 40 60 80 100 120 time (min) (b) Figure 2.7 Goodness of fit of the approximate radial distance p.d.f. (a) th = 60 sec (b) v = 50 km/hr The goodness of fit is shown in terms of the cumulative difference. The cumulative differ- ence represents the non-overlapping area between two p.d.f.'s. Thus the maximum cumulative difference value is 2 (no overlapping occurs) and the minimum cumulative difference value is 0 (two p.d.f.'s are identical). 2.3.2 Angular deviation p.d.f. The angular deviation p.d.f. is fitted by a Gaussian p.d.f. when t is small and by an Alpha .p.d.f. when t is large. Thus, the angular deviation p.d.f, / 0 ( 9 | f ) , is approximated by combining these two p.d.f.'s with a weighting function of t, and can be expressed as Chapter 2 USER MOBILITY MODEL 14 / Q ( 9 | r ) - p ( 0 / C ( 6 | 0 + [1 - p(t)]fA(Q\t) (2.19) where fG(Q\t) is the Gaussian p.d.f., fA(Q\t) is the Alpha p.d.f., and p(r) is the weighting function which produces a positive number less than or equal to 1. The Gaussian p.d.f., fG(Q\t), is expressed as 1 2(7^(0 e (2.20) 2na2(t) where o"G(f), the variance estimated by noting the peak values of p.d.f.'s from simulation, is a2G(t,th) = 1 . 8 6 1 3 x 1 0 + 5 . 0 5 9 7 x 1 0 + 0 . 0 8 0 5 1 . 5 5 8 0 X 10 • 0 . 0 0 8 3 f \ t - a 3 3 4 4 i t J 0 . 0 8 e + 0 . 0 0 2 5 0 . 0 8 e + 0 . 0 0 1 7 o s l r / 2 7 27 < L u < 132 132 <\L (2.21) The Alpha p.d.f., fA(Q\t), is expressed as 2[l+aA(t)Q ]tan (aA(t)n) 10 ; -K<0<K ; otherwise (2.22) aA(t) is approximated to be Chapter 2 USER MOBILITY MODEL 15 aA(t, th) = ®(t, th) (2.23) where m(t, th) = - 5 . 9 9 6 9 X 10"6f=T +4.1880X 10 4 | ' L +0.1718 •0.0117 L [+0.2335 UL -2.7376x10 7|_f+4.9513 x 10 5 | _ •0.0036 0.0840e +0.0412 1_ i 122I 0.0600e " +0.0319 0 < I _= < 25 V 60<|̂ _J< 120 120 < L .1,. (2.24) As the weighting function, p(t), a scaled and vertically shifted arctan function is used to provide a smooth transition from 0 to 1. - 1 -1 P(t,t.) = - t a n - ( \ - a t -b (2.25) The parameters a and b, which control the function's rate of change, are set to be 0.1 and 1 respec- tively. The goodness of fit of the angular deviation p.d.f. is obtained by integrating the absolute difference between the approximate and simulation p.d.f.'s. Figure 2.8 shows the goodness of fit for various random walk parameter sets. Chapter 2 USER MOBILITY MODEL 100 120 time (min) (a) Figure 2.8 Goodness of fit of the analytical angular deviation p.d.f. (a) th = 60 sec (b) v =50 km/hr Chapter 3 C E L L U L A R L A Y O U T A N D L O C A T I O N A R E A U P D A T I N G S C H E M E In this chapter, the layout of cells and the structure of a location area in a cellular environ- ment are described along with the dynamic LA-based location updating scheme, which will be used throughout this thesis. 3.1 C e l l u l a r L a y o u t M o d e l The service area of a cellular communications network is divided into smaller units, called cells. All cells are assumed to have the same size and shape. As shown in Figure 3.1, cells are usually assumed to be hexagonal in shape. Each cell has a base station (BS) in it for its coverage. The BS in a cell broadcasts a unique identity number and the mobile users can listen in while they are within the cell's coverage area. A mobile user can identify the cell he is in by choosing the BS from which the strongest signal is received. Figure 3.1 Cellular System Layout Model 17 Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 18 3.2 Location Area Current cellular networks partition their service areas into a number of location areas (LA's). Each LA consists of a group of cells and each mobile user performs a location update whenever it crosses an LA boundary [12]. Thus a mobile user's current LA is always known. Each LA has a number of rings of cells. The innermost ring (ring 0) consists of only one cell and this is the center cell. Ring 0 is surrounded by ring 1 which in turn is surrounded by ring 2, and so on. The size of an LA is determined by the number of rings the LA has. Figure 3.2 shows an LA of size 4. Figure 3.2 Location Area of size = 4 For simulation, hexagonal cell shapes are assumed. However, for the purpose of mathematical analysis, the rings in an LA are taken to be circular. The equivalent radius, reqv, of a cell is the radius of a circle that has the same area as a hexagonal cell as shown in Figure 3.3. Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 19 or Figure 3.3 Equivalent radius of a cell n r e q v = 6 1 2 .fit 2r"«S mU (3.1) 0.9094 r cell (3.2) th . For an LA, the rings are considered to be circular also. For the k ring, the equivalent radius, Reqv{k), is the radius of a circle that has the same area as the total area of all cells in rings, 1, 2 , k . From [11], (3.3) where N(k) is the total number of cells in rings 1, 2, 3, k. N(k) = \ +3k( \ +k) (3.4) Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 20 Figure 3.4 Circular LA model of size = 4 3.3 L o c a t i o n U p d a t i n g S c h e m e According to the location updating scheme, each mobile user registers its current location with the system. Thus different location updating schemes will result in different location updating traffic in a cellular system. Since the control channel capacity is limited by the location updating and paging signal traffic, an effective location updating scheme is very important. Generally, location updating schemes can be divided into two groups: static and dynamic. In static LA-based scheme, location updates are performed when mobile users cross fixed LA boundaries. Although they are simple to implement, static LA-based schemes are not very efficient since a mobile user travelling near LA boundaries will generate an excessive amount of location updating traffic. Dynamic LA-based schemes allow a new LA to be formed each time a mobile user crosses an LA boundary so that the mobile user is placed at the center of the new LA. In [5], a dynamic location updating scheme using overlapping LA's is proposed. When a mobile user updates his Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 21 location to the system, the cell he is currently in is reported as the center cell of the new LA. Having received the update from the mobile user, the system determines the new LA's member cells and sends their i.d.'s to the mobile user. The user can now use these i.d.'s to determine if he has exited the LA by comparing them to the i.d.'s broadcast by the current cell. Throughout this thesis, it will be used as the location updating scheme. 3.3.1 Location updating conditions A location update is performed when any of the following 4 events occurs. 1. The mobile user starts a journey. The initial location update at the start defines the first LA and lets the system know the user is ready to move. 2. The mobile user crosses an LA boundary. When a mobile user exits the LA, a location update is performed to determine a new LA. 3. A call comes in for the mobile user. When a call comes in for the mobile user, a location update is performed during the call setup. The current location of the mobile user in the LA can be obtained without having an additional connection to the system. 4. The mobile user ends a journey. A final location update is performed when the mobile user reaches the destination. It notifies the system that the user will be in the current location until event 1 occurs. Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 22 3.3.2 Location updating traffic We define a location updating traffic as a registration of the mobile user's location with the system. The location updating traffic resulting from event 1 (the mobile user starts a journey), event 2 (the mobile user crosses a LA boundary), and event 4 (the mobile user ends a journey) is obtained by simulation and approximation. Since the location update due to the event 3 (a call comes in for the mobile user) is performed during the call setup, it is not considered here. To approximate the location updating traffic due to the event 2, the time a mobile user takes to exit an LA, icross, is estimated by i c r o s s - R e a v W x l (3-5) P where R is the size of the LA in number of rings and v is the mobile user's speed in the principal direction. The user's speed in the principal direction is vp = v • cos((|>) (3.6) where v is the mobile user's mean speed and <]) is the angular deviation of the user's travelling direction from the principal direction. Then the location updating traffic per unit time resulting from LA boundary crossings, Tcross, is Tcross ~ (3-7) cross The location updating traffic per unit time due to the events 1 and 4 can be approximated by Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 2 Tstart, end ~ z. (3 ''trip where itri ~ = .{d is the mean trip length.) VP The total location updating traffic per unit time is then approximated as T ~ Tcross 1start, end For v = 40 km/hr, th = 60 sec, and d = 100 km, the location updating traffic values shown in Figure 3.5. Chapter 3 CELLULAR LAYOUT AND LOCATION AREA UPDATING SCHEME 24 ,3 4) •£5 &, 3̂ O W> C o3 —) a, 3 ,3 3 30 25 20 15 10 1 1 1 1 I 1 1 1 \ approximation simulation 1 1 1 1 I I I I 30 25 h 20 15 10 h 10 LA size (in # of rings) (a) 1 1 1 1 1 1 1 1 approximation simulation 1 1 1 1 I l l 1 10 LA size (in # of rings) (b) Figure 3.5 Location updating traffic versus LA size for v = 40 km/hr, th = 60 sec, and d - 100 km. (a) rcM = 1 km (b) rcell = 2 km. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES A location area paging scheme is used to page the mobile user in the LA when a call comes in. Based on the location updating scheme described in Chapter 3, the LA each mobile user is currently in is always known to the system. Thus the paging process is always limited to within a LA. The number of cells paged and paging steps needed to find the mobile user are referred to as the paging traffic and paging delay respectively. In order to minimize the paging delay and paging traffic, an efficient paging scheme is required. The most common and simple paging scheme known as Flood paging pages all cells in the LA at once [13]. Although this scheme has the minimum paging delay of 1, it has the maximum paging traffic which equals the number of cells in the LA. Other known paging schemes, such as Spread paging and Selective paging, try to reduce the paging traffic while keeping the paging delay reasonably low by using a number of paging stages [8]. In this chapter, a more efficient location area paging scheme, called generalized paging, is presented. 4.1 Call Arrival Model A Poisson process with rate Xcall arrivals per unit time is used to model call arrivals. The p.d.f. of the inter-call arrival time, /Cfl//(0 , is exponentially distributed with mean T-~~ • In °der ^call to analyze the paging scheme performance, the p.d.f., fc(t), of time between a call arrival and the last location update, tc, is approximated by simulation [11]. The mean time for a mobile user to exit an LA of radius R from the center of the LA is 25 Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 26 R_ v„ (4.1) where vp = vcos((|)), mean velocity in the principal direction. Then, fc is approximated by fc where fc(t) = f. \ -Kail1 A K a l l e jt-c) ; 0<r<c ; c < t ; otherwise (4.2) A = l-e (4.3) B = 2[1 -A(l -e )] B A^X ~K""C "'call" (4.4) (4.5) c = f(tR)g(ih) (4.6) '0.00023 )̂ + 0.4307(r̂ ) - 8.7879 .0.8591̂ -204.8937 0 < iR < 900 900 <i R (4.7) g(ih) = -0.0016/-,,+ 1.1041 ; 30<fA<180 (4.8) The simulation and approximate p.d.f.'s of f At) and their goodness of fit are plotted in Figure 4.1 and Figure 4.2 for Xcall = 1 call arrival/hr and Xcall = 10 call arrival/hr. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 0.2 0.15 0.05 K- approximation simulation LA size = 2 rings LA size = 4 rings LA size = 6 rings LA size = 8 rings time (min) (a) LA size = 10 rings 40 0.2 0.15 0.1 0.05 LA size = 2 rings LA size = 4 rings approximation simulation LA size = 6 rings LA size = 8 rings LA size = 10 rings 40 time (min) (b) Figure 4.1 P.d.f.'s of the call arrival time since the last location update for v = 40 km/hr, th = 60 sec, and rci km. (a) Xcall - 1 call arrival/hr. (b) Xcall = 10 call arrival/hr. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 28 Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 29 4.2 Cell Numbering Notation A notation to identify each cell in the LA is described in this section. Two numbers, / and j, will be used to identify each cell in the LA. The i, 0 < / < LAsize, will denote the ring number th in the LA and the j, 0<j< [N(i) -N(i-\)] ,will denote the cell number in the / ring. As shown in Figure 4.3, the first cell above the starting line in each ring will be given the cell number of 0 and the rest of the cells in each ring will have sequentially increasing cell numbers in the counter-clockwise direction. From now on, a cell will be denoted as cell(ij). Figure 4.3 Numbering of cells in an LA of size - 4. 4.3 LA Ring Probability The ring probability refers to the probability that a user is in a particular ring in its registered LA at a particular time. To estimate the ring probabilities, the p.d.f. of the radial distance, r, of a mobile user at time t is used. Because the mobile user must be inside the LA, the Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 30 p.d.f. of the radial distance obtained in Section 2.3.1 is limited by the condition that the user has not exited the LA. If the LA size is R, this p.d.f. is given by fR{r\t,withinLA) = f R(r\t, r < Reqv(R)) = %7*> (4-9) In Section 3.2, the equivalent distance for each ring in an LA is defined. Using Eqn. (3.3), ith ring's width can be expressed as Reqv(i) - Reciv{i - 1) • Then the ring probability for ith ring at time t is given by pw»_('.0« \ fR(r\t,withinLA) dr (4.10) * « , „ ( « - 1 ) 4.4 L A A n g u l a r P r o b a b i l i t y The angular probability refers to the probability that a user is in a particular angular sector th in its registered LA at a particular time. From (3.4), we know the i ring in the LA has [N(i)-N(i- th 1)] cells in it. Thus the / ring can be divided into [N(i)-N(i-1)] equal sectors, which correspond to cells, and the angular probability for cell(ij) at time t can be estimated using the angular deviation p.d.f. of the mobile user at time t, /0(0|O , in Section 2.3.2 as (4.11) Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 31 where 0 • • corresponds to the angular range covering cell(/j). 4.5 L A C e l l P r o b a b i l i t y A cell probability refers to the probability of a user being in a given cell in the LA. The cell probability for each cell at time t can be approximated by a product of the cell's ring probabil- ity and the angular probability as shown in Figure 4.4. Then the cell probability for cell(i, j) at time t can be expressed as Pceii(h h te) = Pring(i, te) -Pang{i, j, te) (4.12) where te is the elapsed time since the last location update. Figure 4.4 Cell probability illustration for ce//(2,l) Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 32 4.6 Review of Other Paging Schemes In this section, three paging schemes, Flood paging, Spread paging, and Selective paging, are described. In Flood paging, when a call comes in for a user, all the cells in the user's registered LA are paged simultaneously. Thus, it has the minimum average paging delay of 1, but it also has the highest possible average paging traffic. In Spread paging, the system pages the St center ring (cell) first. If the user is not found, the next rings, starting from the 1 ring, are paged in order. Since the inner rings contain less cells, Spread paging tries to reduce the number of cells paged by paging the rings with fewer cells first. In Selective paging, the ring probabilities are evaluated as described in Section 4.3. When a call comes in for a user, the system pages the ring with the highest probability first. If the user is not found, the ring with the second highest probability is paged and so on until the user is found. 4.7 Generalized Paging Schemes In this section, two new paging schemes, called generalized paging scheme with time- stamp and generalized paging scheme without time-stamp, are described. For convenience, we will refer to generalized paging scheme with time-stamp as Scheme A and generalized paging scheme without time-stamp as Scheme B from now on. Using the directional random walk mobility model and the location updating scheme described in Chapter 2 and 3, the cell probabili- ties in the LA are estimated. Then cells in the LA are grouped into a number of subsets, Ns, according to their cell probabilities. We will have two different ways of grouping cells into subsets. The first way to group the cells is that, for each subset, a threshold parameter, pi, is used to select its member cells. The cells with the highest cell probabilities are added to the first subset until the sum of their cell probabilities reaches the first threshold parameter. The next cells are Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 33 added to the second subset until the sum of their cell probabilities and the first parameter reaches the second parameter. This process continues until all cells are grouped into the subsets. The second way to group the cells is choosing a fixed number of cells in a subset. All subsets will have an equal number of cells, N, in them. 4 .7 .1 W i t h l o c a t i o n u p d a t e t i m e - s t a m p (Scheme A) We assume that the time of the location update is registered with the system. The time, te, between the call arrival and the last location update is used to estimate the user's current location and to select the cells to be paged. When a call comes in, we evaluate all cells' cell probability estimates at te given by Eqn. (4.12). Assuming an LA size of R, let P c e l ](£ e) be a vector contain- ing the estimates of cell probabilities, i.e. Pcel l (^) = PcellW. °> P c e l l V ' l ' t e ) Pcell(R, 6R-\,te). (4.13) Then Pcen( ê) is sorted in descending order (highest probability as first element) to yield s s s the vector P c e l l(£ e) and the cells in Pce\\(te) are divided into subset vectors, P c e l ] 0(te), s s s P ce l l , l ( 0 ' P ce l l , 2 < X ) ' - ' a n d P ce l l , A ^ O • F o r t h e first w a v o f grouping cells, cells are grouped such that, Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 34 ™ m ( P c e l l , .•('*)) ^ 0>i - P i - l ) (4.14) where sum(X) represents the sum of X's elements and / > 0. For the second way of grouping s cells, the first Nc cells in Pce]1(7e) are put into the first subset vector and the next Nc cells are put into the second vector and so on. th S If the user is in a cell which belong to the i subset vector, P c e l l •, the paging delay is i+1. Therefore, the average paging delay at time t is D(t„) = 1 2 ... Ns+\\ xP 5(g. (4.15) where ™ m ( P c e l l , o ( f e ) ) * M m ( P c e l l , l ( O ) J M m ( P c e l l , ^ ( f e ) ) (4.16) Averaging D(te) using the call arrival p.d.f., fc(t), we obtain the average paging delay as D = JD(t)fc(t)dt. (4.17) .th If the user is in a cell which is in the i subset, the paging traffic is the total number of Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 35 .th cells in 0 through i subset. Then the average paging traffic at time t is no = K M X 1 0 0 1 x P s ( U (4.18) [ ~~I s th . J is the transpose operation and Ncell(fe) is a vector whose i component is the number of cells in ith subset. The average paging traffic is obtained by averaging T(t ) using the call arrival p.d.f., i.e. T = \T{t)fc{t)dt. (4.19) 4.7.2 Without location update time-stamp {Scheme B) In this section, it is assumed that the time of the location update is not registered with the system. Thus, when the location update occurs, only the mobile user's current cell information is known. Then the estimates of cell probabilities do not depend on the elapsed time, te, since the last location update. When a call comes in for a user, the same sets of cells are paged in the same order without considering t . The cell probability estimate for cell(i, j) can be expressed as (4.20) where Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 36 PringW = \Pring&t)fc{t)dt (4.21) and P a n g V J ) = IPangVJ'VfcW* (4.22) Assuming an LA size of R, let P c e l l be a vector containing the cell probability estimates, i.e. PceuiO, 0) P c e l l U ' O ) P c e l l U ' l ) Pcell(R, 6R-l)_ (4.23) Then P c e ] 1 is sorted in descending order (highest probability as first element) to yield the S S S S S vector P c e l l and the cells in P c e l l are divided into subset vectors, P c e l l 0 , P c e l l j , P c e l l 2 , •••, and P c e l l N . For the first way of grouping cells, the cells are grouped such that, ™ m ( P c e l l , i ) ^ ( P i - P « - l ) (4.24) , where sum(X) represents the sum of X's elements and / > 0. For the second way of grouping s cells, the first Nc cells in P c e l l are put into the first subset vector, the next /Vc cells are put into the second vector and so on. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 37 If the user is in a cell which belong to the ith subset vector, P^ell •, the paging delay is i+l. Therefore, the average paging delay is D(te) = 1 2 ... iVj+l]xPs (4.25) where P s = J " m ( P ce l l , o ) J M m ( P c e l l , l ) ™ m ( P c e l l , NS) (4.26) .th If the user is in a cell which is in the i subset, the paging traffic is the total number of .th cells in 0 through i subset. Then the average paging traffic is T = N cell X 1 0 0 1 xP, (4.27) is the transpose operation and N c e l l is a vector whose i component is the number of cells in i'h subset Chapter 4 GENERALIZED LOCA TION AREA PAGING SCHEMES 38 4.8 N u m e r i c a l R e s u l t s The two generalized paging schemes' simulation and approximation results are presented in this section. For the simulation results, a user travels toward a destination (at infinite distance) from the center of an LA following the directional random walk model in Section 2.1. As the user crosses an LA boundary or receives a call (Section 4.1), his location is updated using the dynamic LA-based location updating model described in Section 3.3. When a call comes in, the user is paged based on the cell probabilities obtained as follows: For Scheme A, the user is allowed to travel toward the destination for certain durations of time (e.g. 1 minute, 2 minutes, 3 minutes and etc.). Then we note the user's locations within an LA at these different times. We ignore the user's location if he has exited the LA. From these statistics, the cell probability sets for different times are calculated. For Scheme B, the user's location within an LA is noted whenever a call comes in for the user. From these statistics, the cell probabilities are calculated. For the approximate results, the cell probabilities are estimated and the paging performances are evaluated as described in Section 4.7.1 for Scheme A and in Section 4.7.2 for Scheme B. The paging schemes' performances are measured in terms of their average paging delays and traffics. The proposed two generalized paging schemes are compared to Flood paging, Spread paging, and Selective paging. A mean speed of 40 km/hr, mean velocity hold time of 60 sec, cell radius of 1 km, and call arrival rate of 1 call/hr are assumed. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 39 4 .8 .1 P e r f o r m a n c e c o m p a r i s o n The performance of Flood paging, Spread paging, and Selective paging are shown in Figure 4.5. Although Flood paging has the smallest average paging delay of 1, it has the largest possible average paging traffic. Spreading paging's average paging delay and traffic are always higher than those of Selective paging. With an LA size of 10, Selective paging's average paging delay and traffic are only about 35% and 55% of Spreading paging's average paging delay and traffic. Selective paging outperforms Spreading paging, and it will be used as the reference when showing the performances of two generalized paging schemes. Figure 4.6 shows the performances of the two generalized paging schemes using a fixed number for each LA size to group cells into subsets. By trying out different fixed number of cells to form subsets, we found that using the numbers, 3, 4, 5, 6, 7, 8, 10, 13, 16, and 20 as the Nc's for the LA sizes, 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10, results in reasonably low average paging delay values that are close to 1 and significantly lower average paging traffic values than other paging schemes. We can see that the average paging delay and traffic are always lower than those of Selective paging scheme. For an LA size of 10, the average paging delay and traffic are reduced by about 45% and 65% when Scheme A is used instead of Selective paging and by about 35% and 55% when Scheme B is used. When Scheme B is compared to Scheme A, we can see Scheme A always performs better. With an LA size of 10, Scheme A's average paging delay and traffic are about 15% lower than those of Scheme B. Selective paging, Scheme A, and Scheme B are also compared with changes in parameter values in Figures 4.7, 4.8, and 4.9. The mean speed (v), mean velocity hold time (th), and call Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES LA size (in # of rings) (b) Figure 4.5 Performance of Flood paging, Spreading paging, and Selective paging with v = 40 km/hr, th = 60 rcell = 1 km, a n < ^ ^-cuii = 1 call/hr. (a) average paging delay, (b) average paging traffic. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 41 1 2 3 4 5 6 7 8 9 10 LA size (in # of rings) (a) BO Cu > 1 2 3 4 5 6 7 8 9 10 LA size (in # of rings) (b) Figure 4.6 Performance of Scheme A and Scheme B with v = 40 km/hr, th = 60 sec, rcM = 1 km, and Xcall = 1 call/ hr. (a) average paging delay, (b) average paging traffic. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 42 arrival rate (A-ca//) are changed one parameter at a time while the other two parameters are fixed at the reference values (v = 40 km/hr, th = 60 sec, and Xcall = 1 call/hr). The simulation values are obtained for the LA sizes of 2, 6, and 10. The three figures all show that Scheme A and Scheme B (Scheme A, in particular) perform better than Selective paging in terms of average paging delay and traffic. Also, Scheme A and Scheme B are not very sensitive to changes in parameter values. 4.8.2 Trade-off between average paging delay and traffic In the generalized paging schemes, we can control the number of cells in each subset by either selecting different threshold parameter values or fixed number of cells for each subset. As the number of cells in each subset increases, we can expect the average paging delay to decrease and the average paging traffic to increase. On the other hand, as the number of cells in each subset decreases, it is expected that the average paging delay will increase and the average paging traffic will decrease. Figure 4.10 shows the relationships between the average paging delay and traffic values for Scheme A and Scheme B. Several different sets of 4 threshold parameters (p], p2, p3 , and p4) are used, along with different fixed numbers (Nc) of cells for each paging subset. It can be seen that using the threshold parameters to group cells into subsets does not show any improve- ments over using a fixed number of cells for each subset. It is also noted that Scheme A always outperforms Scheme B, no matter how many cells are grouped into each subset. By controlling the number of cells in each subset, the system can adjust its paging perfor- mance to satisfy different requirements. For example, if the average paging delay is more important than the average paging traffic, the system can increase the number of cells and decrease the average paging delay and vice versa. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 43 -a t o c '5b cu <u bo 03 I— u > cd 30 40 mean speed (km/hr) 50 (a) 2.2 1 "F 2 _ Scheme A • Scheme B - - - -X - - - <u T3 1.8 - Selective paging - A- - bo ; pa gi n 1.6 1 /I J W) cd 1.4 * r av ei 1.2 ' t'1' . - B - B " _L 20 30 40 mean speed (km/hr) 50 7.5 6.5 5.5 4.5 3.5 2.5 it 1 --h 1 — Scheme A Scheme B Selective paging — B — .. . -x - — A- - — 1 bo c '5b cd Cu CJ bO cd u. > 20 30 40 mean speed (km/hr) 50 30 40 mean speed (km/hr) 50 (b) _cd T3 -a bo c '5b cd Cu CJ bO cd u. O > cd 20 30 40 mean speed (km/hr) 50 30 40 mean speed (km/hr) 50 (c) Figure 4.7 Performance of Selective paging, Scheme A, and Scheme B versus the user mean speed for th = 60 sec, Xcall = 1 call/hr, and rcM = 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size = 10. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 1.4 1.2 ¥ 1 Scheme A — B — Scheme B - - - -x - • - Selective paging - A- - A -B- -B- 40 60 80 100 mean velocity hold time (min) (a) .4 .2 2 h 1.8 h Scheme A • _ Scheme B • • • -X • - - Selective paging — A- — 40 60 80 100 mean velocity hold time (min) (b) 2.5 2 1.5 1 1 1 Scheme A -B Scheme B Selective paging — Ar — - - - A - " " ' -A if"" [fc— B B 1 1 40 60 80 100 mean velocity hold time (min) (c) BO c OJ 60 <D > 40 60 80 100 mean velocity hold time (sec) 60 80 mean velocity hold time (sec) 00 60 03 CL, O 60 03 U <L> > 03 60 £= 50 60 C 40 30 20 Scheme A —B— Scheme B Selective paging — A- • -B- 40 60 80 100 mean velocity hold time (sec) Figure 4.8 Performance of Selective paging, Scheme A, and Scheme B versus the mean velocity hold time for km/hr, Xcall = 1 call/hr, and rcell - 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size = 10. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 45 _rt "o T3 60 C '5b rt O. (D 60 > rt 0.5 1 1.5 2 call arrival rate (calls/hr) 0.5 1 1.5 call arrival rate (calls/hr) 2 1.8 1.6 1.4 1.2 1 Scheme A —B— Scheme B Selective paging - A - - 0.5 1 1.5 call arrival rate (calls/hr) (a) (b) I I A -A oo c '5b rt a, a> 60 rt > rt 60 c '5b rt u 60 rt u U > rt o rt 60 rt a, u 60 rt j-. > rt 0.5 1 1.5 2 call arrival rate (calls/hr) LP 25 20 15 10 5 - - ± — - i "A Scheme A Scheme B Selective paging • - - - -X - - - — A- - — i 1 "0.5 1 1.5 call arrival rate (calls/hr) 60 50 A- S 40 30 20 & Scheme A Scheme B ••• it- Selective paging — A- -B- _ J _ -B- _L_ 0.5 1 1.5 call arrival rate (calls/hr) (c) Figure 4.9 Performance of Selective paging, Scheme A, and Scheme B versus the call arrival rate for v = 40 km/hr, th = 60 sec, and rcell - 1 km. (a) LA size = 2. (b) LA size = 6. (c) LA size =10. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 46 30 25 K #=30 # = no. of cells in each group #=20 Selective Paging * Using grouping # A- • Using threshold parameters • #=6 f #=4 average paging delay (a) 30 4 rH#=3o 25 20 r1 15 * , 10 #=20 #=15 #=10 # = no. of cells in each group Selective Paging * Using grouping # A — • Using threshold parameters • & - #=8 | 1 1 1 / #=5 I 1 ~ ^ L 1 #=2 I 1 L -r— J #=1 \ A Jfx—-^ ^ I 1 #=4 | j #=3 average paging delay (b) Figure 4.10 Average paging traffic versus average paging delay with v = 40 km/hr, th = 60 sec, Xcull - 1 call/hr, LA size = 5, and rcell = 1 km. (a) Scheme A. (b) Scheme B. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 47 4.9 V e r i f i c a t i o n o f L A E n t r y P o i n t A s s u m p t i o n So far, when a user has crossed an LA boundary, we repositioned the user back to the center of the new LA. We assumed that a user always starts his journey at the center of the LA center cell. In this section, we show that this assumption is valid and the generalized paging schemes' performances are not affected significantly by this assumption. For instance, we choose the left most corner of a cell as the new LA entry point. When a user crosses an LA boundary, we assume that the user will continue his journey from this point, instead of the center of a cell. Figure 4.11 shows the performance of Scheme A with the new LA entry point. We see that the performance of Scheme A is not affected much by a different LA entry point. As the LA size increases, the difference in performance decreases. For LA size > 4, the differences in average paging delays and traffics are within ±5% of the original values. This also holds for Scheme B. Chapter 4 GENERALIZED LOCATION AREA PAGING SCHEMES 1.6 '5b 1 1 I 1 1 1 1 1 Starting at boundary * Starting at center * / / / / ~ •* *. / --> / »- - - - ^ ». , - l l l I I I ! 1 2 3 4 5 6 7 8 9 10 LA size (in # of rings) (a) 1 2 3 4 5 6 7 8 9 10 LA size (in # of rings) (b) Figure 4.11 Performance of Scheme A when a different LA entry point is used with v = 40 km/hr, th = 60 sec, 1 km, and Xcall - 1 call/hr. (a) average paging delay, (b) average paging traffic. Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES In Chapter 4, three different paging schemes, Selective paging, generalized paging with time-stamp {Scheme A), and generalized paging without time-stamp {Scheme B) were examined. For all three paging schemes, the system estimates the mobile user's position using the estimates of the user mobility parameters. These parameters include the mean speed (v), mean velocity hold time (th), and angular deviation parameter (ae). So far, we assumed that the system had the exact parameter values for the mobile user when evaluating the paging schemes' performance. However, we also need to consider the effects of uncertain mobility parameter values on the paging schemes' performance in terms of the average paging delay and traffic. In this chapter, the sensitivity of these three paging schemes to uncertainty in mobility parameter values are examined. Throughout this chapter, the destination is assumed to be at infinite distance. Also, the radius of a cell and call arrival rate are assumed to be 1 km and 1 call/hr, respectively. As in Section 4.8.1, the numbers of cells (iVc) in each paging group of LA sizes 1 through 10 are as follows: 3, 4, 5, 6, 7, 8, 10, 13, 16, and 20. 5.1 Uncertainty in Mean Speed We let the system's mobility parameter estimates be v = 40 km/hr, th = 60 sec, and a 9 = 4.2 (95% criterion). The user has the same set of mobility parameters except for v. We will consider two cases where the actual user's mean speeds are set to be 20 km/hr in case 1 and 60 km/hr in case 2. Then the performances of Scheme A and Scheme B are compared to that of 49 Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 50 4.5 3.5 60 C '5b IP > cd Scheme A • Scheme B X Selective paging A mean speed=60km/hr • • mean speed-40km/hr mean speed-20km/hr •4 4 5 6 LA size (# of rings) Figure 5.1 Sensitivity of the average paging delay performances Selective paging, Scheme A, and Scheme B to uncertainty in v for th = 60 sec, d = °°, a e = 4.2, rcell = 1 km, X, e e H = 1 call/hr and the system's v = 40 km/hr. Selective paging. Figure 5.1 and Figure 5.2 show the changes in average paging delay and traffic values. It is found that Scheme B is not very sensitive to the changes in the user's mean speed while Scheme A and Selective paging show significant increases in the average paging delays and traffics. When the actual user's mean speed is 20 km/hr or 60km/hr and the system's mean speed estimate is 40 km/hr, Scheme B performs better than the other two schemes because it does not require the elapsed time since the last location update to make paging decisions. The system does not need to estimate the distance the user may have travelled since the last location update and Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 51 4 5 6 7 LA size (# of rings) Figure 5.2 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in v for tk - 60 sec, 5 = ~ , oce = 4.2, rcell = 1 km, Xcell = 1 call/hr and the system's v = 40 km/hr. pages the same cells all the time. For Scheme A and Selective paging, the system underestimates or overestimates the distance the user may have travelled since the last location update and ends up paging cells with less probability of finding the user, resulting in increased average paging delay and traffic. However, the results show that Scheme A still performs better than Selective paging. In case 1 where the user's actual mean speed is 20 km/hr, Scheme A's average paging delay increases from 1.04 to 1.42 and average paging traffic increases from 20.47 to 28.02 for an LA of size 10, but the Selective paging's average paging delay increases from 1.89 to 4.06 and average paging traffic increases from 56.90 to 147.29. In the case 2 where the user's actual mean speed is 60 km/hr, Scheme A's average paging delay increases from 1.04 to 2.73 and average Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 52 paging traffic increases from 20.47 to 53.51 for an LA of size 10, whereas Selective paging's average paging delay increases from 1.89 to 4.30 and average paging traffic increases from 56.90 to 94.39. In both cases, Scheme A results in lower average paging delays and traffics than Selective paging. It is also noted that Scheme A's increase in the average paging traffic in case 2 is much greater than in case 1. This is because when the user's mean speed is higher, the cell probabilities become more spread out within an LA and the system requires to page more cells to find the user. For Selective paging, the average paging traffic in case 1 is much higher than in case 2 because the system overestimates the distance the user may have travelled since that last location update and tends to page the outer rings with more cells first. 5.2 Uncertainty in Mean Velocity Hold Time We let the system's mobility parameter estimates be v = 40 km/hr, th = 60 sec, and a e = 4.2 (95% criterion). The user has the same set of mobility parameters except for th. The user's actual mean velocity hold times are set to be 30 and 90 seconds. As shown in Figure 5.3 and Figure 5.4, all three schemes are not very sensitive to uncertainty in the mean velocity holding time. All changes in the average paging delays and traffics are within ± 10% of the expected values. It is noted that the average paging delays and traffics increase slightly when the user's actual mean velocity hold time is greater than the system's estimate and decrease otherwise. When the user's mean velocity hold time is greater than the system's estimate, the user's angular deviation from the principal direction becomes larger and the system must page more cells in order to locate the user. When the user's mean velocity hold time is smaller than the system's estimate, the user's angular deviation from the principal direction becomes smaller and the system Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 53 5 6 LA size (# of rings) 10 Figure 5.3 Sensitivity of the average paging delay performances of Selective paging, Scheme A, and Scheme B to uncertainty in th for v = 40 km/hr, 5 = °°, oc9 = 4.2, rcell = 1 km, Xcell = 1 call/hr and the system's th - 60 sec. can locate the user faster. 5.3 Uncertainty in Angular Deviation Parameter The angular deviation parameter, a e , controls how much the user's angular direction deviates from the principal direction. In Section 2.1, we assumed that a mobile user moves in the forward direction with a probability of 0.95 (95% criterion) and the corresponding value of a e is 4.2. In this section, the user's actual angular deviation parameter value is changed to 1.4 (85% criterion) and 10.3 (98% criterion) to examine the three paging schemes' sensitivities on a e . We Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 54 o i+3 00 c 'So cd a <u 00 cd > 60 h 50 h 40 h 30 20 Scheme A • Scheme B X Selective paging A mean hold time = 90 sec •-• mean hold time = 60 sec — mean hold time = 30 sec — 4 5 6 LA size (# of rings) 10 Figure 5.4 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in th for v = 40 km/hr, d = °°, oc9 = 4.2, rcell = 1 km, Xcell = 1 call/hr and the system's th = 60 sec. let the system's mobility parameter estimates be v = 40 km/hr, th - 60 sec, and a e = 4.2. The user has the same set of mobility parameters except for a e . Figure 5.5 and Figure 5.6 show the results. When the user's actual a e = 10.3, the average paging delay and traffic values do not change much for all three paging schemes. The perfor- mances of all three paging schemes improve slightly because the user's angular deviation from the principal direction becomes smaller and the probability of finding the user near the principal direction increases when a e increases. When the user's actual a 0 = 1.4, the three paging Chapter 5 SENSITIVITY OF PAGING SCHEMES TO UNCERTAINTY IN MOBILITY PARAMETER VALUES 55 •o 60 a '5b 133 a< t>0 03 u <U > 03 Scheme A • Scheme B X Selective paging A 98% criterion ••• 95% criterion 85% criterion — 2.8 2.6 2.4 2.2 2 1.8 1.6 1.4 1.2 1 I I I 4 5 6 7 LA size (# of rings) Figure 5.5 Sensitivity of the average paging delay performances of Selective paging, Scheme A; and Scheme B to uncertainty in a e for v = 40 km/hr, th - 60 sec, 5 = °°, rcell = 1 km, Xce[l = 1 call/hr and the system's a 9 = 4.2. schemes' average paging delay and traffic values all increase. However, the two generalized paging schemes still outperform Selective paging. For an LA of size 10, the average paging delay for Selective paging scheme increases from 1.89 to 2.92 while it increases from 1.04 to 1.29 and from 1.24 to 1.58 for Scheme A and Scheme B, respectively. Also, the average paging traffic for Selective paging increases from 56.90 to 100.54 while it only increases from 20.47 to 25.17 and from 24.84 to 31.62 for Scheme A and Scheme B respectively. Scheme A still results in the lowest average paging delay and traffic values. Figure 5.6 Sensitivity of the average paging traffic performances of Selective paging, Scheme A, and Scheme B to uncertainty in a e for v = 40 km/hr, th = 60 sec, d = <*>, rce[l = 1 km, XceU - 1 call/hr and the system's oc9 = 4.2. Chapter 6 MULTICASTING USING GENERALIZED PAG- ING SCHEMES So far, the paging schemes have been only used to locate a single mobile user. However, there are some instances where more than one user needs to receive the same incoming call. For example, the system may need to page a taxi fleet for services. The system can page each user separately and deliver the call to one user at a time, but this method's average paging traffic is linearly proportional to the number of users. As an alternative, we can modify the two generalized paging schemes described in Chapter 4 to locate many mobile users within the service area in one paging process. In this chapter, generalized multicasting schemes are introduced to locate multiple users within the service area. 6.1 P r e l i m i n a r i e s The user's destination was assumed to be at infinite distance for the paging schemes in Chapter 4. Here we will assume that all mobile users move around within a service area of limited size. As before, each mobile user travels according to the mobility model described in Section 2.1 and its location is updated according to the location updating scheme described in Section 3.3. Each user's starting location and destination are uniformly distributed over the cells in the limited service area. Each user starts his journey from a randomly chosen source cell's center and travels toward a randomly chosen destination cell's center. As soon as he reaches the destination cell, he randomly chooses the next destination cell and starts the next journey from the center of the current cell. Although the user has not reached the center of the destination cell, the user is considered to be at the destination as long as he enters the destination cell. Figure 6.1 shows the possible movements of a mobile user within the service area. 57 Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES 58 Service area boundary Figure 6.1 Mobile movements within the service area of size 5 (# of rings) In.[3], it is mentioned that each MSC handles about 100 cells. For the purpose of our analysis, the service area is assumed to have the size of 5 rings (= 91 cells) and each LA a size of 2 rings (= 19 cells). ' 6.2 Generalized Multicasting Schemes For generalized paging schemes used to locate a single user, only the cell probabilities in one LA were considered in order to make paging decisions. In order to accommodate multiple users, we need to consider the cell probabilities in all mobile users' LA's at the same time. We first obtain the cell probabilities of the cells in each LA. If a cell belongs to more than one LA, its cell probabilities obtained from different LA's are added together. The resulting value, Psum(cell) ,for each cell represents the average number of mobile users residing in each cell. Note that the sum of Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES 59 Last known location Current location Ml Mobile user 1 M2 Mobile user 2 LA boundary Figure 6.2 Overlapping of the two mobile users' LA's of size 2 (# of rings) the LA cell probabilities for each user is 1. When we group the cells into a number of subsets, Psum(cell) 's obtained for all cells are divided by the number of mobile users in the service area and are used as the new cell probabilities. The union of all LA's can be now considered as one big LA with new cell probabilities. A generalized multicasting scheme makes use of the fact that some LA's are bound to overlap (partially or entirely) within the limited service area. Figure 6.2 shows an example of two overlapping LA's. Because mobile user 1 and mobile user 2's LA's partially overlap each other, and the two mobile users currently reside in the shaded overlapping area, we can expect to find both of the users by paging these common cells first. As the number of mobile users in the service area increases, more LA overlapping will occur and the generalized multicasting scheme's perfor- Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES 60 mance, in terms of the average paging delay and traffic, is expected to improve. Two different generalized multicasting schemes are presented. The first scheme, general- ized multicasting with time-stamp (hereafter referred to as Scheme C), uses the location update time-stamp to estimate the mobile users' current locations as explained in Section 4.7.1. When a call comes in, the cell probabilities for each user are obtained based on each user's elapsed time, te, since his last location update as described in Section 4.8. The second scheme, generalized multicasting without time-stamp (hereafter referred to as Scheme D), uses static cell probabilities without using the location update time-stamp as explained in Section 4.7.2. The cell probabilities for each user are obtained as described in Section 4.8. 6.3 S i m u l a t i o n R e s u l t s The simulation results are presented in this section. The two generalized multicasting schemes' performances are measured in terms of their average paging delays and traffics. Figure 6.3 shows the relationships between the average paging delay and traffic values for the two schemes for the single user case. This figure differs from Figure 4.10 in two ways: (1) the LA size is 2. (2) the service area is limited to 5 rings. The performances of the two schemes are shown in Figure 6.4. The average paging delay values for 10, 20, and 30 users are kept below the delay value for one user by using 34, 44, and 48 cells (A7c) for grouping each paging subset, respectively. Then, by looking at the average paging traffic values for different number of users, we can see that the performances of the two schemes improve significantly as the number of users in the service area increases. When the number of users increases from 1 to 30, the average paging traffic values only increase by a factor of 12 for Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES 1.2 1.4 1.6 average paging delay (a) 1.2 1.4 1.6 1.8 average paging delay (b) Figure 6.3 Average paging traffic versus average paging delay for single user with v - 40 km/hr, th = 60 sec, rc e 1 km, and X call 1 call/hr, SA size = 5, LA size = 2, and # of users = 1. (a) Scheme C. (b) Scheme D. Chapter 6 MULTICASTING USING GENERALIZED PAGING SCHEMES both schemes. 62 We can see that the two schemes' average paging delay and traffic values are very close. This is due to the small service area and location area sizes chosen to reduce the time required for our simulations. Because there are not many cells in each LA, the two schemes' performances are very close to each other. The Scheme C is expected to outperform Scheme D by greater margins if larger service area and location area sizes are used. Figure 6.4 Performance of Scheme C and Scheme D with v = 40 km/hr, th = 60 sec, rcell = 1 km, Xcal[ = 1 call/hr, SA size = 5, and LA size = 2. (a) average paging delay, (b) average paging traffic. Chapter 7 CONCLUSION AND FUTURE WORK This thesis has examined the problem of locating a mobile vehicular telephone user in a cellular system. Two LA paging schemes, called generalized paging with time-stamp (Scheme A) and generalized paging without time-stamp (Scheme B), were proposed to determine the location of a user within an LA. For performance evaluation, a directional random walk model was used to model user mobility and a dynamic LA-based location updating scheme was used for user location registration. When compared to Selective paging, it was found that Scheme A and Scheme B can reduce both average paging delay and traffic considerably. For example, for an LA size of 10 and a subset size of 20, the average paging delay and traffic values are reduced by about 45% and 65% when Scheme A is used instead of Selective paging and by about 35% and 55% when Scheme B is used. Also, the generalized paging schemes can satisfy different performance needs (e.g. lower average paging delay and higher average paging traffic or vice versa) with different grouping parameters. The sensitivity of the two generalized paging schemes to uncertainty in user mobility parameter values (i.e. mean speed, mean velocity hold time, and angular deviation parameter) was studied. Scheme A was found to be very sensitive to uncertainty in user mean speed whereas Scheme B was not very sensitive to changes in all three parameter values. For an LA size of 10, Scheme A's average paging delay and traffic values increase by about 40% when the user's actual mean speed is 20 km/hr and the system's mean speed estimate is 40 km/hr; the corresponding increase for Scheme B is about -10%. When the user's actual mean speed is 60 km/hr and the system's mean speed estimate is 40 km/hr, Scheme A's average paging delay and traffic values increase by about 160%; the corresponding increase for Scheme B is about 10%. 64 Chapter 7 CONCLUSION AND FUTURE WORK 65 Two multicasting schemes, generalized multicasting with time-stamp (Scheme C) and generalized multicasting without time-stamp (Scheme D), were implemented using generalized paging schemes. As the number of users within a limited service area is increased, the perfor- mances of Scheme C and Scheme D improve significantly. When the number of users increases from 1 to 30, the average paging traffic values only increase by a factor of 12 for both schemes while the average paging delay values are kept below the delay value for one user. Among the topics which could be further investigated are: • To analyze paging scheme performances using different mobility models. • To analyze paging scheme performances using different location updating schemes (e.g. time-based, movement-based, or distance-based scheme [1]). • To analyze the effects of using different criteria (other than the average number of users in a cell) for selecting cells to be paged in multicasting. Bibliography [1] IF . Akyildiz and J. Ho, "On Location Management for Personal Communications Networks", IEEE Commun. Mag., pp. 138-145, Sep. 1996. [2] T. S. Rappaport, "The Wireless Revolution", IEEE Commun. Mag., pp. 52-71, Nov. 1991. [3] S. Madhavapeddy and K. Basu, "Optimal Paging in Cellular Mobile Telephone Systems", Proc. of the 14th International Teletraffic Congress, ITC 14, Antibes, France, pp. 493-502, June 1994. [4] H. Jung, S. Mishra, and O. K. Tonguz, "Efficient Location Management in PCS", Proc. of the 6th International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 284-288, 1995. [5] S. Okasaka, S. Onoe, S. Yasuda, and A. Maebara, "A New Location Updting Method for Digital Cellular Systems", Proc. of the 41st IEEE Vehicular Technology Conference, pp. 345-350, 1991. [6] H. Xie, S. Tabbanc, and D. J. Goodman, "Dynamic Location Area Management and Performance Analysis", Proc. IEEE VTC'93, pp. 536-539, May 1993. [7] S. Madhavapeddy, K. Basu, and A. Roberts, "Adaptive Paging Algorithms for Cellular Systems", Fifth WINLAB Workshop on Third Generation Wireless Information Networks, New Brunswick, NJ, pp. 976-980, April 1995. [8] D. Munoz-Rodriguez, "Cluster Paging for Traveling Subscribers", Proc. of the 40th Vehicular Technology Conference, pp. 748-753, May 1990. [9] A. Yener and C. Rose, "Paging Strategies for Highly Mobile Users", Proc. of the 46th IEEE Vehicular Technology Conference, pp. 1839-1842, 1996. [10] M. Shirota, Y. Yoshida, and F. Kubota, "Statistical Paging Area Selection Scheme for Cellular Mobile Communication Systems", Proc. the 44th IEEE Vehicular Technology Conference, pp. 367-370, 1994. [11] K. Lam, Location Updating and Paging Strategies in a Cellular System, M.A.Sc. thesis, Department of Electrical Engineering, University of British Columbia, 1993 66 Bibliography 67 [12] I. F. Akyildiz, J. Ho, and Y. Lin, "Movement-Based Location Update and Selective Paging for PCS Networks", IEEE/ACM Transactions on Networking, Vol. 4, No. 4, pp. 629-638, Aug. 1996. [13] A. Nakajima, M. Eguchi, T. Arita and H. Takeda, "Intelligent Digital Mobile Communications Network Architecture," Proc. of XIII International Switching Symposium, Stockholm, Sweden, vol. VI, May-June 1990. [14] W. C-Y. Lee, Mobile Cellular Telecommunication Systems, McGraw Hill, 1989. [15] W. W. Erdman, "Wireless Communications: A Decade of Progress", IEEE Commun. Mag., pp. 48-51, Dec. 1993. [16] J. Markoulidakis, G. Lyberopoulos, D. Tsirkas, and E. Sykas, "Mobility Modeling in Third-Generation Mobilie Telecommunications Systems", IEEE Personal Communications, Vol 4, Issue 4, pp. 41-56, Aug. 1997. [17] H. Xie and D. Goodman, "Mobility Models and Biased Sampling Problem", Proc. of 2nd IEEE International Conference on Universal Personal Communications, Ottawa, 1993. [18] P. Camarda, G. Schiraldi, F. Talucci, and R. Valla, "Cellular Communication Mobility Model for a Finite Multiclass Population of Users", IEEE 47th Vehicular Technology Conference, 1997'. [19] I. Rubin and C. W. Choi, "Impact of the Location Area Structure on the Performance of Signalling Channels in Wireless Cellular Networks", IEEE Commun. Mag., pp. 108-115, Feb. 1997. [20] A. R. Potter, "Implementation of PCNs Using DCS 1800", IEEE Commun. Mag., pp. 32- 36, Dec. 1992. [21] T. Sakamoto, E. Kamagata, and M. Serizawa, "Location Registration and Paging for In- building Personal Multi-media Communication Systems", [22] Y. Lin, "Modeling Techniques for Large-Scale PCS Networks", IEEE Commun. Mag., pp. 102-107, Feb. 1997. [23] C. Rose and R. Yates, "Location Uncertainty in Mobile Networks: A Theoretical Framework", IEEE Commun. Mag., pp. 94-101, Feb. 1997. Bibliography 68 [24] N. Kennedy, Fundamentals of Traffic Engineering, 8th edition, Berkeley, Calif. Inst, of Traffic and Transportation Engineering, Univ. of Calif. Berkeley, 1973. [25] D. L. GerLough and M. J. Huber, Traffic Flow Theory, Transportation Research Board, National Research Council, Washinton, D. C, 1975. [26] H. J. W. Leong, "The distribution and Trend of Free Speeds on Two-Lane Rural Highways in New South Wales," Proc. Austr. Road Res. Board, 4: pp. 791-814, 1968.
Cite
Citation Scheme:
Usage Statistics
Country | Views | Downloads |
---|---|---|
United States | 2 | 2 |
China | 2 | 14 |
City | Views | Downloads |
---|---|---|
Mountain View | 2 | 0 |
Beijing | 2 | 1 |
{[{ mDataHeader[type] }]} | {[{ month[type] }]} | {[{ tData[type] }]} |
Share
Share to: