THE SIMULATION OF P-PERSISTENT CSMA ALGORITHM OF UNEQUAL RANDOM MULTIPLE ACCESS
DOI:
https://doi.org/10.15588/1607-3274-2018-2-11Keywords:
equal and unequal rivalry, random multiple access, probabilistic and temporal characteristics, industrial network, LonWorks, fieldbus, predictive p-persistent CSMA.Abstract
Context. The relevance of the simulation of p-persistent CSMA algorithm of unequal random multiple access is caused by importanceof accounting personal node priorities for execution of adequate assessment of probable and time response characteristics of information transfer in designing widespread fieldbus-networks LonWorks, BacNet, etc. The aim of this work is to obtain analytical expressions for estimating probabilities of successful and failed node access to the channel, the transmission time information in the network with equal and unequal rivalry of nodes based on p-persistent and predictive p-persistent CSMA algorithms of random multiple access.
Method. The method of probability theory has been used there to solve problems. The analysis of equal and unequal multiple access ppersistent CSMA nodes in the saturation mode of the channel by the transmission with a constant number of node-rivals has been executed. A method of estimating the time of successful transmission of information by the node through an average number of cycles of rivalry and probabilistic characteristics of the access nodes has been proposed. Expressions to estimate the necessary probabilistic and time characteristics were obtained: the average length of transmission and time of information transmission by the node, the effective bandwidth. The proposed method mainly differs from analogs by the possibility of characteristics estimation of information transmission given the manifold priorities of the network nodes, which improves the accuracy of the performed calculations.
Results. The analytical expressions have been received, quantification and analysis of probabilistic and temporal characteristics of
information transfer in a network with equal and unequal random multiple p-persistent CSMA access has been performed.
Conclusions. The simulation results of equal and unequal rivalry network channel illustrate the importance of taking into account
individual priorities of the nodes in the network. The feasibility of using access priorities is the need to transfer important information on
the background of universal low-priority data. The significance of the results is to perform an adequate quantitative assessment of the
characteristics of information transmission in a channel with equal and unequal parties.
References
Moshe Kam. Collision Resolution Simulation for Distributed
Control Architectures using LonWorks, IEEE International
Conference on Automation Science and Engineering. Edmonton,
Canada: IEEE, 2005, pp. 319–326. DOI: 10.1109/
COASE.2005.1506789
Mi kowicz M. Analysis of Mean Access Delay in Variable-Window
CSMA, Sensors. Schweiz: Molecular Diversity Preservation
International, 2007, Vol. 7, pp. 3535–3559.
Mi kowicz M. Access delay in LonTalk MAC protocol, Computer
Standards & Interfaces. Nederland: Elsevier Science Publishing
Company, 2009, pp. 548–556. DOI: 10.1016/J.CSI.2008.03.025
Buchholz P., Plonnigs J. Analytical analysis of access-schemes of
the CSMA type, Proc. of IEEE International Workshop on Factory
Communication Systems WFCS’2004, Wien, 2004, pp. 127–136.
Dadenkov S. A., Kon E. L. Podxod k postroeniyu analiticheskoj
modeli informacionno-upravlyayushhej seti LonWorks na osnove
nejrochipov, Nejrokomp’yutery: razrabotka, primenenie, 2013,
No. 11, pp. 64–69.
Ditrix D. Loj D., Yu G. Shvajncer LON-texnologiya, postroenie
raspredelennyx prilozhenij. Per. s nem. Pod red. O. B.
Nizamutdinova. Perm’, Zvezda, 1999, 242 p.
Nazarov A. A., Kuznecov D. Ju. Issledovanie seti svjazi,
upravljaemoj adaptivnym protokolom sluchajnogo
mnozhestvennogo dostupa, v uslovijah kriticheskoj zagruzki,
Problemy peredachi informacii, 2004, No. 3, pp. 69–80.
Nazarov A. A., Coj S. A. Obshhij podhod k issledovaniju markovskih modelej setej peredachi dannyh, upravljaemyh staticheskimi protokolami sluchajnogo mnozhestvennogo dostupa, Avtomatika i vychislitel’naja tehnika, 2004, No. 4, pp. 73–85.
Homichkov, I.I. Issledovanie modelej lokal’noj seti s protokolom
sluchajnogo mnozhestvennogo dostupa, Avtomatika i
telemehanika, 1993, No. 12, pp. 89–90.
Stepanov, S.N. Asimptoticheskij analiz modelej s povtornymi
vyzovami v oblasti bol’shih poter’, Problemy peredachi
informacii, 1993, No. 3, pp. 54–75.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2018 S. A. Dadenkov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
