Minimizing the average cost of paging and registration: A timer-based method

Wireless Networks

Volumn 2, Issue 2, 1996, Pages 109-116

  Rose, C ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; SIGNAL DETECTION; TRANSCEIVERS;

POISSON INCOMING CALL ARRIVAL MODEL;

PAGING SYSTEMS;

EID: 0030368667     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01225634     Document Type: Article

References (23)

1. K.S. Meier-Hellstern, G.P. Pollini and D.J. Goodman, Network protocols for the cellular packet switch, IEEE Trans. Commun. 42(2-4/2) (1994) 1235.
2. K.S. Meier-Hellstern, .E. Alonso and D. O'Neil, The use of SS7 and GSM to support high density personal communications, Proc. Int. Conf. on Communications, ICC '92 (1992).
3. S. Tabbane, Comparison between the alternative location strategy and the classical location strategy, Winlab-TR 37 (1992).
4. H. Xie, S. Tabbane and D.J. Goodman, Dynamic location area management and performance analysis, Proc. IEEE Vehicular Technology Conference (1993).
5. A. Bar-Noy and I. Kassler, Tracking mobile users in wireless networks INFOCOM '93, San Fransisco, CA (1993) pp. 1232-1239.
6. S. Tabbane, Evaluation of an alternative location strategy for future high density wireless communications systems, Winlab-TR 51 (1993).
7. G. Pollini and S. Tabbane, The intelligent network signaling and switching cost of an alternative location strategy using memory, Proc. IEEE Vehicular Technology Conference, VTC'93, Seacaucus, NJ (1993).
8. W. Wang, R.N. Saadawi and K.-i. Aihara, Bandwidth allocation for atm networks, IEEE Int. Conf. on Communications, ICC'90 (1990) pp. 439-442.
9. S. Okasaka, S. Onoe, S. Yasuda and A. Maebara, A new location updating method for digital cellular systems, Proc. IEEE Vehicular Technology Conference, VTC '91, Denver, CO (1991) pp. 345-350.
10. A. Awerbuch and D. Peleg, Concurrent online tracking of mobile users, Proc. ACM SIGCOMM Symp. on Communication, Architecture and Protocols (1991).
11. C. Rose and R. Yates, Minimizing the average cost of paging under delay constraints, Wireless Networks 1 (1995) 211-219.
12. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms Complexity (Prentice Hall, 1982).
13. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd Ed. (Wiley, 1968) chap. IV & XIV.
14. University of Waterloo Symbolic Computation Group, Maple V, Ontario, Canada.
15. I.S. Gradshteyn and I.M. Ryzhik, Table of Integrals, Series and Products, Corrected and Enlarged Edition (Academic Press, 1980).
16. Z. Lei and C. Rose, Minimizing paging and registration through time-varying location area boundaries, work in progress.
17. M. Feder, N. Mehrav and M. Gutman, Universal Prediction of Individual Sequences, IEEE Trans. Inf. Theory 38(4) (1993) 1258-1270.
18. R.A. Howard, Dynamic Programming and Markov Processes (MIT Press, 1960).
19. S. Rao and B. Gopinath, Optimizing call management of mobile units, Winlab-TR 63, Rutgers University (1993).
20. C. Rose, State-based paging/registration: A greedy technique, Winlab-TR 92, Rutgers University, IEEE Trans. Veh. Techn. 12 (1994), submitted.
21. E.M. Valsbord and V.I. Zhukovski, Introduction of Multi-Player Differential Games and Their Applications (Gordon and Breach, 1988).
22. R.B. Meyerson, Game Theory: Analysis of Conflict (Harvard Univ. Press, 1991).
23. W.H. McCrea and F.J.W. Whipple, Random paths in two and three dimensions, Proc. Roy. Soc. Edinburgh 40 (1940) 281-298.