Markov chain model of HomePlug CSMA MAC for determining optimal fixed contention window size
Evan G. Kriminger, Haniph A. Latchman · 2011
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.