Contention resolution multiple access techniques for handling speech and data traffic on wireless networks

  • Fulvio Babich
Keynote Paper Session XII: Random Access
Part of the Lecture Notes in Computer Science book series (LNCS, volume 783)


We propose a methodology for applying contention resolution multiple access techniques on a slotted and framed radio channel. The proposed techniques are able to handle the access of a mixed class of users, one consisting of a dynamic set of speech users whose information must respect strict delay limitations, the other including a population of users which generate a random traffic. The proposed techniques “decouple” the speech access procedure from the data access procedure. It follows that speech access performances do not depend on actual data load. Random traffic access performances are optimised for the Poisson user model. We also propose a multiple access technique for handling multi-rate traffic. The proposed technique permits to implement prioritised access policies and selective packet discarding. If speech users employ coding schemes that separate information components by significance, this technique can be used to drop less significant information.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D.J. Goodman, S.X. Wei, “Efficiency of Packet Reservation Multiple Access”, IEEE Trans. Vehic. Tech., Vol. 40, No. 1, pp. 170–176, Feb. 1991.CrossRefGoogle Scholar
  2. [2]
    D.J. Goodman, “Cellular Packet Communications”, IEEE Trans. Commun., Vol. 38, No. 8, pp. 1272–1280, Aug. 1990.CrossRefGoogle Scholar
  3. [3]
    D.J. Goodman, G.P. Pollini, K.S. Meier-Hellstern, “Network Control for Wireless Communications”, IEEE Commun. Mag., Vol. 30, No. 12, pp. 116–124, Dec. 1992.CrossRefGoogle Scholar
  4. [4]
    F. Babich, “A Packet Access Method For Handling Mixed Traffic On Wireless Networks”, in Proc. Wireless 93, Calgary, July 1993.Google Scholar
  5. [5]
    V. Casares, J. Paradells “Variable Voice Service Rate in Wireless Access Packet Networks”, in Proc. Wireless 93, Calgary, July 1993.Google Scholar
  6. [6]
    H.-J. Lin, G. Campbell “Using DQRAP (Distributed Queuing Random Access Protocol) for Local Wireless Communications”, in Proc. Wireless 93, Calgary, July 1993.Google Scholar
  7. [7]
    Rom, Sidi, “Multiple Access Protocols: Performance and Analyses”, Springer-Verlag.Google Scholar
  8. [8]
    J.L. Massey, “Collision-Resolution Algorithms and Random-Access Communications”, in Multi-User Communication Systems, G. Longo Ed., Springer-Verlag.Google Scholar
  9. [9]
    T. Berger, “The Poisson Multiple-Access Conflict Resolution Problem”, in Multi-User Communication Systems, G. Longo Ed., Springer-Verlag.Google Scholar
  10. [10]
    M. Paterakis, P. Papantoni Kazakos, “A Simple Window Random Access Algorithm with Advantageous Properties”, IEEE Trans. Inform. Theory, vol. IT-35, pp. 1124–1130, September 1989.Google Scholar
  11. [11]
    P. Papantoni Kazakos, “Multiple-Access Algorithms for a System with Mixed Traffic: High and Low Priority”, IEEE Trans. Commun., vol. 40, pp. 541–555, March 1992.Google Scholar
  12. [12]
    D.J. Goodman, “Embedded DPCM for Variable Bit Rate Transmissions”, IEEE Transact. on Communications, Vol. 28, n.7, pp. 1040–1046, July 1980.Google Scholar
  13. [13]
    M.W. Garret, M. Vetterli, “Joint Source/Channel Coding of Statistically Multiplexed Real-Time Services on Packet Networks”, IEEE/ACM Transact. on Networking, Vol. 1, n.1, pp. 71–80, February 1993.Google Scholar
  14. [14]
    F. Babich, “Design of Access Protocols Able to Handle a Mixed Traffic on Slotted Channels”, Tecnica Italiana, Anno LVIII, No. 3, pp. 171–187, July–August 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Fulvio Babich
    • 1
  1. 1.DEEI - Dipartimento di ElettrotecnicaElettronica e Informatica Università di TriesteTriesteItaly

Personalised recommendations