C. Rose. Minimizing the Average Cost of Paging and Registration: A Timer-Based Method. Wireless Networks, 2(2):109--116, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....motion model is assumed in [12] With this knowledge, dynamic programming is applied to solve for the optimal registration policy. This corresponds to the bottom branch of Figure 1. Several studies have addressed minimizing the costs, considering the paging and registration policies together [1, 15, 16]. In [15] a timer based registration policy combined with maximum likelihood serial paging is introduced. The minimum paging cost can be represented by the distribution of locations where the MS last reported. Then an optimal timer threshold is selected to minimize the total cost of registration ....

....is assumed in [12] With this knowledge, dynamic programming is applied to solve for the optimal registration policy. This corresponds to the bottom branch of Figure 1. Several studies have addressed minimizing the costs, considering the paging and registration policies together [1, 15, 16] In [15], a timer based registration policy combined with maximum likelihood serial paging is introduced. The minimum paging cost can be represented by the distribution of locations where the MS last reported. Then an optimal timer threshold is selected to minimize the total cost of registration and ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," Wireless Networks, vol. 2, pp. 109--116, 1996.

....should be easy enough to allow actual implementation. Therefore, our proposed approach pays much attention to the reduction of the computation intensity and the algorithm complexity. In the similar effort to minimize the paging and registration costs by utilizing the user motion information, 11] [12] provide an optimal time based solution for mobile units with isotropic diffusive motion, which is then extended to an optimal state based approach [9] 10] In this section, we will discuss the basic velocity paging scheme coupled with the movement based registration. It is worth mentioning that ....

C. Rose, Minimizing the Average Cost of Paging and Registration: a timer-based method, ACM Wireless Networks, 2(2) (1996) 109-116.

.... registration information obtained during transactions between the network and the mobile unit is discussed in [11] Research has also been directed to dynamic location update schemes such as distance based [12] 14] 15] 16] 17] movement based [12] 18] velocity based [19] 20] and time based [12][21] strategies. A predictive distance based mobile tracking scheme is presented in [22] and a novel information theoretic approach to user location, based on the Lempel Ziv family of source compression algorithms, is proposed in [3] There is a tradeo# between the frequency of location updates and ....

C. Rose and R. Yates, "minimizing the average cost of paging and registration: A timer-based method," Wireless Networks, vol. 2, no. 2, p. 109-116, June 1996.

....a per user basis. In addition, the LA based location update and paging scheme is a static scheme as it cannot be adjusted based on the parameters of an MT from time to time. Recent research efforts attempt to reduce the effects of these inefficiencies. Excessive location updates are addressed by [96] and [23] A timer based strategy that uses a universal timeout parameter is presented in [96] while a tracking strategy for mobile users in PCS networks based on cell topology is explored and compared with the time based strategy in [23] For excessive polling, a oneway paging network ....

....as it cannot be adjusted based on the parameters of an MT from time to time. Recent research efforts attempt to reduce the effects of these inefficiencies. Excessive location updates are addressed by [96] and [23] A timer based strategy that uses a universal timeout parameter is presented in [96], while a tracking strategy for mobile users in PCS networks based on cell topology is explored and compared with the time based strategy in [23] For excessive polling, a oneway paging network architecture and the interfaces among paging network elements are examined in [63] Additional schemes ....

C. Rose "Minimizing the average cost of paging and registration: A timer-based method," ACM-Baltzer J. Wireless Networks, vol. 2, no. 2, pp. 109--116, 1996.

....are fixed, can be zone based [1] 2] or profile based [3] We consider static planning in this work. In dynamic schemes, LA boundaries are not fixed and the decision to make an LU is based on some specific criteria. It can be state based [4] distance based [5] movement based [6] or time based [7]. It has been shown in [4] that, given the steady state probability distribution of the location of MTs for each paging area, which is a subset of LA, an optimal paging strategy with no delay constraint, pages the LAs in descending order of location probabilities. In distance based schemes, an MT ....

....i) determination of optimum number of cells per LA (subproblem I) and ii) identification of the cells to be connected to an MSC (subproblem II) 2. 1 Mobility model of MTs To simulate the movement of MTs there are several generic models, such as fluid flow model [15] 35] 37] diffusion model [7], gravity model [16] and random walk model [11] 17] Our design is independent of the mobility model used for the purpose of analysis. However, in order to explain the present work, we consider fluid flow model to simulate the mobility of the roving MTs to capture the macroscopic movement ....

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method", Wireless Networks, vol. 2, no. 2, pp. 109-116, June'96.

....motion model is assumed in [12] With this knowledge, dynamic programming is applied to solve for the optimal registration policy. This corresponds to the bottom branch of Figure 1. Several studies have addressed minimizing the costs, considering the paging and registration policies together [1] [15], 16] In [15] a timer based registration policy combined with maximum likelihood serial paging is introduced. The minimum paging cost can be represented by the distribution of locations where the MS last reported. Then an optimal timer threshold is selected to minimize the total cost of ....

....assumed in [12] With this knowledge, dynamic programming is applied to solve for the optimal registration policy. This corresponds to the bottom branch of Figure 1. Several studies have addressed minimizing the costs, considering the paging and registration policies together [1] 15] 16] In [15], a timer based registration policy combined with maximum likelihood serial paging is introduced. The minimum paging cost can be represented by the distribution of locations where the MS last reported. Then an optimal timer threshold is selected to minimize the total cost of registration and ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," Wireless Networks, vol. 2, pp. 109--116, 1996.

....management is to update the location of a MT when it moves from one LA into another. In order to reduce the total cost in location management, various location update generation schemes based on the mobile terminals call and mobility patterns have been proposed. They include the time based [1,2, 3], the movement based [4,5] and the distance based [6] schemes. Numerical results in [7] show that the distance based update scheme may give a better performance in terms of a lower total cost for location update and paging as comparing with the timer based and movement based schemes. In order to ....

C. Rose.: Minimizing the average cost of paging and registration: A timer-based method. ACM/Baltzer J. Wireless Networks (1996) , vol.2, No.2, 109-116.

....and Yates es # This work was presented in part at the IEEE Signal Processing Workshop on Signal Processing Advances in Wireless Communications (SPAWC 99) Annapolis, Maryland, USA, May 1999. tablished the fundamental theory of optimal sequential paging on a location by location basis. Rose in [5] suggests that the study of the mobility management problems be divided into three basic questions: 1) Given a probability distribution of user locations, what is the least amount of e#ort necessary (number of locations searched) to find a user (2) Given the time varying probability distribution ....

....parameter indicating how far into the future we are going to predict a future paging area based on our current knowledge about the locations of the mobile user. A timer based location registration (LR) is assumed, and the LR interval is the longest time waited if there are no call arrivals [5]. Figure (1) also illustrates a general phenomenon about the mobility of a mobile user: the variance of user location (location uncertainty) grows with the time elapsed since the user s last known location x 0 [5] That is, the longer the time elapsed, the larger the area we have to search for ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method", ACM/Batzer Journal of Wireless Networks, vol.2, no.2, pp.109-116, 1996.

....to the user, the system must search for him her all over the network. In the other extreme strategy, known as Always Update , the network continuously keeps track of the user location. Various strategies which combine these two extremes have been proposed in the literature ( 7] 1] 2] [8], 3] 6] 9] The basic idea shared by these papers is known as the Partial registration strategy. Namely, upon location change a user may or may not update its new location. The criterion for user registration may be static, such as network partition into location areas. For example, in ....

....by the system, not accounting for the user dynamic behavior, we consider this strategy as static. Another type of partial registration strategy is the dynamic strategy, in which each user decides when and where to update its location. The criterion for user registration may be a function of time [8], distance from last known location ( 2] 6] number of movements between cells [2] or based on personal location profile [9] All the dynamic partial registration strategies mentioned above are implemented solely on user equipment. As such, they ignore the system activity, and depend solely on ....

[Article contains additional citation context not shown here]

Rose C., Minimizing the Average Cost of Paging and Registration : A Timer-Based Method. ACM Journal of Wireless Networks, Vol. 2, No. 2, pp. 109-116, 1996.

....distribution with 200 elements we can expect, through application of the scaling theorem [38] that E[L] 130 with D = 2. Since the absolute minimum E[L] for this distribution is 100.5, the relative E[L] of the absolute minima for the 20 and 200 element cases are comparable. E[L] AND D In [45] it was shown that for a diffusion process, the cost of paging is proportional to (Dt) n 2 where t is the time elapsed since last contact with the mobile unit and n is the dimensionality of the unit motion. Notice that this cost is in units of length, whereas we have stressed that ....

....fixed, high velocity mobile units must register more frequently or require larger location areas, both of which tend to increase cost. PAGING REGISTRATION USING OPTIMAL PAGING AND THE MOBILITY INDEX As mentioned previously, minimum average paging cost E[L] can be approximated by (Dt) n 2 [45] where D is the diffusion constant, t is the time since last sighting of the unit, and n is the dimensionality of motion. It is useful to further define a mobility index as r = D l p . The inverse of r is known as the call to mobility ratio [21, 31] The paging cost can then be written as ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method," ACM Wireless Networks, vol. 2, no. 2, June 1996, pp. 109--16.

....0.8 1 Call probability 0 0.2 Probability of occurrence 0 0.1 0.2 0.4 0.6 0.8 1 Call probability 0 0.2 Probability of occurrence 0 0.1 0.2 0.4 0.6 0.8 1 Day Week Month IEEE Communications Magazine . February 1997 82 characterizing the flow of traffic as a diffusion process [19]. One of the limitations of the fluid model is that it describes aggregate traffic and therefore is hard to apply to situations where individual movement patterns are desired, for example, when evaluating network protocols or data management schemes with caching. Another limitation comes ....

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method," ACM J. Wireless Networks, Feb. 1996, pp. 109--16.

.... a circular region with a population density of ae, an average velocity of v, and region diameter of L, the average number of site crossings per unit time, N , is: N = aeLv (1) A more sophisticated fluid model has also been formulated by characterizing the flow of traffic as a diffusion process [26]. One of the limitations of the fluid model is that it describes aggregate traffic and therefore is hard to apply to situations where individual movement patterns are desired, for example when evaluating network protocols or data management schemes with caching. Another limitation comes from the ....

C. Rose. Minimizing the average cost of paging and registration: A timer-based method. ACM Journal of Wireless Networks, pages 109--116, February 1996.

....distance based, timer based, and the movement based schemes. In the distance based scheme [3] 5] a mobile terminal transmits an update signal whenever its distance (in terms of the number of cells) from the previous update location exceeds a certain threshold. In the timer based scheme [3] [6], a mobile terminal updates its location periodically. In the movement based scheme [3] 7] 8] a location update is performed when the number of cell boundary crossings from the previous update location exceeds a certain value. Numerical results in [3] show that the distance based update ....

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," ACM/Baltzer J. Wireless Networks, vol. 2, no. 2, pp. 109--116, June 1996.

....the distance based, timer based, and the movement based schemes. In the distance based scheme [3] 5] a mobile terminal transmits an update signal whenever its distance (in terms of the number of cells) from the previous update location exceeds a certain threshold. In the timer based scheme [3][6], a mobile terminal updates its location periodically. In the movement based scheme [3] 7] 8] location update is performed when the number of cell boundary crossings from the previous update location exceeds a certain value. Numerical results in [3] show that the distancebased update scheme has a ....

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," ACM/Baltzer J. Wireless Networks, vol. 2, no. 2, pp. 109-116, June 1996.

....is maximized, since a network wide search is required whenever the user is requested. Due to this trade off the proper design and performance issue is that of designing a strategy which minimizes the combined cost of paging and registration. This problem was addressed in many studies ( 3] 2] [12], 16] 4] 13] 9] The basic idea shared by those papers is that the user does not have to inform the system about each and every location change. Thus, there remains some (bounded) degree of uncertainty about the exact location of the user. This approach leads to several algorithms dealing ....

....Works Several strategies have been proposed in the literature for tracking users, many of which attempt to reduce the cost associated with the need to track users in PCS networks. The problem of minimizing the combined cost of paging and registration was addressed in many studies ( 3] 2] [12], 16] 4] 13] 9] Most studies mentioned above, including this one, concern with the problem of efficiently utilizing the wireless links of the network for tracking; while in [2] the main objective is to utilize the wired portion of the network, using smart partition of the network and ....

[Article contains additional citation context not shown here]

Rose C., Minimizing the Average Cost of Paging and Registration : A Timer-Based Method. ACM Journal of Wireless Networks, Vol. 2, No. 2, pp. 109-116, 1996.

....and mobility patterns. Examples include the distance based, timer based, and the movement based schemes. In the distance based scheme [2] 3] a mobile terminal transmits an update signal whenever its distance (in terms of the number of cells) exceeds a certain threshold. In the timer based scheme [4], a mobile terminal updates its location periodically. In the movement based scheme [5] location update is performed when the number of boundary crossings between cells exceeds a certain value. A number of novel location update algorithms have been proposed recently. In the predictive ....

C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," ACM/Baltzer J. Wireless Networks, vol. 2, no. 2, pp. 109-116, June 1996.

....the collection of all the cells in the system is grouped into a number of disjointed location areas. A mobile client updates its location when it enters another location area. In the time based update method, a mobile client updates its location periodically every pre specified time interval [5]. In the distance based update method, a mobile client updates its location whenever the distance between the current cell and the last registered cell exceeds a predefined threshold value. In the movement based update method, a mobile client updates its location if the number of cells it has ....

Rose, C., "Minimizing The Average Cost of Paging and Registration: A Timer-Based Method", Wireless Network , vol. 2, no. 2, pp. 109-116, 1996.

....(e.g. T = 1 hour) This scheme does not require the mobile terminal to record or process location information during the time between updates. For implementation, the timer threshold can be programmed into the mobile terminal by a hardware or software timer. An analytical model is introduced in [13] to study the timer based scheme. Assuming Gaussian distribution of user location probability and Poisson call arrivals, the update period that minimizes the cost of location update and paging is derived. Results show that the timer based scheme performs substantially better than the LA based ....

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method," ACM/Baltzer J. Wireless Networks, vol. 2, no. 2, June 1996, pp. 109--16.

....continuously and the PAs are updated automatically to react to the changing user tra#c flow conditions in the cellular system. In a typical cellular environment with LU rate of once every 30 minutes, analysis shows 75 80 page reduction over system wide paging. 3. Optimal Timer Based Approach[8, 9] This study mathematically formulated the location tracking problem as an optimization problem in terms of the location registration interval represented by a time out parameter for the LU timer, given that the location probability of a user as a function of time is either known or can be ....

....and call arrival rate. The minimization is based on the expected cost rate of paging registration for the current roaming interval defined as the time between a call termination or registration and the next paging or registration event. A performance comparison to the optimal timer based approach[8, 9] reviewed above shows, for a di#usive motion model, an approximately 10 reduction in average paging registration cost at higher mobility levels. And a major improvement of this approach is a reduction in the cost variance by a factor of three. 2. The Mobility Tracking Optimization Between ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the Average Cost of Paging and Registration: A TimerBased Method", ACM Journal of Wireless Networks, vol.2, no.2, (to appear), 1996.

....the starting point of the process [11] MFPT represents exactly the mean dwell time of a motion process in a bounded area. Let the boundaries of the one dimensional LA be given as B 1 and B 2 with B 1 B 2 . The MFPT for a Brownian motion with drift process starting at x 0 is derived in [4] as: T (x 0 , B 1 , B 2 ) e 2v(x e 2v(B (B 2 1 ) B 1 ) 2) Known MFPT as the average time between any two registration events, the average registration rate can be determined as inversely proportional to the MFPT. 2.2 Cost Structure The overall average ....

....as inversely proportional to the MFPT. 2. 2 Cost Structure The overall average signaling cost [signaling units unit time subscriber] is defined as the sum of average paging cost C p and average location registration cost C r since paging and registration are two independent events in this scheme [1, 2, 4]. Assume the incoming call arrivals for a user are Poisson of intensity # p . We define the average cost of paging as: Cp = Sp#p N where S p is the paging cost coe#cient [signaling units paging event] LLA = B 2 B 1 is the LA size; L c is the cell size, assuming all the cells in the ....

[Article contains additional citation context not shown here]

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method", ACM Journal of Wireless Networks, vol.2, no.2, pp.109-116, 1996.

No context found.

C. Rose. Minimizing the Average Cost of Paging and Registration: A Timer-Based Method. Wireless Networks, 2(2):109--116, 1996.

No context found.

Rose, C (1996). Minimizing the average cost of paging and registration: A timer-based method. ACM/Baltzer Wireless Networks: The Journal of Mobile Communication, Computation and Information 2:109--116.

No context found.

C. Rose. Minimizing the average cost of paging and registration: A timer-based method. ACM/Baltzer Wireless Networks, 2(2):107-116, Jun 1996.

No context found.

C. Rose, "Minimizing the Average Cost of Paging and Registration: A Timer-Based Method", ACM Journal of Wireless Networks, vol.2, no.2, pp.109-116, 1996.

No context found.

Rose C., Minimizing the Average Cost of Paging and Registration : A Timer-Based Method. ACM Journal of Wireless Networks, Vol. 2, No. 2, pp. 109-116, 1996.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC