Mathematical model of Constrained Priority Countdown Freezing Protocol (CROSBI ID 619005)
Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Kristić, Ante ; Ožegović, Julije ; Kedžo, Ivan
engleski
Mathematical model of Constrained Priority Countdown Freezing Protocol
In this paper a mathematical model of Constrained Priority Countdown Freezing (CPCF) protocol is introduced. In the new model presented, the existing model of simplified CPCF is expanded in order to include the binary exponential backoff (BEB) algorithm. Thus, the behavior of a single CPCF station is modeled using four-dimensional Markov chain. In addition, the probability of the contention loss after a busy timeslot (TS) is differentiated based on the value of the station’s freezing counter. The results of mathematical model are compared to the simulation results, showing that the proposed expanded scheme models the CPCF medium access method with expected accuracy.
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.
2014.
objavljeno
Podaci o matičnoj publikaciji
Software, Telecommunications and Computer Networks (SoftCOM), 2014 22nd International Conference on
Podaci o skupu
Software, Telecommunications and Computer Networks (SoftCOM), 2014 22nd International Conference on
predavanje
17.09.2014-19.09.2014
Split, Hrvatska