ARB algorithm(bidirectional) phase k(nodes with ID<2 act mainly)(total 9. 2k-l rounds) stage A: (knowing the neighbors)(2k-l rounds) Each node sends own id stage B: (transmitting the minimum ID)(2 rounds) Each node sends the minimum id of its neighbors's Ids stage C: (judging the recognition of all neighbors)( 2K rounds) The nodes with minimum id(in Stage B)and Id>2k send their Ids (at least one node in neighbors act as a transmitter stage D: (confirming the completion)(2. 2 rounds) a source node transmits the source message and collects the information in Stage Cstage A : (knowing the neighbors) Each node sends own ID. stage B : (transmitting the minimum ID) Each node sends the minimum ID of its neighbors’s IDs. stage C : (judging the recognition of all neighbors) The nodes with minimum ID (in Stage B) and ID>2 k send their IDs. (at least one node in neighbors act as a transmitter) stage D : (confirming the completion) A source node transmits the source message and collects the information in Stage C. (2 k-1 rounds) (2 k rounds) (2･2 k rounds) ARB algorithm (bidirectional) phase k (nodes with ID<2k act mainly) (total 9･2 k-1 rounds) (2 k rounds)