• ETRI Journal
• /
• v.26 no.5
• /
• pp.493-496
• /
• 2004

An effective paging strategy is essential for improving the utility of radio channels. This paper proposes a two-step paging strategy which involves using base station paging agents to page a single cell at each paging. An analytical model is used to evaluate the performance of the proposed strategy. The proposed strategy is compared with the traditional simultaneous paging strategy and a recent proposal using the base station paging agents. The numerical results showed that the proposed strategy proficiently reduces paging cost on radio channels compared with other paging strategies.

• 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 Advanced Navigation Technology
• /
• v.10 no.4
• /
• pp.291-298
• /
• 2006

A new intelligent paging algorithm is proposed in this paper to maximize the paging capacity in wireless link of mobile communication systems. Intelligent paging algorithms have been studied to utilize limited wireless resource efficiently, in which a location area is divided to several paging areas which are searched sequentially. Previous intelligent paging methods mainly use location probability distribution of the paging target terminal to determine paging areas. However, these methods make the paging traffic of each cell non-uniformly distributed. Therefore, in relatively low paging load conditions, there exist cells congested with paging traffic in which paging traffic queues are overflowed and paging messages are lost. The proposed method determines paging areas to make the paging traffic distributed uniformly among cells by considering current paging traffic distribution in each cell. Performance evaluation shows that the proposed method outperforms the previous paging schemes much with respect to paging processing capacity.

• ETRI Journal
• /
• v.25 no.1
• /
• pp.55-58
• /
• 2003

We propose a new paging strategy to reduce paging cost by adding paging agents at base stations. When a mobile-terminated call occurs, the base stations look up the paging agents to determine if terminal paging is actually to be made. An analytical model based on a Markov chain is used to evaluate the performance of the proposed strategy. The numerical results show that the proposed strategy significantly reduces the paging cost compared with the simultaneous paging strategy.

• 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 Satellite, Information and Communications
• /
• v.6 no.2
• /
• pp.84-90
• /
• 2011

Handling paging mechanism at the IP layer (i.e., IP paging) makes it possible to support heterogeneous wireless access technologies, providing energy-saving and reduced location registration signaling overhead over IP-based mobile networks. However, IP paging may rather cause adverse effects under active communication environments because of significant paging signaling overhead and frequent paging delay. Therefore, in order to solve these problems, a cost-effective IP paging scheme is proposed in this paper, which enables a mobile node to perform selective registration and paging based on its profile information. Numerical results indicate that the proposed scheme has apparent potential to mitigate considerable paging signaling overhead and frequent paging delay in IP-based hierarchical mobile networks.

• 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.

• 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.

• 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 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.