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

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.