ARB algorithm(bidirectional) stage A (knowing the neighbors Node with 2-l<ID<2 sends own ID i in i-th round(2k-1 round round 5 2.4 4 phasek i 4 4 phase k-1 5 transmitter ID: IDs of neighbors1 2 4 5 10 7 8 11 1,4 2,5 2,4 4,5 4 2 :transmitter ID ARB algorithm (bidirectional) round 5 phase k-1 phase k :IDs of neighbors stage A (knowing the neighbors) Node with 2 k-1<ID≤2 k sends own ID i in i-th round (2 k-1 rounds)