Throughput of single-hop unslotted CDMA networks with fixed packet lengths
Ming Yin, V.O.K. Li · 2003
The authors present a recursive method to compute the joint distribution of bit errors for single-hop unslotted code-division multiple-access (CDMA) networks with deterministic packet lengths. The computational complexity of this method grows polynomially with M, the number of bits per packet, if the bit error probability equals 1 when the number of interferers exceeds a threshold. The complexity is O(M/sup 3/) for the L-channel model, which assumes that the probability of bit error is zero below the threshold L and 1 above the threshold. The throughput of the system can be improved by using a channel sensing protocol.>