The Medium Access Control protocol of Power Line Communication networks (defined in Homeplug and IEEE 1901 standards) has received relatively modest attention from the research community. As a consequence, there is only one analytical model that complies with the standardised MAC procedures and considers unsaturated conditions. We identify two important limitations of the existing analytical model: high computational expense and predicted results just prior to the predicted saturation point do not correspond to long-term network performance. In this work, we present a simplification of the previously defined analytical model of Homeplug MAC able to substantially reduce its complexity and demonstrate that the previous performance results just before predicted saturation correspond to a transitory phase. We determine that the causes of previous misprediction are common analytical assumptions and the potential occurrence of a transitory phase, that we show to be of extremely long duration under certain circumstances. We also provide techniques, both analytical and experimental, to correctly predict long-term behaviour and analyse the effect of specific Homeplug IEEE 1901 features on the magnitude of misprediction errors. Our simplified analysis is then used to model the priority resolution scheme defined in Homeplug IEEE 1901. We show that previous tendencies found in simulations and in an off-the-shelf testbed are correctly captured in our framework. We also show that resorting to the traffic differentiation provided by the different contention parameters alone solves the starvation faced by lower-access category traffic.
Two other analytic models of Homeplug exist in the literature ( @cite_25 and @cite_8 ). However, they model mechanisms that differ from the original standardised Homeplug procedure. In @cite_25 , the value of the contention window is fixed for all backoff stages, while in @cite_8 the backoff stage is incremented every time a new packet is overheard (thus having @math ). These new approaches obviously lead to a simplified analysis, as one of the dimensions of the Markov Chain is removed. However, the flexibility the standard provides by allowing to tune both the @math and @math is not captured by these frameworks.
@cite_25 @cite_8
2110398528 2156576704
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. Powerline communications (PLC) are receiving special attention since they use an already available and ubiquitous infrastructure. The main standard for PLC home networks is HomePlug. This work improves the throughput of HomePlug by modifying the medium access control sub-layer. The key idea is to define a fast collision avoidance mechanism where every station that wants to access the medium increments its contention window after sensing another ongoing transmission. The proposal reduces the number of collisions in the network improving the achievable throughput. We compared our mechanism to the original HomePlug standard through simulation and mathematical analysis. We verified that the improvement is independent from the packet size, the transmission rate and the number of nodes when the network is high loaded