Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Minimizing the average cost of paging under delay constraints
Wireless Networks
Mobile user location update and paging under delay constraints
Wireless Networks
A selective location update strategy for PCS users
Wireless Networks
P-MIP: paging extensions for mobile IP
Mobile Networks and Applications - Analysis and Design of Multi-Service Wireless Networks
IP paging service for mobile hosts
Wireless Networks
Extending mobile IP with adaptive individual paging: a performance analysis
ACM SIGMOBILE Mobile Computing and Communications Review
Performance Evaluation of IP Paging with Power Save Mechanism
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
An adaptive per-host IP paging architecture
ACM SIGCOMM Computer Communication Review - Special issue on wireless extensions to the internet
A survey of mobility management in next-generation all-IP-based wireless systems
IEEE Wireless Communications
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
A new random walk model for PCS networks
IEEE Journal on Selected Areas in Communications
Dynamic multi-step paging scheme in PMIPv6-based wireless networks
Wireless Networks
Hi-index | 0.00 |
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 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 algorithm to minimize the paging cost, by dividing a paging area into several subpaging areas, while meeting the paging delay bound. In addition, we propose flexible grouping algorithms. For the performance analysis, we develop analytical paging cost and delay models based on the random walk model. Using the models, we compare the selective IP paging scheme using xcast with the existing paging schemes that use unicast or multicast. The results indicate that the proposed scheme significantly reduces the paging cost compared with traditional schemes, especially when the transmission cost is relatively less than the processing cost and the delivery path is not long. In addition, our flexible grouping algorithms, which are adaptive to the session-to-mobility ratio, provide less paging cost and guarantee equal to or less paging delay compared with the existing schemes.