Paging and registration in cellular networks: Jointly optimal policies and an iterative algorithm

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 524-532

  Hajek, Brace ^a   Mitzel, Kevin ^b   Yang, Sichao ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b Sirius Satellite Radio   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MARKOV PROCESSES; OPTIMIZATION; PAGING SYSTEMS; PUBLIC POLICY; CELLULAR NEURAL NETWORKS; ITERATIVE METHODS; STRUCTURAL OPTIMIZATION;

CELLULAR NETWORKS;

PERSONAL COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING;

AVERAGE COST; CELLULAR NETWORK; DISCRETE-TIME; INFINITE HORIZONS; ITERATIVE ALGORITHM; OPTIMAL POLICIES; POLICY OPTIMIZATION; SIMPLE STRUCTURES;

EID: 0042934008     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. I.F. Akyildiz, J.S.M. Ho, and Y.B Lin, "Movement-based location update and selective paging for PCS networks," IEEE/ACM Transactions on Networking, vol. 4, pp. 629-638, August 1996.
2. A. Bar-Noy and I. Kessler, "Tracking mobile users in wireless communication networks," Proc. IEEE Infocom, pp. 1232-1239, 1993.
3. A. Bar-Noy, I. Kessler and M. Sidi, "Mobile users: To update or not to update?" IEEE/ACM Transactions on Networking, vol. 4, pp. 629-638, August 1996.
4. D. P. Bertsekas, Dynamic Programming and Optimal Control, Vol. I. Athena Scientific, Belmont, MA, 1995.
5. D. P. Bertsekas, Dynamic Programming and Optimal Control, Vol. II. Athena Scientific, Belmont, MA. 1995.
6. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, Belmont, MA. 1996.
7. Y. Birk and Y. Nachman, "Using direction and elapsed-time information to reduce the wireless cost of locating mobile units in cellular networks." Wireless Networks, 1995.
8. V. K. Garg and J. E. Wilkes, Wireless and Personal Communications Systems, Prentice Hall, New Jersey, 1996.
9. C. -L. I, G. P. Pollini, and R. D. Gitlin, "Optimum location area sizes and reverse virtual call setup in PCS networks," Proc. 45th IEEE Vehicular Technology Conference, vol. 1, pp. 140-144, 1995.
10. L. Kleinrock, Queueing Systems, Vol. I: Theory. John Wiley & Sons, Inc., New York, NY. 1975.
11. B. Krishnamachari, R. Gau, S. B. Wicker, and Z. J. Hass, "On the performance of sequential paging for mobile user location," Submitted manuscript, 2001.
12. S. Madhavapeddy, K. Basu, and A. Roberts, "Adaptive paging algorithms for cellular systems," Proc. 45th IEEE Vehicular Technology Conference, vol. 2, pp. 976-980, 1995.
13. U. Madhow, M. L. Honig, and K. Steiglitz, "Optimization of wireless resources for personal communications mobility tracking," IEEE/ACM Transactions on Networking, vol. 3, pp. 698-707, December 1995.
14. C. Rose and R. Yates, "Minimizing the average cost of paging under delay constraints," Wireless Networks, vol. 1, pp. 211-219, 1995.
15. C. Rose, "Minimizing the average cost of paging and registration: A timer-based method," Wireless Networks, vol. 2, pp. 109-116, 1996.
16. C. Rose, "State-based paging/registration:a greedy technique," IEEE Transactions on Vehicular Technology, vol. 48, pp. 166-173, January 1999.
17. W. Wang, I. F. Akyildiz, and G. L. Stuber, "Effective paging schemes with delay bounds as QoS constraints in wireless systems," Wireless Networks, vol. 7, pp. 455-466, 2001.