Effective Paging Strategy based on Location Probability of Mobile Station and Paging Load Distribution of Base Station in Mobile Communication Networks.
ABSTRACT When the cells in a location area are sequentially paged based on specific information, such as the last registered area or
a mobile speed, the paging load may be non-uniformly distributed among the cells. This non-uniform paging traffic causes an
additional paging delay due to the increased waiting time in cells that have a high paging load. In this paper, we introduce
a new paging strategy in which the paging sequence in a location area is optimized according to both the location probability
of a mobile terminal and the paging load distribution among the cells. In addition, we propose a simple polynomial-time heuristic
algorithm to determine sub-optimal paging sequence. Numerical results show that our proposed strategy has almost an equivalent
optimal performance and outperforms the conventional paging scheme with respect to a paging delay.
Conference Proceeding: New metric for analyzing multi-step paging schemes in mobile networks[show abstract] [hide abstract]
ABSTRACT: Efficient paging techniques are needed to reduce the cost of location management in mobile networks. Currently, all the cells of a location area (LA) are paged at the same time to locate the mobile user (MU). Efforts have been made to reduce the overhead paging bandwidth cost by using multi-step paging methods. However, in the case of multi-step paging schemes, such as sequential paging and intelligent paging, additional paging delay is introduced. It is shown that if the paging cost computation is based on the number of paged cells only, then, in certain cases, one may obtain misleading results. To resolve this dilemma, a new cost function, in terms of the number of cells paged and the paging delay, is introduced. Thus, this new metric provides a powerful tool that can be used to analyze all multi-step paging procedures with constrained or unconstrained delayVehicular Technology Conference, 2001. VTC 2001 Spring. IEEE VTS 53rd; 02/2001
- [show abstract] [hide abstract]
ABSTRACT: We propose a novel paging strategy based on the theory of optimal search with discrete efforts. When compared to conventional paging methods, the proposed scheme increases the mobile station discovery rate while decreasing the average number of times that a mobile station has to be paged in a location area. The proposal is fully compatible with existing cellular structures, and requires minimal computational power in the mobile switching centersIEEE Journal on Selected Areas in Communications 10/1997; · 3.12 Impact Factor
- [show abstract] [hide abstract]
ABSTRACT: Efficient mobility management for portable stations (PS's)-handoff, channel assignment and locating-will play an important role in future personal communication systems (PCS's). Among these tasks, location management plays a critical role for wide-area roaming. The key elements of locating are location registration/updating and paging. Due to the smaller cell size in PCS, the high boundary crossing rate of PS will result in more frequent location area (LA) updating. This, in turn, will result in more interrogations with location registers, which will generate a higher volume of access and signaling traffic (SS7 traffic). One solution to this problem is to increase the size of LA, which, unfortunately, also increases paging traffic. Efficient paging algorithms may generate relatively less paging traffic such that larger LA's may become plausible. Depending on the call-arrival rate to the cell, boundary crossing rate, optimum size of LA, and paging technique used, the overall cost could vary substantially. The paging techniques considered in this paper are simultaneous paging and sequential paging. The two schemes are studied in detail in order to understand the problems associated with location management in the PCS environment. In the authors' opinion, this paper provides, for the first time, a simple yet powerful analytical framework which can be used to analyze “intelligent” paging schemes as well as simultaneous and sequential pagingIEEE Transactions on Vehicular Technology 06/1998; · 2.06 Impact Factor