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