Movement-based location update and selective paging for PCS networks
IEEE/ACM Transactions on Networking (TON)
Reducing location update cost in a PCS network
IEEE/ACM Transactions on Networking (TON)
Paging strategy optimization in personal communication systems
Wireless Networks
Minimizing the average cost of paging under delay constraints
Wireless Networks
A selective location update strategy for PCS users
Wireless Networks
Computer Networks
An anchor chain scheme for IP mobility management
Wireless Networks
Predictive distance-based mobility management for multidimensional PCS networks
IEEE/ACM Transactions on Networking (TON)
Design and Analysis of Location Management for 3G Cellular Networks
IEEE Transactions on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Group Registration with Local Anchor for Location Tracking in Mobile Networks
IEEE Transactions on Mobile Computing
A dynamic location management scheme for next-generation multitier PCS systems
IEEE Transactions on Wireless Communications
Optimal location management for two-tier PCS networks
Computer Communications
Location management methods for third generation mobile systems
IEEE Communications Magazine
A location-based mobility tracking scheme for PCS networks
Computer Communications
A profile-based location strategy and its performance
IEEE Journal on Selected Areas in Communications
An adaptive distance-based location update algorithm for next-generation PCS networks
IEEE Journal on Selected Areas in Communications
An alternative strategy for location tracking
IEEE Journal on Selected Areas in Communications
Location management for next-generation personal communications networks
IEEE Network: The Magazine of Global Internetworking
Paging and location management in IEEE 802.16j multihop relay network
Journal of Computer Systems, Networks, and Communications - Special issue on WiMAX, LTE, and WiFi interworking
| Hi-index | 0.00 |
In this paper, we present a simple pipeline paging (PP) scheme, in which multiple paging requests (PRs) can be served in a pipeline manner in different paging areas. We analytically model the blanket paging (BP) scheme, the sequential paging (SP) scheme, and the PP scheme so that discovery rate, total delay, paging delay, and cost are derived analytically as functions of traffic load. Extensive simulations are carried out to verify our analytical results. Our study shows that the PP scheme outperforms both the BP and SP schemes in terms of discover rate while maintaining the same cost as the SP scheme. The PP scheme outperforms the SP scheme in terms of total delay and has a lower total delay than the BP scheme when traffic load is high. We also show that, when the paging delay constraint D is large enough, the PP scheme achieves almost 200 percent of discovery rate and 50 percent of cost of the BP scheme, whereas discovery rate of the SP scheme is far less than that of the BP scheme. Furthermore, we solve the following two-optimization problems for the PP scheme: 1) the minimization of discovery rate with a bound on total delay and 2) the minimization of cost with a bound on total delay. In case the cost factor is not considered but total delay is important, we propose an adaptive scheme: When the traffic is lower than a threshold, the BP scheme is adopted; otherwise, the PP scheme is used. In this case, the threshold value is explicitly derived.