Mathematical model of Constrained Priority Countdown Freezing Protocol

被引:0
作者
Kristic, Ante [1 ]
Ozegovic, Julije [1 ]
Kedzo, Ivan [2 ]
机构
[1] Univ Split, Fac Elect Engn Mech Engn & Naval Architecture, Split, Croatia
[2] Univ Split, Univ Dept Profess Studies, Split, Croatia
来源
2014 22nd International Conference on Software, Telecommunications and Computer Networks (SoftCOM) | 2014年
关键词
MAC modeling; collision memory; backoff freezing; CSMA/CA; Markov chain; saturation throughput; DISTRIBUTED COORDINATION FUNCTION; THROUGHPUT ANALYSIS; IEEE-802.11;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:5
相关论文
共 14 条