The simulation of p-persistent CSMA algorithm of unequal random multiple access Текст научной статьи по специальности «Компьютерные и информационные науки»

UDC 004.057.4:004.051

Dadenkov S. A.

Ph.D., Associate Professor at the Department of «Automatics and Telemechanics», Perm National Research Polytechnic

University, Perm, Russia

THE SIMULATION OF P-PERSISTENT CSMA ALGORITHM _OF UNEQUAL RANDOM MULTIPLE ACCESS_

Context. The relevance of the simulation of p-persistent CSMA algorithm of unequal random multiple access is caused by importance of 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 p-persistent 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.

Keywords: equal and unequal rivalry, random multiple access, probabilistic and temporal characteristics, industrial network, LonWorks, fieldbus, predictive p-persistent CSMA.

NOMENCLATURE

CSMA - an algorithm of unequal random carrier-sense multiple access;

BL - predicted load on channel (backlog); c, C - nominal and effective carrier capacity of channel in the network;

dk, d^ - an average number of access slots with collision and at successful transmission;

dy - an average number of access slots for a successful

node transfer with /-priority;

D - a probability function of selection by the node with priority r ^ / of the winning node, of slot >5;

E - an average number of access attempts until successful transmission;

I - an function that determines whether a node with priority /, slot s < /;

k - an access number leading to successful transmission; /, L - number of priority access slots of the node and a plurality of slots of network nodes;

/n - information packet length in bits; m, M - number of messages in the node and the set of messages in the network nodes;

n - number of nodes in the network;

pK, pK - probability of unsuccessful transmission (with

collision) in the network, on the slot with the number s;

p , pyl - probability of successful transmission in the network, by one node;

pyl, pyyl - probability of successful node access with

/-priority, on the slot with number s;

/ S'

pyl - conditional probability of winning a node with

priority /, on the slot number s;

s, S - the current number of the access slot of the node and a plurality of network nodes slots;

T - an average time of successful information transfer by one network node;

T - an average time of successful transfer of the information packet by the node with /-priority;

Tm - an average time of successful transmission of m information messages from the node queue;

T - an average duration of successful transmission of the information packet;

W W. - the current and base width of access window

base

(race)

X, Y - sets of parameters and characteristics of observations;

Pl - a minimum inter-packet access interval; P2 - duration of the slot (priority/random); P3 - a time of transmission of one bit information over the network channel;

t - duration of a burst (packet) cycle; tk, Ty - duration of unsuccessful (with collision) and successful burst cycle;

Tq - a time of node delay in race for access to channel.

© Dadenkov S. A., 2018

DOI 10.15588/1607-3274-2018-2-11

INTRODUCTION

The wide prevalence of random multiple access algorithms in industrial fieldbus networks is caused by the potentially high efficiency of transfer channel capacity usage and low time of information delivery in the transmission of sporadic traffic, as compared with deterministic algorithms. A variety of modifications of the probabilistic algorithms of unequal random carrier-sense multiple access CSMA is caused by different efficiency of information transmission depending on: channel occupancy, the number of nodes in the network, regular/sporadic traffic and other parameters. Such access algorithms are widespread: CSMA/CA (CAN, KNX/EIB, DeviceNet networks), 1-CSMA/CD (EtherNet/IP, ModBus/ TCP), predictive p-Persistent CSMA (BacNet, LonWorks). Literature analysis [1-6] shows the high efficiency of p-persistent CSMA access algorithms adapted or self-adapting (predictive) to the changing network channel load. The problem of using this algorithm in an industrial network is caused by several factors. Firstly, the small elaboration of the methods and the low accuracy of the quantitative assessment of the information delivery performance and warranty do not allow develop real-time networks. Secondly, the methods of analyzing the characteristics of networks with unequal participants, which limits the effectiveness of the algorithm in the transfer of technological information of varying importance (priority): controlling, regulation, signaling, measurement, data, are practically not worked out. This significantly reduces the efficiency of the p-persistent CSMA algorithm. The solution of the problems actualizes the study of the issues of upgrading of the known and creating new models of the algorithm and methods for analyzing the characteristics of information transmission in the network.

The object of the research is the algorithm of unequal random multiple access p-Persistent CSMA nodes to the shared transmission medium.

The subject of the study is models and methods for evaluation the probabilistic and temporal characteristics of information transfer in the network with the analyzed algorithm.

The aim of this work was to develop a method for evaluating the characteristics of information transmission in the network with the algorithm p-Persistent CSMA, characterized by a set of parameters {c, n, M, L, W, BL, In, P1, P2, P3} : the probability of successful py and unsuccessful pK access of nodes to the channel, the average time T of successful information transmission, the effective carrier channel capacity C. 1 PROBLEM STATEMENT

Let there are a complete set of observations <X, Y>, where X is a set of observation parameters, Y is a set of characteristics. The set of parameters and characteristics of the observations can be represented as arrays:

f

11

*21

A12

"-22

xq1 xq 2

xQ1 xQ 2

Ha

a

*qa

XQa

x1A x2 A

xqA xQA

Y =

yn y 12

y 21 y22

yq1 yq 2

yQ1 yQ2

y1b y 2b

yqb yQb

y1B y2B

yQB

Since the parameters of {xobservations take discrete values, the evaluation of particular probability characteristics of {yq} can be performed using the probability multiplication theorem. Since the set of observations is finite and formed by a complete group of events, and observations are equally probable, the evaluation of the general probabilistic characteristics pfor the groups of observations can be performed in several ways. The first method is based on the classical definition of probability, according to which the probability of an event is the relation of the number of favorable elementary outcomes to the total number of all possible outcomes. The second method is based on the use of the formula of total probability and Bayes' rule that allow to calculate absolute p and conditional p' probabilities of events. This method is preferable because of the complexity of direct calculation of probabilities in solving problem. In this case, the evaluation of the average values of the observation characteristics can be obtained by superposition of their individual values, given the conditional probabilities of the outcomes:

yb =Z Pq ■yqb .

2 REVIEW OF THE LITERATURE

The analysis of networks with different algorithms of random multiple access in the literature is execute mainly with the use of classical Queuing systems with repeated calls (as a result of loss or lack of response). Such works include publications of famous Russian authors: A. A. Nazarov [7, 8], I. I. Khomyakov [9], S. N. Stepanov [10]. Because of the specificity of access algorithms, the results of the work are mainly applicable to the analysis of networks with 1-persistent CSMA/CD access algorithm used in Industrial Networks Industrial Ethernet, ModbusTCP, EtherNet / IP, HSE, ProfiNet, Interbus-TCP / IP, etc. Taking into account the functioning peculiarities of the studied protocols p-persistent CSMA with and without loading is performed in the works of the authors Moshe Kam [1], M. Miskowicz [2, 3], P. Buchholz and J. Plonnigs [4], S. A. Dadenkov's [5]. The analysis is performed using the apparatus of probability theory and discrete Markov chains.

The research of p-persistent protocols of the CSMA family in [1-3] was performed in the mode of channel saturation with information transmission by a constant number of network nodes. The models and methods of analysis constructed as a result of researches allow to execute an assessment of the top level of information transmission delay in the network. The models take into

account the set of algorithm parameters [6]. To obtain more accurate estimates of probabilistic and temporal characteristics of the network with sporadic nature of the information load in the works [4, 5], were suggested the models considering the dynamics of changes not only in the Protocol parameter of the width of the access algorithm window, which is characteristic of the works [1-3], but also the number of messages and nodes-rivals for the communication channel. From the literature [6] there is well known the possibility of using the priorities of access nodes for the information transmission of different importance. The small elaboration of this issue and the absence of models and methods for assessing the characteristics of networks with unequal access of nodes limit the possibility of applying the procedure in practice. This actualizes the solution of the tasks set in the work.

3 MATERIALS AND METHODS

The algorithm of random multiple access p-persistent CSMA is characterized by pseudo-constant level of persistence p nodes of network, determined by the ability to start transfer to one of the temporary access slots. The predictive p-persistent CSMA Protocol is characterized by a variable persistence level, changing according to the load predicted for the communication channel. Regulation of probability p of beginning of transfer by a node in a wide range [0.0625..0.000976] allows to reduce probability of collision at increase of loading on the network channel and to reduce time of access at decrease in loading of the channel. Load prediction is carried out by distributed evaluation by the nodes, where "response" network traffic expected to transfer according to the data of the field delta_backlog package.

Access nodes to the channel according to the algorithm p-persistent CSMA is performed in burst (packet) cycles. Cycles are divided into free and busy packets. A busy packet cycle represents the channel access time and packet transfer time (fig. 1).

The algorithm of access to the channel includes the following steps (Fig. 1) [6]:

1. Testing channel activity. The node monitors the state of the channel and moves to the next step when there is no activity in the channel.

2. Minimum inter-packet access interval. The node waits for the time inter-packet interval b1 to determine that the channel is free.

3. Priority access interval. The node waits for a fixed number of priority time slots l, which each duration is P 2. A lower number of access slots correspond to the highest priority. Priorities for access are used only after employing burst cycles [6].

Busy burst cycle

4. Random access interval. The node waits for a delay T, that is equal to a random number s of time slots of P 2 duration. The number of slots is choosing according to the uniform distribution of the range [0...W - 1], where the time slot length W=W • BL, W - the base access slot length (16), BL

base ' base c v ^

(backlog) - the load predicted on channel [1..64]. The access slot length determines the adaptive (for predictive) probability level of node beginning transfer p=1/W.

5. Testing channel activity and transmission package. The node starts transmission if the channel is free and suspends it on the next packet cycle otherwise. Packet transmission delay is to product of the packet length In in bits and the transfer time of one information bit P3, inversely proportional to the carrier capacity of channel. When several nodes choose an equal number of temporary (priority and random) slots, the transfer results in a collision that damages the packets. The packets involved in the collision, depending on the service transmission will be lost or require retransmission. The algorithm with prediction at collision increases the load level, and in a successful and free cycle decreases by 1 [6].

Let us analyze the communication rivalry of nodes according to the algorithm of multiple access p-persistent CSMA in saturation mode, but taking into account the priorities of nodes not previously analyzed in the known works. Saturation mode is characterized at every moment by competition for the channel of n nodes, each of which has an individual number of priority slots l and contains m>1 messages for transfer.

T = t0 + E • t,

(1)

where E - is the average number of access attempts for a successful transmission; t - is the average duration of the burst (packet) cycle, regardless of the type (successful/ unsuccessful); delay T0 = 0 for saturation mode, while the stochastic transfer t0 < t - p 1. The number of access attempts E is unique for each node and depends on the number of priority access slots lt of nodes-rivals per channel.

The probability of successful transmission can be determined by the sum of the probability of winning of n nodes with different priorities l belonging to the set L:

P y = Z = Z nl • Py^

i=1 WleL

(2)

where p^ is the probability of successful access and transmission by one node with l-priority.

Free burst cycle

Pi

Packet

l1!2!3!"! '

Time of random access

m h

.............

Packet

Width of contention window

I2'3...............

Priority slots

-Y-

Random slots

Pl

-Y-

Random slots

Figure 1 - The structure of burst cycles

In a channel with no or equal priority of nodes, the probability of successful transmission does not depend on the priority and is determined only by the number of nodes-rivals:

py = n • p^1. (3)

The probability of an unsuccessful (collision) in saturation mode of the network channel:

pK = 1 - py • (4)

The probability of successful transmission of the node ply1 with an /-priority passing on an access attempt (in a burst cycle) with a number k is determined by the product of event probabilities:

- the node hadn't been winning the rivalry before attempt with the number k;

- the node won the rivalry on the access attempt k:

p/y1(k ) = (1 - p/yl))k-1 •

(5)

In that case the average number of transmission attempts by the node E with the /-priority:

^ ^ i \k—1 E/ = Z k • p^(k) k •(i - p/y1) • ply1. k=1 k=1

(6)

Multiplying both sides of the expression (6) by the value, we obtain:

(1 - py1) • E k • (1 - pl1)k • p^. (7)

k=1

The expression difference (6) and (7) determine the average number of attempts of node access with an /-priority:

E/ =

1 + (1 - ply1) + (1 - ply1)2 + ...

(8)

The expression (8) contains an infinite geometric series, so:

(9)

El = (p^)"1.

The average number of attempts before a successful transmission by nodes without regard to the priority level of a node can be defined as the arithmetic mean:

E =

1 • £

n VleL py1

(10)

The average number of attempts before a successful transmission by nodes without regard to the priority level of a node can be defined as the arithmetic mean:

E =

py1

-1

(11)

To assess the probability of successful access of the node with an /-priority in the burst cycle with the time slot length W, let us analyze rivalry of n nodes with different priorities in the field of access with the number of time-slots equal to the sum of the number of priority / and random d slots (for example, the slot width W = Wbase = 16) (fig. 2).

The duration of the rivalry between the nodes for access to the channel is limited by the number of time slots W free burst cycle, regardless of the priorities of the nodes. This limits the number of random slots that can be used to organize successful transmission of information by nodes: {/+1 ... W-/min}, where / is the number of priority slots of the node, l is the minimum number of priority slots of the

' min l J

node of analyzed network. Thus, the width of the random access range does not change and remains equal to W—/min (for convenience in work W). In the access field of nodes with the number of priority slots greater than 0, access slots appear, the use of which cannot lead to a successful transmission. These slots are the initial slots s < l and the final access slots s > W-l . (fig. 2, /=4, / . =0). This should

min v c ' ' min 7

be taken into account when calculating the probabilities of successful access of nodes with different priorities. Further analysis of the mechanism of slot access is advisable to perform for slots, the number of which starts with 1. Therefore, if the value of / . exceeds 0, the shift "to the left"

min

is necessary and renumbering of priorities of all nodes to the value of l according to the rule l = (l - l + 1), l -

min c v old min 7' old

the old number of access slots of the node. The value of the / . shift must then be taken into account as a constant

min

component of the number of network channel access slots. The probability of a node's successful access to a

l s

channel is the sum of the probability p y1 of winning a rivalry on each slot s from the width of the access window [1...W]:

W

ply1 = 1 pji

s=1

(12)

The probability py1 selecting by the node a slot number

s, provided that the node wins on this slot, is determined by the joint execution of the next conditions:

- the winning node has a choice of slot number s>/;

- the winning node with priority l selects one slot from W;

- other nodes with priority l select one of the (W - s) of later slots;

- other nodes with priorities other than l select one of the later slots:

pli = ' <s >l) • W (

W - s W

n/-1

n D(s >r^ (13)

Vre( L\{l})

Priority #0

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

c

Priority #0 & 4

o C 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

c l = 4

Figure 2 - Fields of equal and unequal rivalry of nodes for access to the channel

where the indicator function I (s > l) considers the inability of choice by node with priority l of a slot with absolute number s < l (fig. 2), probability function D (s > r) of selecting by nodes with priorities r, different from l winning node, of slot with number > s:

I () =

1, condition is satisfied (•), 0, condition (x) is not satisfied;

D(-) =

W - 5 + r

W

conditionis satisfied (•),

(14)

1, condition ()is not satisfied.

The expression (3) to assess the probability of successful transmission in the channel takes the form:

Py = Z

VleL

W

nl ■ Z

5=1

I ( 5 > l ) •

1 ( W - 5

W

W

nl-1

n D(5 > r)

Vre(L\{l})

(15)

Particular type of the expression of the probability of a successful transmission regardless of the type of priority:

Py =

W

W

•Z

5=1

W - 5

W

n-1

(16)

The average number of burst cycles (9) before a successful transmission by node with l-priority, considering (12):

El =

I (5 > l ) • -1 •i W Y'-1 W I W J

n D(5 > r)

Vre(L\{l})

(17)

The expression (17), without regard to the priorities of the nodes-rivals:

E =

n z w • Z1

W - 5

W

n-1

-1

(18)

The average length of the packet cycle in (1) at the width of the access window W is the sum of the lengths of the successful and failed packet cycles, taking into account their probabilities:

t = pk • tK + py • Ty, (19)

where Ty, tk - average length of successful and unsuccessful packet cycles,

Ty = p1 + [lmin + dy -1] • p2 + Tn,

TK = p1 + [lmin + dK -1] • p2 + tn • (20)

where lmin is the minimum number of priority access slots of a network node, dy is the average number of slots in which a node wins a rivalry; dK is the average number of slots at the collision; tn is the packet transmission duration

Tn = ln-p3-

The average number of slots d^, selected by the winning node with an l-priority in a successful packet cycle can be

estimated as the sum of the probabilities of selecting each slot s, provided that the node wins the rivalry on that slot:

W

dy =

l ,sr

= Z 5 • Py1

5=1

(21)

l ,sr .

where pyj is the conditional probability of winning a node with priority l on slot s:

i ,5' = jPyL

Py1 = Pl

Py1

(22)

Then the average number of slots on successful access:

= Z

nl

n± J

VleL n W

1 ST "L jl ST "L sr 15

dy = Z--dy = Z--Z 5 • Py1 =

■ ' n VleL n s=1

W

W

nT ■ s • pys =T-j • :E(s -1) • py, .(23)

VleL n • py1 s=1 VleL n s=1

Without regard to the priorities of nodes in the expression (23) takes the form:

W

dy =£ (s - !)• pys =

W

= Z

5=1

5=1

1 ( W _ 5 y-1 ^

(5-1)-/(5>l)-w{—) • n D(5>r)

W ^ W J Vre(L\{l})

(24)

The average number of slots in an unsuccessful access is determined similarly (21):

W

dK =Z s^PK ,

5=1

(25)

where ps is the conditional probability of collision at the width of the window W on the slot with the number s:

pK'= Pk ,

(26)

where pK is the absolute probability of collision at the

width of the window W on the slot with the number s.

The collision on slot s with the width of the access window W occurs under joint conditions:

- i > 2 nodes choose equal number of access slots, with

1

probability: ;

- the other n-i nodes select the larger s slot from the

n-iW - s +1

remaining ones, with the probability n- , where l

W

is the individual priority got into collision;

- number of all possible combinations C'n of i nodes

n!

got into collision of n nodes-rivals: Cn =

(n - i) ! • i !

K

- the possibility of participating in collision of different numbers of i=[2..n] nodes-rivals for the network channel.

Thus, an expression to evaluate the probability of a collision on a slot with a number s:

The average length of successful transmission through the communication channel, taking into account possible collision, is determined by (32), but taking into account the full probability of successful access:

pK

-tc • -v -n^.

W W

i-2

(27)

The application of the proposed expression (27) in practice is complicated by the realization of the procedure of search of various combinations of /-nodes in collision and (n-i) nodes not in collision with different levels of priorities l. Therefore, an expression can be used to evaluate this value, regardless of the priorities of the rivalry-nodes:

pK

n

-t cn

„i _ (W - sf

"n n

i-2 Wn

(28)

The expression (28) allows to obtain the upper estimation of probability of collision on slot s for the scenario of rivalry of n nodes with different levels of priorities. To define more precisely the value of the probability of collision should be taken into account for each slot s access the maximum number n of rivalry-nodes.

The expression (19) for estimating the duration of a burst cycle takes the form:

t = p1 + [dK • pK + dy • py + lmin -• p2 + Tn. (29) Average time of successful transmission of one information packet by a node with l-priority, taking into account delay of messages transmission of other n-1 nodes:

Tl - to + El • t - to +

Ply1

(30)

Average time of successful transmission of a message in a channel, regardless of the priority of the node:

T - To +

- • t —-

n VleL Py1

(31)

For the channel network, regardless of or equal to the priorities of the nodes, the expression (31):

T - to + — - to + t • W •

W

t

s-1

W - s W

n-1

-1

(32)

The average transmission time of any node message with queue m > 1:

T -

1 m

t i • T

i-1

(33)

T --

(34)

The effective network capacity, which shows the number of packets successfully transmitted per unit of time, inversely proportional to the duration of transmission:

c - Tn

(35)

The performed analysis allowed us to obtain analytical expressions for estimating the main probabilistic and temporal characteristics of information transmission in the network channel with the algorithm of unequal random multiple access p-Persistent CSMA in the conditions of unequal rivalry between n nodes with individual l-priorities, and the width of the access window.

Packet transmission over the network with the predictive p-persistent CSMA access algorithm is accompanied by a dynamic change in the width of contention window W, and hence the transmission characteristics. Analytical models of dynamic change of window width and methods of estimation of characteristics of information transmission in saturation mode are offered in works [1-3]. The work [5] proposes a multidimensional discrete Markov chain describing the sporadic process of formation and transmission of information messages by nodes, considering the change not only in the width of the access window, but also the number of rival nodes per channel and messages for transmission. The use of the proposed expressions for assessing the characteristics of unequal rivalry in these models will improve the accuracy of calculations. The ongoing study of access priorities at the constant width of the contention window W is aimed at evaluating the effectiveness of the mechanism of unequal access of the algorithm p-persistent CSMA.

4 EXPERIMENTS

Study of the effectiveness of the unequal access of the algorithm p-persistent CSMA is performed in the saturation mode of the network channel. The estimation and comparative analysis of probabilities of successful and unsuccessful access of nodes to the channel, time of information transmission at equal and unequal rivalry in a network with different number of nodes are carried out. The initial data of the experiments and evaluate the characteristics shown in table 1.

m

Table 1 - Initial data and estimated characteristics

t

y

№ Experiment Number of node n Window width W Characteristics

1 n=3 n0=3

n0=1 n2=1 n4=1 16 l ,s l ,sr l l s rri Py1 , Py1 , Py 1, Py, Pk , Pk , Tn

2 n=9 n0=9

n0=3 n2=3 n4=3

5 RESULTS

The results of evaluation of probabilistic characteristics

of access p^f , p^j5', p 1, p 1y , pK , Pk for experiment 1

are shown in figure 3, and for experiment 2 in figure 4 and 5. The graphs illustrate the dependences of the probabilities of successful and unsuccessful node access to the channel with equal and unequal access from the time slot number s

of the rivalry window W. The legends of the graphs contain quantitative values of the probability of access to the channel by one and all nodes with a certain priority, the probability of collision. The analysis of the results will assess the potential efficiency of using access algorithm priorities to reduce the probability of collision, as well as reducing the probability of successful transmission for nodes with low priorities.

a b

Figure 3 - Graphs of the probabilities of successful and unsuccessful access (experiment 1): a - equitable rivalry; b - unequal rivalry

pTl°= 18.64% pyc = 55.92% pvl2 = 7.14% p/ = 21.43% pyl4 = 1.86% p/ = 5.58% pK = 17.07%

1 : 3 - 5 s 7 a 9 10 11 12 13 14 is is Number of access slot b

Figure 4 - Graphs of the probabilities of successful and unsuccessful access (experiment 2): a - equitable rivalry; b - unequal rivalry

a b

Figure 5 - Graphs of conditional probability of winning in the rivalry on access slots

a

The results of estimating the average time of successful Tn transmission in a network channel with equal and unequal nodes (experiment 1 and 2) are given in table 2. The analysis of taken results will allow to estimate the potential increase of the effective capacity C from the channel by reducing the probability of collision between the pK and unequal access.

Table 2 - Average transmission time (ms) in a channel with equal and unequal nodes

n Rivalry W=16 W=32 W=48 W=64 W=80 W=96

3 Equal 2,95 3,52 4,15 4,81 5,47 6,14

Unequal 3,21 3,82 4,47 5,13 5,80 6,47

9 Equal 3,08 2,94 3,10 3,31 3,55 3,80

Unequal 3,03 3,16 3,37 3,61 3,85 4,11

6 DISCUSSION

A comparative analysis of probabilities of successful and unsuccessful information transmission at equal and unequal rivalry between the node slots of the window (fig. 3, fig. 4) illustrates a reduction in the probability of a collision pK in a channel using access priorities. For experiment 1, the relative decrease in the probability of collision was «16% (from 9.18% to 7.66%, fig. 3), but with the increase in the number of nodes (experiment 2, fig. 4) reached « 33% (from 25.79% to 17.07%). Reducing of collision probability in unequal rivalry achieved by the redistribution of probability of access in a time slots of rivalry window. Separation of access of rival nodes on initial (1-4) slots, which account for the greatest probability of collision (fig. 3a, fig. 4a), contributes to the organization of successful transmission nodes with high priority (fig. 3b, fig. 4b, fig. 5). The displacement of the rivalry nodes from the initial slots leads to the appearance of probability peaks of collision on slots s = 3, 5 with an increasing number of nodes-rivals on the channel (fig. 3b, fig. 4b). The tendency to decrease the probability of a collision with an increasing number of the access slot is maintained due to reducing the probability of a collision of packets on later slots.

Predictable feature of unequal rivalry is essential difference of probabilities of successful nodes access to the channel, hence time of information transmission. Analysis of graphical dependencies (fig. 3b, fig. 4b) illustrates a small difference in the probability of successful access of nodes with different priorities on the slots of the contention window W. However, the analysis of the absolute

values of the access probabilities ply1 of /-priority nodes shows the opposite. In the first and second experiments, the probability ratios for nodes with extreme priorities (0 and 4) are 3 (48.19:15.57) and 10 (18.64:1.86), respectively, against 1 for equal competition. So that, the access time for successful transmission of low-priority nodes is also 3 and 10 times different from high-priority nodes. The difference

in the probability of successful access p^' of nodes with different priorities for slots is clearly illustrated in figure 5. A significant difference in access probabilities was found on the initial and final slots. However, the degree of significance of the final slots of the access is low due to the smallness of the absolute value of the successful transmission probability (<1%) (fig. 3b, fig. 4b). On the middle slots of the

contention window (fig. 5) there is a low differentiation of access probabilities of nodes with different priorities. As the width of the rivalry window W increases, access probabilities "blur" (fig. 5), which reduces the differences between high- and low-priority nodes and without priority nodes. There is also an abrupt reduction in the difference between unsuccessful equal and unequal access. The ratio of probabilities of successful access of high- and low-priority nodes decreases rapidly to 2 and below. The obtained result at W=16 is due to the high ratio of the number of priority access slots l=4 and the window width.

The disadvantage of reducing the probability of collision with a small width of the window W, besides to differentiating the probability of access of unequal nodes, is the increase the number of temporary access slots for successful transmission of information compared to equal rivalry. For example, for experiment 2 (W=16), the number of successful/ unsuccessful access slots, with equal and unequal rivalry is 2.09/2.30 and 3.28/4.46, accordingly. The increase in the number of slots leads to an increase in the delay of access and information transmission. However, the increase in the number of slots of unequal access is accompanied by a decrease in the probability of collision. The results of the assessment of the opposite influence of given characteristics of unequal access on the time of information transmission Tn are compared with the indicators characteristic of equal access in table 2 at different widths of the contention window W. The analysis of the obtained results evidences the privileged influence on the transmission time of the number of access slots. The achieved reduction in transmission time by reducing the probability of a collision does not exceed the increase time access due to the increased number of time slots. A minor exception is observed only in the second experiment at W=16. Thus, the transmission time of the information packet on the network channel is less for equal access. This ensures more efficient use of the bandwidth of the channel with the transmission of a large amount of useful information per unit of time. All the conclusions obtained in the work are also valid for the rivalry of nodes with a minimum number of priority slots other than 0. Comparing the unequal rivalry of nodes with the same rivalry, but with the priorities of nodes shifted by l, illustrates the equality of the absolute probabilistic characteristics of access, but a significant increase in the number of access slots, which increases the delay in the information transmission.

The analysis of the experimental results illustrates the expedience of using access priorities of the p-persistent CSMA algorithm to organize cycles of important information transmission against the background of the transfer of generally significant low-priority data. In this case, a reduction in the probability of collision is achieved and the time of information transmission is less than with equal rivalry. Unequal rivalry can't be used to increase the effective use of the bandwidth of the channel, due to the increase in the number of slots and, accordingly, the access time.

CONCLUSIONS

The article analyzes the algorithm of access to the transmission medium p-persistent CSMA. The review of publications and literature sources revealed the relevance

and insufficient elaboration of the problem of quantitative estimation of probabilistic and temporal characteristics of information transmission in networks with unequal access on the basis of the analyzed algorithm. As a result of the analysis, analytical expressions are obtained for assessing the probability of successful/unsuccessful access and the time of information transmission considering the diverse priorities of nodes. Experiments are performed and the comparative analysis of equal and unequal rivalry of knots for the network channel is executed. The conclusions about the importance of taking into account the priorities in the network with the method of access are drawn. The expediency of using access priorities for organization of cycles of important information transmission against the background of general-purpose low-priority data transfer is noted. Obtaining adequate quantitative estimates and conclusions of the use of priorities in the sporadic nature of the information load requires additional research, for example, using the model [5]. The practical significance of the obtained results lies in the possibility of quantitative assessment and design of network channels with unequal random multiple access type p-persistent CSMA with specified probabilistic and temporal characteristics of information transmission. ACKNOWLEDGEMENTS

The work is executed at financial support of the Ministry of education and science of the Russian Federation (RFMEFI58317X0062) in the boundaries of the BRICS project "Hybrid process of manufacturing parts for the aerospace industry: modelling, software development and verification". The author thanks the scientific advisor professor Kon E. L. For the help and useful discussion of the work.

REFERENCES

1. Moshe Kam. Collision Resolution Simulation for Distributed Control

Architectures using LonWorks / Moshe Kam // IEEE International

Conference on Automation Science and Engineering. - Edmonton, Canada : IEEE, 2005. - P. 319-326. DOI: 10.1109/ COASE.2005.1506789

2. Mi skowicz M. Analysis of Mean Access Delay in Variable-Window CSMA / M. Mi skowicz // Sensors. Schweiz: Molecular Diversity Preservation International, 2007. - Vol. 7. - P. 3535-3559.

3. Mis kowicz M. Access delay in LonTalk MAC protocol / M. Mi skowicz // Computer Standards and Interfaces. Nederland: Elsevier Science Publishing Company, 2009. - P. 548-556. DOI: 10.1016/J.CSI.2008.03.025

4. Buchholz P. Analytical analysis of access-schemes of the CSMA type / P. Buchholz, J. Plonnigs // Proc. of IEEE International Workshop on Factory Communication Systems WFCS'2004, Wien, 2004. - P. 127-136.

5. Даденков С. А. Подход к построению аналитической модели информационно-управляющей сети LonWorks на основе ней-рочипов / С. А. Даденков, Е. Л. Кон // Нейрокомпьютеры: разработка, применение. - 2013. - № 11. - С. 64-69.

6. Дитрих Д. LON-технология, построение распределенных приложений / Д. Дитрих, Д. Лой, Г. Ю. Швайнцер // Пер. с нем. под ред. О. Б. Низамутдинова. - Пермь : Звезда, 1999 - 242 с.

7. Назаров А. А. Исследование сети связи, управляемой адаптивным протоколом случайного множественного доступа, в условиях критической загрузки / А. А. Назаров, Д. Ю. Кузнецов // Проблемы передачи информации. - 2004. - № 3. -С. 69-80.

8. Назаров А. А. Общий подход к исследованию марковских моделей сетей передачи данных, управляемых статическими протоколами случайного множественного доступа / А. А. Назаров, С. А. Цой // Автоматика и вычислительная техника. - 2004. - № 4. - С. 73-85.

9. Хомичков И. И. Исследование моделей локальной сети с протоколом случайного множественного доступа / И.И. Хомичков // Автоматика и телемеханика.- 1993.-№ 12.-С.89-90.

10. Степанов С. Н. Асимптотический анализ моделей с повторными вызовами в области больших потерь / С.Н. Степанов // Проблемы передачи информации. - 1993. - № 3. - С. 54-75.

Article was submitted 21.12.2017.

After revision 25.01.2018.

Даденков С. А.

Канд. техн. наук, доцент кафедри «Автоматика i телемехашка» Пермського нащонального дослщницького полггехщчного ушвер-ситету, г. Пермь, Роая

МОДЕЛЮВАННЯ АЛГОРИТМУ НЕР1ВНОПРАВНИХ СЛУЧАЙНОГО МНОЖИННОГО ДОСТУПУ P-PERSISTENT CSMA

Актуальтсть моделювання алгоритму нерiвноправного випадкового множинного доступу p-persistent CSMA викликана важли-вютю облжу шдивщуальних прюршепв вузлiв для виконання адекватно! ощнки iмовiрнiсних i тимчасових характеристик передачi шформацп при проектуванн поширених fieldbus-мереж LonWorks, BacNet i ш.

Мета роботи полягае в отриманн аналггичних виразiв для ощнки ймовiрностей усшшного i невдалого доступу вузлiв до каналу, часу передачi шформацп в мережi з рiвноправним i нерiвноправним суперництвом вузлiв на основi алгоритшв випадкового множин-ного доступу p-persistent i predictive p-persistent CSMA.

Метод. Для розв'язання задачi використано апарат теорп ймовiрностей. Виконано аналiз множинного рiвноправного i нерiвноп-равного доступу p-persistent CSMA вузлiв в режимi насичення каналу передачею шформацп постшним числом вузлiв-суперникiв. Запропоновано споаб ощнки часу усшшно! передачi шформацп вузлом через середня кшькють ци^в суперництва i iмовiрнiсних характеристик доступу вузлiв. Отриман вирази для ощнки необхщних iмовiрнiсних i тимчасових характеристик: середньо! тривалосп передачi i часу передачi шформацп вузлом, ефективно! пропускно! здатносп каналу. Запропонований споаб переважно вiдрiзняеться вщ аналопв можливютю ощнки характеристик передачi шформацп з урахуванням рiзнорiдних прюртепв вузлiв мереж^ що шдвищуе точнють виконуваних розрахунгав.

Результати. Отримано аналггичщ вирази i виконана кшькюна ощнка i аналiз iмовiрнiсних i тимчасових характеристик передачi шформацп в мережi з рiвноправним i нерiвноправним випадковим множинним доступом p-persistent CSMA.

Висновки. Результати моделювання рiвноправного i нерiвноправного суперництва в мережевому каналi шюструють важливють врахування шдивщуальних прюршепв вузлiв в мережi. Доцiльнiсть використання прюршепв доступу полягае в необхщносп передачi важливо! шформацп на rai загальнозначущих фонових даних. Значимiсть результапв полягае у виконаннi адекватно! кшькюно! оцiнки характеристик передачi iнформацi! в каналi з рiвноправними i нерiвноправними учасниками.

Ключовi слова: piBHonpaBHe i HepiBHonpaBHe суперництво, випадковий множинний доступ, iMOBipHiCHi i тимчасовi характеристики, промислова мережа, LonWorks, fieldbus, predictive p-persistent CSMA.

Даденков С. А.

Канд. техн. наук, доцент кафедры «Автоматика и телемеханика» Пермского национального исследовательского политехнического университета, г. Пермь, Россия

МОДЕЛИРОВАНИЕ АЛГОРИТМА НЕРАВНОПРАВНОГО СЛУЧАЙНОГО МНОЖЕСТВЕННОГО ДОСТУПА P-PERSISTENT CSMA

Актуальность моделирования алгоритма неравноправного случайного множественного доступа p-persistent CSMA вызвана важностью учета индивидуальных приоритетов узлов для выполнения адекватной оценки вероятностных и временных характеристик передачи информации при проектировании распространенных fieldbus-сетей LonWorks, BacNet и др.

Цель работы состоит в получении аналитических выражений для оценки вероятностей успешного и неудачного доступа узлов к каналу, времени передачи информации в сети с равноправным и неравноправным соперничеством узлов на основе алгоритмов случайного множественного доступа p-persistent и predictive p-persistent CSMA.

Метод. Для решения задачи использован аппарат теории вероятностей. Выполнен анализ множественного равноправного и неравноправного доступа p-persistent CSMA узлов в режиме насыщения канала передачей информации постоянным числом узлов-соперников. Предложен способ оценки времени успешной передачи информации узлом через среднее количество циклов соперничества и вероятностных характеристик доступа узлов. Получены выражения для оценки необходимых вероятностных и временных характеристик: средней продолжительности передачи и времени передачи информации узлом, эффективной пропускной способности канала. Предложенный способ преимущественно отличается от аналогов возможностью оценки характеристик передачи информации с учетом разнородных приоритетов узлов сети, что повышает точность выполняемых расчетов.

Результаты. Получены аналитические выражения и выполнена количественная оценка и анализ вероятностных и временных характеристик передачи информации в сети с равноправным и неравноправным случайным множественным доступом p-persistent CSMA.

Выводы. Результаты моделирования равноправного и неравноправного соперничества в сетевом канале иллюстрируют важность учета индивидуальных приоритетов узлов в сети. Целесообразность использования приоритетов доступа заключается в необходимости передачи важной информации на фоне общезначимых низкоприоритетных данных. Значимость результатов заключается в выполнении адекватной количественной оценки характеристик передачи информации в канале с равноправными и неравноправными участниками.

Ключевые слова: равноправное и неравноправное соперничество, случайный множественный доступ, вероятностные и временные характеристики, промышленная сеть, LonWorks, fieldbus, predictive p-persistent CSMA.

REFERENCES

1. 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

2. Mi skowicz M. Analysis of Mean Access Delay in Variable-Window CSMA, Sensors. Schweiz: Molecular Diversity Preservation International, 2007, Vol. 7, pp. 3535-3559.

3. Miskowicz 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

4. Buchholz P., Plonnigs J. Analytical analysis of access-schemes of the CSMAtype, Proc. of IEEE International Workshop on Factory Communication Systems WFCS'2004, Wien, 2004, pp. 127-136.

5. Dadenkov S. A., Kon E. L. Podxod k postroeniyu analiticheskoj modeli informacionno-upravlyayushhej seti LonWorks na osnove

nejrochipov, Nejrokompyutery. razrabotka, primenenie, 2013, No. 11, pp. 64-69.

6. 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.

7. Nazarov A. A., Kuznecov D. Ju. Issledovanie seti svjazi, upravljaemoj adaptivnym protokolom sluchajnogo mnozhestvennogo dostupa, v uslovijah kriticheskoj zagruzki, Prob/emy peredachi informacii, 2004, No. 3, pp. 69-80.

8. Nazarov A. A., Coj S. A. Obshhij podhod k issledovaniju markovskih modelej setej peredachi dannyh, upravljaemyh staticheskimi protokolami sluchajnogo mnozhestvennogo dostupa, Avtomatika i vychis/ite/'naja tehnika, 2004, No. 4, pp. 73-85.

9. Homichkov, I.I. Issledovanie modelej lokal'noj seti s protokolom sluchajnogo mnozhestvennogo dostupa, Avtomatika i te/emehanika, 1993, No. 12, pp. 89-90.

10. Stepanov, S.N. Asimptoticheskij analiz modelej s povtornymi vyzovami v oblasti bol'shih poter', Prob/emy peredachi informacii, 1993, No. 3, pp. 54-75.