Saturated Throughput of Burst Mode PCA with Hard DRPs in WiMedia MAC

An analytical formulation of the saturated throughput of burst mode prioritized contention access (PCA) with hard distributed reservation protocols (DRPs) and beacon period (BP) in WiMedia MAC is presented. The analytical framework is formulated for one hard DRP class and N PCA classes. The state transition diagram for the ith priority PCA class is modeled by a tri-dimensional discrete-time Markov chain. One dimension of the Markov chain is for the backoff stage, the second dimension is for the value of the backoff counter, while the third dimension is mainly for the delay due to DRP transmissions or BP. The probability of the number of consecutive DRP MASs and the number of consecutive PCA MASs are derived, taking into consideration of all possible combinations of the DRP locations in a superframe. These probabilities are essential for the modeling of the Markov chain.