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