Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

A Class of Limited Sensing Random Access Algorithms with Resistance to Feedback Errors and Effective Delay Control

  • Burrell Anthony T. (Oklahoma State University) ;
  • Papantoni Titsa P. (University of Colorado)
  • Published : 2006.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this throughput degrades gracefully in the presence of channel feedback errors.

Keywords

References

  1. J. L. Massey, 'Collision resolution algorithms and random access communications,' in Multiuser Communication, G. Longo Ed., New York, Springer-Verlag
  2. B. S. Tsybakov and V. A. Mikhailov, 'Free synchronous packet access in a broadcast channel with feedback,' Probl. Pered. Inform., vol. 14, no. 4, pp. 259-280, 1978
  3. L. Georgiadis and P. Papantoni-Kazakos, 'A 0.487 throughput limited sensing algorithm,' IEEE Trans. Inform. Theory, vol. IT-33, no. 2, pp. 233-237, Mar. 1987
  4. M. Paterakis and P. Papantoni-Kazakos, 'A simple window random access algorithm with advantageous properties,' IEEE Trans. Inform. Theory, vol. 35, pp. 1124-1130, Sept. 1989 https://doi.org/10.1109/18.42234
  5. J. I. Capetanakis, 'Tree algorithms for packet broadcast channel,' IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979
  6. B. S. Tsybakov and V. A. Mikhailov, 'Ergodicity of a slotted ALOHA system,' Probl. Pered. Inform., vol. 15, no. 4, pp. 73-87, Oct.-Dec. 1979
  7. R. G. Gallager, 'Conflict resolution in random access broadcast networks,' in Proc. AFOSR Workshop Commun. Theory Appl., Provincetown, MA, Sept. 1978, pp. 74-76
  8. M. Paterakis, L. Georgiadis, and P. Papantoni-Kazakos, 'On the relation between the finite and the infinite population models for a class of RAAs,' IEEE Trans. Commun., vol. COM-35, pp. 1239-1250, Nov. 1987
  9. B. S. Tsybakov and N. B. Likanov, 'Some new random multiple access algorithms,' Probl. Pered. Inform., vol. 21, no. 2, pp. 134-154, 1985
  10. B. S. Tsybakov and V. B. Fayngold, 'A non-homogeneous frame RMA algorithm,' Probl. Pered. Inform., vol. 25, no. 2, pp. 126-136, 1989
  11. S. Stidman, Jr., 'Regenerative processes in the theory of queues with applications to the alternating priority queue,' Adv. Appl. Prob., vol. 4, pp. 542-577, 1972 https://doi.org/10.2307/1425993
  12. 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 J. Select. Areas Commun., vol. SAC-5, pp. 1051-1062, July 1987