Throughput and delay analysis of the ideal window stabilized ALOHA

European Transactions on Telecommunications

Volumn 10, Issue 5, 1999, Pages 505-511

  Alcober, Jesus ^a   Casares, Vicente ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001408829     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460100505     Document Type: Article

References (23)

1. N. Abramson. The ALOHA system-another alternative for computer communications. in AFIPS Conference Proceedings, Fall Joint Computer Conference, 1970, pages 281-285.
2. L. Roberts. ALOHA packet system with and without slots and capture. Computer Communications Review, Vol. 5, No. 2, pages 28-42, April 1975.
3. B. Hajek and T. Van Loon. Decentralized dynamic control of a multiaccess broadcast channel. IEEE Trans. on Automatic Control, Vol. 27, No. 6, pages 559-569, June 1982.
4. R. Rivest. Network control by bayesian broadcast. IEEE Trans. on Inf. Theory, Vol. 33, No. 3, pages 323-328, May 1987.
5. B. Tsybakov and V. Mikhailov. Free synchronous packet access in a broadcast channel with feedback. Probl. Pered. Inf., Vol. 14, No. 4, pages 32-59, October-December 1978.
6. J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Trans. on Inf. Theory, Vol. 25, No. 5, pages 505-515, September 1979.
7. J. Massey. Collision resolution algorithms and random-access communications. in Multi-user Communication Systems, CISM Courses and Lectures Series, pages 73-137. Ed. G. Longo, Springer-Verlag, 1981.
8. R. Gallager. Conflict resolution in random access broadcast networks. in AFOSR Workshop Communication Theory and Applications. IEEE, September 1978, pages 74-76.
9. B. Tsybakov and V. Mikhailov. Random multiple access of packets: part-and-try algorithm. Prob. Pered. Inf., Vol. 16, No. 4, pages 65-79, October-December 1980.
10. N. Pippenger. Bounds on the performance of protocols for a multiple access broadcast channel. IEEE Trans. on Inf. Theory, Vol. 27, No. 3, pages 145-152, March 1981.
11. M. Molle. On the capacity of infinite population multiple access protocols. IEEE Trans. on Inf. Theory, Vol. 28, No. 5, pages 396-401, May 1982.
12. R. Cruz and B. Hajek. A new upper bound to the throughput of a multi-access broadcast channel. IEEE Trans. on Inf. Theory, Vol. 28, No. 3, pages 402-405, May 1982.
13. V. Mikhailov and B. Tsybakov. An upper bound for the capacity of a random multiple access system. Prob. Pered. Inf., Vol. 17, No. 1, pages 90-95, January 1981.
14. B. Tsybakov. Resolution of a conflict of known multiplicity. Prob. Pered. Inf., Vol. 16, No. 2, pages 69-82, April-June 1980.
15. L. Georgiadis and P. Papantoni-Kazakos. A collision resolution protocol for random access channels with energy detectors. IEEE Trans. on Commun., Vol. 30, No. 9, pages 2413-2420, November 1982.
16. M. Ruszinko and P. Vanroose. How an Erdös-Rényi-type search approach gives an explicit code construction rate 1 for random access with multiplicity feedback. IEEE Trans. on Inf. Theory, Vol. 43, No. 1, pages 368-373, January 1997.
17. M. Paterakis and P. Papantoni-Kazakos. A simple window random access algorithm with advantageous properties. IEEE Trans. on Inf. Theory, Vol. 35, No. 5, pages 1124-1130, September 1989.
18. V. Casares and J. Alcober. Voice and data integration in wireless networks. in Wireless, Calgary (Canada), July 1994, Vol. 1, pages 1-10.
19. J. Alcober. Aportación al Estudio de los Protocolos de Acceso Múltiple: el Protocolo ALOHA Estabilizado de Ventana. Ph.D. thesis, Universität Politecnica de Catalunya, Barcelona (Spain), March 1997.
20. S. Jangi and L. Merakos. Performance analysis of reservation random access protocols for wireless access networks. IEEE Trans. on Commun., Vol. 42, No. 2, pages 1223-1234, February 1994.
21. M. Paterakis and A. Cleary. On the voice-data integration in third generation wireless access communications systems. Europ. Trans. on Telecomm. and Related Technologies, Vol. 5, No. 1, pages 11-18, January-February 1994.
22. L. Georgiadis, L. Merakos, and P. Papantoni-Kazakos. A method for the delay analysis of random multiple-access algorithms whose delay process is regenerative. IEEE JSAC, Vol. 5, No. 6, pages 1051-1062, July 1987.
23. J. Huang and T. Berger. Delay analysis of 0.487 contention resolution algorithms. IEEE Trans. on Commun., Vol. 34, No. 9, pages 916-926, September 1986.