• IE interfaces
• /
• v.16 no.4
• /
• pp.507-514
• /
• 2003

In personal communication systems location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. The rest of cells in the location area are included into the second paging area. To reduce the paging cost the first paging area is decided by reflecting various residence patterns of mobile terminals. For an incoming call, the sequential paging is performed in the order of the paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than an existing strategy that uses the anchor cell in the location area.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.25-28
• /
• 1999

Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.425-432
• /
• 2003

In personal communication systems, location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is introduced, which is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. We propose the decision criterion of the first paging area by comparing the cost against zone-based strategy. For an incoming call. we perform the sequential paging by the order of the first paging area and the rest of cells in the location area called by the second paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than existing strategy using anchor cell in the location area because it reflects various residence patterns of mobile terminals.

• Journal of Information Technology Applications and Management
• /
• v.13 no.2
• /
• pp.87-97
• /
• 2006

Due to limited radio resource, an effective paging strategy is essential for improving the utility of radio channels. In current mobile communication networks, when a mobile-terminated call occurs, the network locates the mobile by paging all cells within the location area simultaneously. In this study, we introduces paging strategies that can page some cells or only one cell within the location area to reduce paging cost on radio channels using paging agents. We propose another new paging strategy that can page only one cell within the location area and may have better performance. We also compare the performance of our proposed paging strategy with the performance of the current simultaneous paging strategy and some new paging strategies using paging agents. This paper suggests the most effective paging strategy using mathematical models. The result of this research will be used to select a proper paging strategy in the mobile communication networks.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.289-297
• /
• 2004

State-of-the-art wireless communication networks allow dynamic relocation of mobile terminals. A location management mechanism is required to keep track of a mobile terminal for delivering incoming calls. In this paper, we propose a fuzzy logic-based selective paging method to reduce paging cost. In the proposed fuzzy logic-based location management method, the location update uses the area-based method that uses direction-based together with movement-based methods, and the location search uses the fuzzy logic-based selective paging method based on the mobility information of mobile terminals. A partial candidate paging area is selected by fuzzy control rules, then the fuzzy logic-based selective paging method pages only the cells within the partial candidate paging area. The performance of proposed fuzzy logic-based location management method is to be evaluated by both an analytical model and a simulation, and is compared with those of LA and BVP methods. From these evaluation results, we know that the proposed fuzzy logic-based location management method provide better performance than other location management methods.

• IE interfaces
• /
• v.24 no.1
• /
• pp.15-23
• /
• 2011

This study considers paging schemes that can page some cells or only one cell within the location area to reduce paging cost by using PAs (Paging Agents) and compares their performances by using a new analytic method. There are three ways of paging schemes using PAs; BSPA (Base Staton Paging Agent), 2SPA (2-Step Paging Agent), LAPA (Location Area Paging Agent). This study proposes exact performance of BSPA and 2SPA using a new analytic method based on Markov chain modeling to find the most efficient paging scheme. Numerical results for various circumstances are presented by using proposed analytic method to select a proper paging scheme in mobile communication networks.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.65-75
• /
• 1998

We consider connection-oriented wireless cellular networks such as the second generation wireless cellular networks and wirelss ATM networks. In these networks, a separate forward signaling channel is provided for the transmission of paging and channel allocation packets. When a call destined to a user is requested, all the base stations in the user's current location area broadcast the corresponding paging packet across forward signaling channels. By slot mode operation and paging group allocation for fusers in a location area, we can reduce relative power consumption level at battery-operated terminals. However, a sthe number of paging groups is increased for lowering relative power consumption level, a paging packet experiences higher delay to access the forward signaling channel. For the pre-negotiated quality-of-service level, paging packet delay level must be limited. In this paper, we consider static and dynamic multiplexing schemes for paging packets, and develop an analytical method for calculating paging packet delay and relative power consumption levels. Using this analytial method, we investigate the effect of network parameters on the paging packet delay and relative power consumption levels.

• Korean Management Science Review
• /
• v.23 no.3
• /
• pp.13-25
• /
• 2006

To reduce the signaling tost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems. The effectiveness of the 1)reposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.321-329
• /
• 1999

An efficient location management for mobile stations plays an important role in mobile communication network. This paper studies a movement-based registration(MBR) method with a selective paging scheme. In the movement-based registration method, a mobile station performs a location registration when the number of cell boundary crossings since the last registration equals to the given movement threshold. In the selective paging scheme, the network first partitions the location area of the called mobile station into a number of subareas and then pages each subarea one after another until the MS is found. To reduce the paging and registration load, we propose a modified MBR(MMBR) method in the aspect of minimization of signaling traffic on radio channels. First, we propose a new establishment of the paging area to reduce the paging load on radio channels and then analyze its effects. Next, we propose the MMBR to reduce the registration load. Numerical results show that our proposed movement-based registration provides the better performance compared with the conventional method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.3
• /
• pp.119-135
• /
• 2005

Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.