Minimizing the average cost of paging under delay constraints
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
A Novel Distributed Dynamic Location Management Scheme for Minimizing Signaling Costs in Mobile IP
IEEE Transactions on Mobile Computing
Optimal sequential paging in cellular wireless networks
Wireless Networks
Convex Optimization
IEEE/ACM Transactions on Networking (TON)
IP Paging Schemes Adaptive to Mobile Host Parameters
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
A comparison of different paging mechanisms for mobile IP
Wireless Networks
A generic IP paging architecture and protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the European wireless 2004 conference
IEEE Communications Surveys & Tutorials
A survey of mobility management in next-generation all-IP-based wireless systems
IEEE Wireless Communications
IEEE Communications Magazine
Hi-index | 0.00 |
This paper considers several optimization problems of sequential paging with aggregation mechanism which has been shown to reduce significantly the paging cost of a wireless communication system. An important problem is to find the optimal aggregation factor subject to a constraint on the average paging delay. Another problem is, given a cost function that depends on both paging cost and paging delay, how to find the optimal aggregation factor to minimize that cost function. We have formulated and shown that these can be solved nicely due to the monotonicity and convexity of the average paging cost function and paging delay function. We demonstrate that the optimization problems of the aggregate factor and subnet clustering are not separable. This leads to joint optimization problems of aggregation factor and clustering that are investigated in this paper. The paper presents different algorithms to solve these joint optimization problems using the monotonicity in the aggregation factor and the number of clusters of the average paging cost and delay with the unconstrained optimal clustering and the structures of the constrained optimal clustering.