Improved mathematical model of simplified Constrained Priority Countdown Freezing protocol

In this paper an accurate model of simplified Constrained Priority Countdown Freezing (CPCF) protocol is introduced. In the new model presented, we abandon the often used assumption that the probability of an idle timeslot is constant. By introducing a model that differentiates this probability based on the channel status, i.e. the transmission status of the previous timeslot, we avoid the inaccuracies of the previous model. The throughput calculated using the mathematical model proposed is compared to the simulation results, showing improved accuracy of the new model.