Mathematical model of constrained priority countdown freezing protocol

Author

Kristic, Ante ; Ozegovic, Julije ; Kedzo, Ivan

Author_Institution

Fac. of Electr. Eng., Mech. Eng. & Naval Archit., Univ. of Split, Split, Croatia

fYear

2014

fDate

17-19 Sept. 2014

Firstpage

293

Lastpage

297

Abstract

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.

Keywords

Markov processes; access protocols; exponential distribution; wireless LAN; BEB algorithm; CPCF medium access method; CPCF protocol mathematical model; IEEE 802.11 network; binary exponential backoff algorithm; busy TS; busy timeslot; constrained priority countdown freezing protocol; contention loss probability; four-dimensional Markov chain; single CPCF station; Analytical models; IEEE 802.11 Standards; Markov processes; Mathematical model; Protocols; Radiation detectors; Throughput; CSMA/CA; MAC modeling; Markov chain; backoff freezing; collision memory; saturation throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Software, Telecommunications and Computer Networks (SoftCOM), 2014 22nd International Conference on

Conference_Location

Split

Type

conf

DOI

10.1109/SOFTCOM.2014.7039104

Filename

7039104