问题描述
算法1算法CR-Broadcast(A,R,δ,T)@ node v:
-------------------- -------------------------------------------------- ----------
语法:每个传输或监听对应一个通信回合
------------- -------------------------------------------------- -----------------
1:if(v∈A)=然后是μv←∅
2:对于阶段i = 1到T做
3:对于j = 1到δ做
4 :if(v∈A)= true然后
5:概率为2
-BCiδ+ j do
6:transmit(v。 id,μv)
7:否则
8:听
9:否则
10:听
11:如果收到消息(u.id,μ)则μv←μ
12:如果μ6=∅&(v∈R)则(v∈A) ←true
Algorithm 1 Algorithm CR-Broadcast(A, R, δ, T) @ node v:
--------------------------------------------------------------------------------
Syntax: each transmit or listen corresponds to one communication round
--------------------------------------------------------------------------------
1: if (v ∈ A) = f alse then µv ← ∅
2: for phase i = 1 to T do
3: for j = 1 to δ do
4: if (v ∈ A) = true then
5: with probability 2
−BCiδ+j do
6: transmit (v.id, µv )
7: otherwise
8: listen
9: else
10: listen
11: if received a message (u.id, µ) then µv ← µ
12: if µ 6= ∅ & (v ∈ R) then (v ∈ A) ← true
推荐答案
这篇关于如何使用c#实现此算法?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!