Pregled bibliografske jedinice broj: 663629
Mathematical model of simplified Constrained Priority Countdown Freezing protocol
Mathematical model of simplified Constrained Priority Countdown Freezing protocol // 2013 IEEE Symposium on Computers and Communications (ISCC)
Split, Hrvatska, 2013. str. 1-6 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 663629 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Mathematical model of simplified Constrained Priority Countdown Freezing protocol
Autori
Kristić, Ante ; Ožegović, Julije ; Kedžo, Ivan
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
2013 IEEE Symposium on Computers and Communications (ISCC)
/ - , 2013, 1-6
Skup
The 18th IEEE Symposium on Computers and Communications (ISCC'13), 2013
Mjesto i datum
Split, Hrvatska, 07.07.2013. - 10.07.2013
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
MAC modeling; collision memory; backoff freezing; DCF countdown; CSMA/CA; two dimensional Markov chain; saturation throughput
Sažetak
In this paper a new mathematical model, describing the behavior of simplified Constrained Priority Countdown Freezing (CPCF) protocol, is introduced. The CPCF protocol sets constrains on DCF countdown mechanism and thus requires different mathematical model from those found in the literature. For this reason, the two-dimensional Markov chain analytical model is developed in order to accurately quantify the freezing constrains introduced by CPCF protocol. The results of mathematical model are compared to the simulation results, showing that the proposed scheme models the simplified CPCF medium access method with expected accuracy.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika, Računarstvo, Informacijske i komunikacijske znanosti
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike, strojarstva i brodogradnje, Split,
Sveučilište u Splitu
