Prediction efficiency in predictive p-CSMA/CD

Authors:
Marek Miśkowicz
Affiliations:
Department of Electronics, AGH University of Science and Technology, Kraków, Poland
Venue:
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Year:
2006

Citing 2
Cited 0

Real-Time Systems: Design Principles for Distributed Embedded Applications

Real-Time Systems: Design Principles for Distributed Embedded Applications
A Simulation Study of the Predictive p-Persistent CSMA Protocol

SS '02 Proceedings of the 35th Annual Simulation Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Predictive p-persistent CSMA protocol is an important MAC solution developed for networked sensor/control applications and used in Local Operating Networks (LonWorks) technology. The protocol uses a built-in network load prediction to support collision avoidance. The paper presents an analytical study of prediction efficiency for a channel with collision detection. The approach based on Markov chains is applied. The procedure of performance analysis includes the definition of transition probabilities of Markov chain for a specified load scenario, calculation of stationary distribution of contention window, and the probabilities of successful/unsuccessful transmission. It is shown that the predictive p-CSMA protocol manages to control the size of a competition window in order to guarantee the sustained probability of a successful transmission. The simulative validation of analytical results is provided.