An adaptive per-host IP paging architecture

Abstract

IP Paging has received considerable attention recently . Th e IETF has decided to develop an IP Paging protocol an d some IP Paging protocols have been proposed by researcher s [13,12] . However all of these proposals use static and manually configured paging areas . We argue that the size and the shape of paging areas are very critical for the performance of a paging system . A system that allows each hos t to use a paging area that adapts to its mobility and communication patterns will perform better . This paper proposes to extend the IETF IP Paging functional architecture to support adaptive and per-host paging areas . We introduce a new functional module, the Paging Area Configuration Agent (PACA), that automatically configures th e paging area relative to each cell of a cellular domain . . INTRODUCTIO NIn this paper we consider wireless access to the Internet vi a cellular IP networks [2,11] . We envision the next generation of cellular wireless networks as pure IP-based network s where base stations are IP-routers . In these networks, mobility should be handled at the IP layer . Different mobility management protocols have been proposed for such networks (e .g . HAWAII [10], CellularlP [2]) . Mobile IP [9, 5 ] is of course a good candidate but needs some extensions t o be used efficiently in such environments . Mobile IP require s that a mobile host sends a location registration message t o its Home Agent whenever it moves from one point of attachment to another one . These location registrations ar e required even if the mobile host is in dormant mode (i .e . idle) while moving . This signaling cost can become quit e significant as the number of mobile hosts increases and th e cell sizes get smaller . Furthermore with Mobile IP, a dormant host has to wake up each time it moves to send a registration . This is obviously not very power-efficient .Several proposals have been made to extend Mobile IP with paging [13,12] . Paging is based on the division of the network in several paging areas . A dormant mobile host onl y sends a location registration message to its Home Agen t when it enters a new paging area . When the Home Agent needs to contact the mobile host for packet delivery, th e host is paged in its current paging area . The host then reports its exact location to its Home Agent using standar d Mobile IP . The IETF Seamoby Working Group [4] has bee n chartered to develop an IP Paging protocol . Recently, th e working group has proposed a functional architecture and i s currently working on the protocol . Current IP Paging protocol proposals use static and manually configured paging areas . We argue that a system that allows each host to use a per-host paging area that adapts to its mobility and communication patterns will perform better than a scheme that uses static paging areas (in terms of signaling load and power consumption) . This paper proposes to extend the IETF IP Paging functional architectur e to support adaptive per-host paging areas . We do not propose a new IP Paging protocol but rathe...

A comparison of different paging mechanisms for mobile IP

“…In [11], the authors proposed a practical solution for adaptive Individual IP Paging by sharing load of configuration and calculation between the network and MHs. More precisely, the optimal PA size is computed per-host while the PA shape is constructed based on the aggregate mobility patterns of all MHs.…”

“…Individual paging: Individual paging schemes are motivated by the observation that mobility and communication patterns of MHs may vary, and thus, a paging scheme adaptive to each individual MH would perform more efficiently. In individual paging, paging schemes may differ to one another in the way they are adaptive as presented in [2] and [11].…”

A cost-effective approach to selective IP paging scheme using explicit multicast

“…However, they mentioned that the use of IP multicast might be a possible solution, but more works are required, especially for dynamic paging areas or selective paging schemes. In [13], they mentioned the use of small group multicast (SGM), which is similar to xcast. However, in this work, since a PA is dynamically constructed by the determination of MH, it results in high computation overhead and energy consumption of the MH.…”

A Dynamic IP Paging Algorithm based on the Velocity of Mobile Node for Proxy Mobile IPv6

“…Several studies on IP paging have been progressed for determining the paging area size dynamically [7,8,9]. However, those studies considered the speed of MN only at the calculation of the paging area size and suggested that the paging area size of MN should expand as its speed increased,…”