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

• Journal of Industrial Technology
• /
• v.25 no.B
• /
• pp.221-229
• /
• 2005

We present a numerical analysis of the optimal group number for minimizing the average paging delay. In the analysis, we consider uniform distributions for location probability conditions and apply M/D/1 queueing model to paging message queues of cells. We also get the lower bounds of group numbers and investigate the minimum transmission capacity under average paging delay constraints. Minimizing the average paging delay is important because it means minimizing the amount of bandwidth used for locating mobile terminals. Therefore, the numerical results of this paper will be very useful in PCS system when designing its signalling capacity due to its simplicity and effectiveness.

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

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

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.74-77
• /
• 1998

We consider connection-oriented wireless cellular networks. These networks employ dedicated radio channels for the transmission of signaling information. A forward signaling channel is a common signaling channel assigned to carry the multiplexed stream of paging and channel allocation(virtual circuit allocation) packets from a base station to mobile stations. The delay levels experienced by paging and channel allocation packets have serious effect on the utilization level of the limited radio channel capacity. While a slotted mode operation is used to reduce the power consumption level at mobile stations, it may induce an increase in packet delay levels. In this paper, we thus consider a multiplexing scheme for paging and channel allocation packets under which slots are dynamically allocated for the paging packet transmission. For this dynamic scheme, we develop an analytical method for deriving the delay characteristics exhibited by paging and channel allocation packets, and investigate the effect of network parameters on the delay level by using this method.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.4
• /
• pp.225-233
• /
• 2010

In this paper, we try to improve the performance of the demand paging loader suggested to use the demand paging way that is not based on operating system. The demand paging switching strategy used in the existing operating system can know the recently used pages by running multi-processing. Then, based on it, some page switching strategies have been made for the recently used pages or the frequently demanded pages. However, the strategies based on operating system cannot be applied in single processing that is not based on operating system because any context switching never occur on the single processing. So, this paper is trying to suggest the demand paging switching strategies that can be applied in paging loader running in single process. In the Return-Prediction-Algorithm, we saw the improved performance in the program that the function call occurred frequently in a long distance. And then, in the Most-Frequently-Used-Page-Remain-Algorithm, we saw the improved performance in the program that the references frequently occurred for the particular pages. Likewise, it had an enormous effect on keeping the memory reduction performance by the demand paging and reducing the running time delay at the same time.

• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.126-134
• /
• 2005

Reducing energy consumption in mobile hosts (MHs) is one of the most critical issues in wireles/mobile networks. IP paging protocol at network layer and power saving mechanism (PSM) at link layer are two core technologies to reduce the energy consumption of MHs. First, we investigate the energy efficiency of the current IEEE 802.11 power saving mechanism (PSM) when IP paging protocol is deployed over IEEE 802.11 networks. The result reveal that the current IEEE 802.11 PSM with a fixed wakeup interval (i.e., the static PSM) exhibits a degraded performance when it is integrated with IP paging protocol. Therefore, we propose an adaptive power saving mechanism in IEEE 802.11-based wireless IP networks. Unlike the static PSM, the adaptive PSM adjusts the wake-up interval adaptively depending on the session activity at IP layer. Specifically, the MH estimates the idle periods for incoming sessions based on the exponentially weighted moving average (EWMA) scheme and sets its wake-up interval dynamically by considering the estimated idle period and paging delay bound. For performance evaluation, we have conducted comprehensive simulations and compared the total cost and energy consumption, which are incurred in IP paging protocol in conjunction with various power saving mechanisms: The static PSM, the adaptive PSM, and the optimum PSM. Simulation results show that the adaptive PSM provides a closer performance to the optimum PSM than the static PSM.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.29-36
• /
• 2007

IP paging strategy, one of the solutions for derived problems in IP mobility support protocol, reduces the messages and the overheads over the network, since there is not registration procedure when a mobile terminal moves into a new router within the same paging area. However, the fact that the mobile terminals with the previous strategy consume electrical power continuously for paging signal reception obstructs the application of IP paging strategy to the IP-based wireless sensor networks. In this paper, we propose a discontinuous paging reception strategy based on the characteristics of the wireless sensor networks and their mobile terminals. As a result of the mathematical analysis, the proposed strategy significantly reduces the terminals' power consumption. In addition, by setting the relating parameters as appropriate values, the proposed strategy can be switched to the continuous reception strategy, or can be adjusted to limit the terminals' power consumption or paging delay.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.6 no.1
• /
• pp.32-40
• /
• 2011

For a NAND booting based embedded system, an application program on the NAND flash memory is downloaded to the RAM when the system is booted. In this case, the application program exists in both the RAM and the NAND flash so the RAM usage is increased. In this paper, we suggested the demand paging technique for the decreasing of the RAM usage for OS-less NAND booting based embedded systems. As a result of a benchmark test, 40~80% of the code memory usage was reduced with below 5% of execution time delay.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.220-222
• /
• 2000

이동통신 시스템에서 가입자수가 증가하고 다양한 서비스가 구현됨으로써 전체적인 장비 또는 자원에 대한 부하가 증가하고 있다. 특히, 셀의 반경이 작아지고 단문(Short Message)을 활용한 다양한 부가 서비스가 개발됨으로써 이와 관련된 정보를 전달하는 페이징 메시지의 분류도 복잡해지고 페이징 채널의 부하도 커지고 있다. 본 연구에서는 먼저, 이동통신시스템에서 페이징 패널의 구조와 역할을 분석하고 페이징 채널에서 전송하는 메시지를 그 기능과 특성에 따라 분류한다. 긴급하게 전송되어야 하는 메시지를 보호하기 위한 우선권 부여 방법을 모색하고, 각 방법에 있어서 메시지 종류별 전송지연시간(Delay)을 수리적으로 도출하고 결과를 비교한다.