In this paper, we propose a cost effective IP paging protocol, which can be used for terminal paging in next-generation wireless IP networks. In the existing IP paging protocols, a paging request packet is delivered to access routers belonging to a paging area by unicast or multicast. However, unicast and multicast result in higher cost, so that we present a selective paging algorithm utilizing...

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging while locating mobile users. Reduction of communication overhead has become a burning issue of today. It induces the intellects to innovate some means which are cost reducing by nature. Location management aims to reduce this overhead through predicti...

For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing explicit multicast (xcast). Xcast is a new kind of multicast scheme for small sized groups which uses unicast with low maintenance overhead. In terms of the paging algorithm, we use a selective paging scheme to minimize th...

Significant IP mobility mechanisms have been designed to minimize the handover overhead of mobile nodes. Although many efficient algorithms such as Mobile IP, HMIP and PMIP have been proposed, they did not attempt to upgrade their paging mechanisms that also heavily affect the power consumption of mobile nodes. Considering a good paging scheme is important because more than 95% of mobile nodes ...

Multi-step paging has been widely proposed in personal communications services (PCS) systems to reduce the signaling overheads. Similar ideas can be applied to Mobile IP to provide IP paging services. However, current proposed multi-step paging schemes are user dependent under which the partition of paging areas and the selection of paging sequence are different for each user. The performance o...

In this article, we initiate the study of weighted paging problem with predictions. This continues recent line work in online algorithms predictions, particularly that Lykouris and Vassilvitski (ICML 2018) Rohatgi (SODA 2020) on unweighted We show unlike paging, neither a fixed lookahead nor knowledge next request for every page is sufficient information an algorithm to overcome existing lower ...

The necessity for employing various location management procedures, in conjunction with the millions of users expected to subscribe to third generation mobile telecommunication systems, will generate a huge amount of signalling load. In this paper, we propose a method which aims at the significant reduction of the signalling overhead on the radio link produced by the paging procedure compared t...

This paper presents a comparative analysis on the signaling cost functions of Mobile IP (MIP) with different paging protocols and schemes and investigates constructing optimal paging areas using discrete system model as a mobility model. In wireless mobile Internet, mobile users often visit foreign networks that might be far away from their home networks and the occurrences of their inter-domai...

This paper considers a paging problem in the optical feeder microcellular system where group simulcasting and dynamic channel allocation technologies are incorporated. The objective is to propose an effective paging procedure whose performance is measured in terms of paging load, average paging delay, and paging success probability. In the paging procedure, paging signals are transmitted via gr...