Title :
Markov chain model of HomePlug CSMA MAC for determining optimal fixed contention window size
Author :
Kriminger, Evan ; Latchman, Haniph
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Florida, Gainesville, FL, USA
Abstract :
This paper analyzes the optimum constant contention window (CW) for the HomePlug 1.0 and AV CSMA/CA MAC. A discrete time, homogenous Markov chain, with the state specified by both the backoff counter (BC) and deferral counter (DC), is used to model a single node contending for transmission. The structure of the Markov chain admits a generalized expression for the stationary state probability mass function (pmf) associated with each state. The recursively defined state pmfs can be analytically reduced to a single expression relating the probability p, of the node finding the medium idle, the maximum window size W, the maximum deferral counter size, and the number of nodes n. Optimizing the MAC efficiency provides a target value for p, which can be attained with the proper selection of W and. It is shown that an optimal contention window size can be chosen based on a linear relationship with the number of nodes.
Keywords :
Markov processes; carrier sense multiple access; collision avoidance; AV CSMA/CA MAC; HomePlug 1.0; HomePlug CSMA MAC; backoff counter; collision avoidance; deferral counter; discrete time; homogenous Markov chain; mass function; optimal fixed contention window size; optimum constant contention window; stationary state probability; Approximation methods; Linearity; Markov processes; Media Access Protocol; Multiaccess communication; Probability; Radiation detectors; CMSA-CA; HomePlug 1.0; HomePlug AV; contention window; medium access control;
Conference_Titel :
Power Line Communications and Its Applications (ISPLC), 2011 IEEE International Symposium on
Conference_Location :
Udine
Print_ISBN :
978-1-4244-7751-7
Electronic_ISBN :
978-1-4244-7749-4
DOI :
10.1109/ISPLC.2011.5764430
