Communication on Wireless on AD-NETs -Continue Another example-How to get a neighbor list(suppose there is a global clock at each node) )? Algorithm: Building neighbor list by using Round Robin Each node: Node v transmits its id at the time slot same as its ⑨ id's ⑦ observations Each node can have a neighbor list after n time-slot Synchronization is needed Questions: 1. How to get a neighbor list if the ids of nodes are not numbered contiguously 2. Counting problem: How to number n nodes from 1 to n? 3. Leader selection problem: how to select a leader?9 4 3 5 8 2 6 1 7 Another example - How to get a neighbor list (suppose there is a global clock at each node) ? Algorithm: Building neighbor list by using Round Robin Each node v: Node v transmits its id at the time slot same as its id’s. Observations: • Each node can have a neighbor list after n time-slot. • Synchronization is needed. Communication on Wireless on AD-NETs – Continue Questions: 1. How to get a neighbor list if the Ids of nodes are not numbered contiguously? 2. Counting problem: How to number n nodes from 1 to n? 3. Leader selection problem: how to select a leader?