Improved mathematical model of simplified Constrained Priority Countdown Freezing protocol (CROSBI ID 604342)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Kristić, Ante ; Ožegović, Julije ; Kedžo, Ivan
engleski
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.
MAC modeling; collision memory; backoff freezing; CSMA/CA; Markov chain; saturation throughput
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o prilogu
1-5.
2013.
objavljeno
Podaci o matičnoj publikaciji
Software, Telecommunications and Computer Networks (SoftCOM), 2013 21st International Conference on
Podaci o skupu
Software, Telecommunications and Computer Networks (SoftCOM), 2013 21st International Conference on
predavanje
18.09.2013-20.09.2013
Primošten, Hrvatska