Abstract
This paper is focused on the analysis of unfairness of random media access in Local Operating Networks (LON), which is one of the commercial platforms of the Industrial Internet of Things (IIoT). The unfairness in accessing the LON channel is introduced by a collision avoidance mechanism in the predictive p-persistent CSMA protocol adopted at the media access control layer. The study on the bandwidth share in predictive p-persistent CSMA calls for the analysis of multiple memoryless backoff. In this paper, it is shown that the channel access in LON systems is unfair in the short term for medium traffic load conditions, and in the long term for heavy loaded networks. Furthermore, it is explained that the average bandwidth allocated to a particular node is determined implicitly by the load scenario, while an actual node bandwidth fluctuates in time according to stochastic dynamics of the predictive p-persistent CSMA. Next, it is formally proven that the average bandwidth available to a node is a linear function of its backoff state and does not depend on backoff states of the other stations. Finally, it is demonstrated that possibly unfair bandwidth share in LON networks determined implicitly by load scenario is stable because, with lowering a fraction of actual network bandwidth accessible by a given station, the probability to decrease it in the future also drops.
Highlights
Fairness is a concept generally attributed to allocation of limited resources among a set of agents or individuals [1]
The present study addresses a problem of the unfairness in accessing the channel introduced by a random access scheme adopted in Local Operating Networks (LON), one of communication platforms that belong to Industrial Internet of Things (IIoT)
It is explained that the average bandwidth allocated to a particular node is determined implicitly by the load scenario, while an actual node bandwidth fluctuates in time according to stochastic dynamics of the predictive p-persistent Carrier Sense Multiple Access (CSMA)
Summary
Fairness is a concept generally attributed to allocation of limited resources among a set of agents or individuals [1]. The importance of fairness issues in resource allocation has been recognized and well studied in a variety of research problems [1,2,3,4], along with applications in network engineering [5,6,7,8,9]. A problem of fair sharing concerns all scarce resources, including link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols [5]. Guaranteeing fairness in accessing the communication channel is a significant issue in distributed computing systems aimed to allocate network resources equitably. A guarantee of fair access concerns the network with medium or heavy traffic load since inequality in sharing the bandwidth is not a problem when the channel is mostly idle, because the bandwidth is not a scarce resource [6,7]
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
