Throughput performance of multiuser detection in unslotted contention channels
The throughput of a centralized packet receiver capable of demodulating all overlapping unit-length packets provided that T-length packet headers do not overlap but K packets overlap at any one time, is analyzed. Violating one of the stated conditions suggests that the remainder of the busy period is unresolvable. Assuming that the aggregate packet arrival process is Poisson, the throughput is analyzed as a function of the total offered load, the maximum number of resolvable overlapping packets, and the fractional header duration. The throughput of the analyzed functions are given. Numerical results illustrate the improvement in throughput due to multiuser detection which suggest a technique for finding the minimum complexity multiuser receiver as a function of other system parameters.