Performance Analysis of IEEE802.16d Random Access Protocol

In this paper, we investigate the performance of IEEE802.16d random access protocol based on orthogonal code-division-multiple-access and frequency-division-multiple-access in time division duplexing mode using equilibrium point analysis. The random access protocol of IEEE802.16d is similar to demand-assigned multiple access with piggyback, in which bandwidth request is allowed at the end of data transmission. In the analysis, we consider the retransmission probability derived from a binary exponential backoff algorithm. The performance is presented in terms of initial access delay, its throughput, message transmission delay and the system throughput with piggyback by varying number of subscriber stations, number of PN codes for bandwidth request ranging, number of slot-subchannel and the parameters of the binary exponential backoff algorithm.