Saturated throughput of PCA with Hard DRPs in Cognitive WiMedia MAC

An analytical formulation of the saturated throughput of Prioritized Contention Access (PCA) with Hard Distributed Reservation Protocols (DRPs), Quiet Period (QP) and Beacon Period (BP) in Cognitive 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 QP and BP. A numerical result of the saturated throughput corresponding to typical parameter values is presented.