Optimized Policies for the Retransmission Probabilities in Slotted Aloha

SIMULATION

Volumn 86, Issue 4, 2010, Pages 247-261

  Chakraborty, Anshuk ^a   Bhatnagar, Shalabh ^b  

^a NATIONAL INSTITUTE OF TECHNOLOGY   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

closed loop optimization; optimal retransmission probability; slotted Aloha; smoothed functional algorithms

Indexed keywords

CLOSED-LOOP; OPTIMAL RETRANSMISSION PROBABILITY; RETRANSMISSIONS; SLOTTED ALOHA; SMOOTHED FUNCTIONAL ALGORITHMS;

APPROXIMATION THEORY; COST FUNCTIONS; FEEDBACK; PACKET NETWORKS; PROBABILITY; STATE FEEDBACK; STRUCTURAL OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 77952600426     PISSN: 00375497     EISSN: None     Source Type: Journal    
DOI: 10.1177/0037549709349324     Document Type: Article

References (18)

1. Abramson, N. 1970. The ALOHA system-another alternative for computer communications. AFIPS Conference Proceedings (1970 Fall Joint Computer Conference), 37: 281-285.
2. Bertsekas, D.P. and R.G. Gallager. 1992. Data Networks, Prentice-Hall, Englewood Cliffs, NJ.
3. Roberts, L.G. 1975. ALOHA packet system with and without slots and capture. Computer Communication Review, 5: 28-42.
4. Saadawi, T. and A. Ephremides. 1981. Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users. IEEE Transactions on Automatic Control, 26(3): 680-689.
5. Altman, E., Azouzi, R.E. and Jiménez, T. (2004) “ Slotted Aloha as a game with partial information”, Computer Networks, 45(6): 701- 713.
6. Gerla, M. and L. Kleinrock. 1977. Closed loop stability controls for S-Aloha satellite communications. Proceedings of the Fifth Symposium on Data Communications, pp. 2.10-2.19.
7. Bhatnagar, S. and V.S. Borkar. 1998. ‘A two time scale stocastic approximation scheme for simulation based parametric optimization. Probability in the Engineering and Informational Sciences, 12: 519-531.
8. Bhatnagar, S. and V.S. Borkar. 2003. Multiscale chaotic SPSA and smoothed functional algorithms for simulation optimization. Simulation, 79(10): 568-580.
9. Bhatnagar, S., M.C. Fu, S.I. Marcus and S. Bhatnagar. 2001. Two timescale algorithms for simulation optimization of hidden Markov models. IIE Transactions, 33(3): 245-258.
10. Bhatnagar, S. 2007. Adaptive Newton-based multivariate smoothed functional algorithms for simulation optimization. ACM Transactions on Modeling and Computer Simulation, 18(1): 2:1-2:35.
11. Spall, J.C. 1992. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Transactions on Automatic Control, 37(3): 332-341.
12. Katkovnik, V.Y. and Yu. Kulchitsky. 1972. Convergence of a class of random search algorithms. Automation and Remote Control, 8: 1321-1326.
13. Styblinski, M.A. and T.-S. Tang. 1990. Experiments in nonconvex optimization: stochastic approximation with function smoothing and simulated annealing. Neural Networks, 3: 467-483.
14. Mishra, V., S. Bhatnagar and N. Hemachandra. 2007. Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times. Proceedings of IEEE Conference on Decision and Control, New Orleans, LA.
15. Box, G.E.P. and M.E. Muller. 1958. A note on the generation of random normal deviates. Annals of Mathematical Statistics, 29: 610-611.
16. Pemantle, R. 1990. Nonconvergence to unstable points in urn models and stochastic approximations. Annals of Probability, 18: 698-712.
17. Brandiere, O. 1998. Some pathological traps for stochastic approximation. SIAM Journal of Control and Optimization, 36: 1293- 1314.
18. Wu, B. and Q. Wang. 1997. Maximization of the channel utilization in wireless heterogeneous multiaccess networks. IEEE Transactions on Vehicular Technology, 46(2): 437-444.