Paging strategies for highly mobile users
- 22 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Locations polled to that point is n sn = kj (1) In this work, we consider the problem of minimizing aver- age paging cost and polling delay in a wireless system. It is assumed that users to be paged move according to a gen- era1 motion process during the paging events. We find and evaluate the optimal sequential paging strategies for given maximum delay tolerance and compare our results to the classical paging strategy as well as the optimal strategies for stationary units (users). i=l Using the number of locations searched a.~ a surrogate for signaling cost we haveKeywords
This publication has 7 references indexed in Scilit:
- The use of SS7 and GSM to support high density personal communicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Minimization of paging and registration costs through registration deadlinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Adaptive paging algorithms for cellular systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Paging cost minimization under delay constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimizing the average cost of paging and registration: A timer-based methodWireless Networks, 1996
- Minimizing the average cost of paging under delay constraintsWireless Networks, 1995
- Network protocols for the cellular packet switchIEEE Transactions on Communications, 1994