Click here to Skip to main content
15,886,362 members
Please Sign up or sign in to vote.
1.00/5 (5 votes)
See more:
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
Posted
Updated 18-Dec-14 5:14am
v2
Comments
Mehdi Gholam 18-Dec-14 10:49am    
Looks like homework.
MasterCodeon 18-Dec-14 10:56am    
what in the world is it?
foudelsalhi 18-Dec-14 10:58am    
you can find description in this link:
http://arxiv.org/pdf/1404.2387.pdf

1 solution

I suggest you look for the arithmetic solutions for each and program the equations.

Don't forget to use the math library.
 
Share this answer
 
Comments
foudelsalhi 18-Dec-14 11:02am    
i need solution for this because i have two others algorithms ....
see this link : http://arxiv.org/pdf/1404.2387.pdf

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900