Algorithm 2: Broadcasting using Euclidean Circle Each node v: Forming a spanning tree T if v received the message (Each node keeps (u, x, d) the a neighbor list in T) if x is not v then Transmitting data in ignore The message. depth-first style Otherwise. select a neighbor w whom v hasn't sent the Sender receiver data message to yet and transmit the message (v, w, d). If v has sent the message to all its Source u eighbor v sent the message (v, parent, d) Observations It is a Deterministic algorithm: only one node transmits in one time slot Communication complexity: Totally 2 (n-1)time slots with n nodes It is expensive in a large scale of networkAlgorithm 2: Broadcasting using Euclidean Circle Source u Observations: • It is a Deterministic algorithm: only one node transmits in one time slot. •Communication complexity: Totally 2(n-1) time slots with n nodes It is expensive in a large scale of network!!! • Forming a spanning tree T (Each node keeps a neighbor list in T) • Transmitting data in depth-first style v (Sender, receiver, data) Each node v: if v received the message (u, x, d) then if x is not v, then ignore the message. Otherwise, select a neighbor w whom v hasn’t sent the message to yet and transmit the message (v,w,d). If v has sent the message to all its neighbor, v sent the message (v, parent, d)