Collision resolution algorithms (CRA’s) for the ternary feedback multiple access channel with time constraints are considered. We wish to maximize the number of packets successfully transmitted within a fixed deadline K after their arrival for transmission. Packet arrivals are assumed to be Poisson. A nonnested CRA is described and its performance is compared with a nested CRA for values of K ≤ 4.
ASJC Scopus subject areas
- Electrical and Electronic Engineering