Analysis of a contention resolution multiple-access algorithm for handling mixed traffic on wireless networks

  • Fulvio Babich
Technical Papers

Abstract

Existing wireless standards, like DECT and GSM, are based on TDMA. Packet multiple-access algorithms perform statistical multiplexing, leading to greater efficiency than basic TDMA which assigns a fixed amount of channel resources to each user. Moreover, these methods permit one to handle in a more flexible way different kinds of information. Most of the proposed packet access methods, applied to radio networks, are based on slotted ALOHA algorithms. We propose a methodology for applying packet contention resolution multiple-access techniques to wireless networks. The proposed techniques are able to handle the access of mixed traffic types. We define and analyze a multiple-access algorithm for handling the access of a mixed set of users, including a group of speech users and a population of users that generate a random traffic approximated by a stream of Poisson.

Key words

Wireless access packet radio network voice/data network multitraffic access techniques 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. J. Goodman, Cellular packet communications,IEEE Transactions on Communications, Vol. 38, No. 8, pp. 1272–1280, 1990.CrossRefGoogle Scholar
  2. 2.
    D. J. Goodman and S. X. Wei, Efficiency of packet reservation multiple access,IEEE Transactions Vehicular Technology, Vol. 40, No. 1, pp. 170–176, 1991.CrossRefGoogle Scholar
  3. 3.
    H. Y. Chung and D. J. Goodman, Transmission of speech and data using packet reservation multiple access,Proc. ICC '91, pp. 99–104.Google Scholar
  4. 4.
    D. J. Goodman and G. P. Pollini, and K. S. Meier-Hellstern, Network control for wireless communications,IEEE Communications Magazine, Vol. 30, No. 12, pp. 116–124, 1992.CrossRefGoogle Scholar
  5. 5.
    W. C. Wong and D. J. Goodman, Integrated data and voice transmission using packet reservation multiple access,Proc. ICC '93, pp. 172–176.Google Scholar
  6. 6.
    R. Ziegler and G. Pollini, An experimental implementation of the PRMA protocol for wireless communications,Proc. VTC '93, pp. 909–912.Google Scholar
  7. 7.
    S. Nanda, Analysis of the packet reservation multiple access joint voice data system,IEEE Transactions on Communications, Vol. 42, No. 5, pp. 2092–2104, 1994.CrossRefGoogle Scholar
  8. 8.
    J. de Ville, A reservation multiple access scheme for an adaptive TDMA air-interface,Winlab Proceedings, 1993.Google Scholar
  9. 9.
    W. Xu and G. Campbell, A near perfect stable random access protocol for a broadcast channel,Proc. ICC '92.Google Scholar
  10. 10.
    H-J. Lin and G. Campbell, Using DQRAP (distributed queuing random access protocol) for local wireless communications,Proc. Wireless '93, pp. 625–635.Google Scholar
  11. 11.
    P. Papantoni Kazakos, Multiple-access algorithms for a system with mixed traffic: High and low priority,IEEE Transactions on Communications, Vol. 40, No. 3, pp. 541–555, 1992.CrossRefGoogle Scholar
  12. 12.
    F. Babich, A packet access method for handling mixed traffic on wireless networks,Proc. Wireless '93, pp. 579–587.Google Scholar
  13. 13.
    J. Filipiak,Real Time Network Management, North-Holland, 1991.Google Scholar
  14. 14.
    P. O'Reilly and S. Ghani, Data performance in burst switching when the voice silence periods have a hyperexponential distribution,IEEE Transactions on Communications, Vol. 35, No. 10, pp. 1109–1112, 1987.CrossRefGoogle Scholar
  15. 15.
    T. Berger, The Poisson multiple-access conflict resolution problem, G. Longo (ed.),Multi-User Communication Systems, Springer-Verlag, 1981.Google Scholar
  16. 16.
    M. Paterakis and P. Papantoni Kazakos, A simple window random access algorithm with advantageous properties,IEEE Transactions on Information Theory, Vol. IT-35, No. 5, pp. 1124–1130, 1989.CrossRefGoogle Scholar
  17. 17.
    Sidi Rom,Multiple Access Protocols: Performance and Analyses, Springer-Verlag, 1990.Google Scholar
  18. 18.
    M. Liu and P. Papantoni Kazakos, A random-access algorithm for data networks carrying high priority traffic,IEEE Transactions on Communications, Vol. 40, No. 1, pp. 84–96, 1992.CrossRefGoogle Scholar
  19. 19.
    S. Tasaka, Stability and performance analysis of the R-ALOHA packet broadcast system,IEEE Transactions on Computers, Vol. C-32, No. 9, pp. 717–725, 1983.Google Scholar
  20. 20.
    F. Babich, Design of access protocols able to handle a mixed traffic on slotted channels,Tecnica Italiana, Anno LVIII, No. 3, 1993.Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • Fulvio Babich
    • 1
  1. 1.DEEIUniversità di TriesteTriesteItaly

Personalised recommendations